The King's ups and downs
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 163 accepted submission (s): 101 Problem descriptionthe king has guards of all different heights. rather than line them
So easy!
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 899 accepted submission (s): 244 Problem description a sequence Sn is defined:
Where a, B, n, m are positive integers. percent x
I am not very clear about the specific reason, but you can use the following method to solve the problem, that is, add two lines in the file header
Import matplotlib
Matplobmetadata. Use ('wxupload ')
Alternatively, modify the configuration
Sum of Divisors
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 2052 accepted submission (s): 713 Problem descriptionmmm is Learning Division, she's so proud of herself that she can figure out
Mayor's posters
Time limit:1000 ms
Memory limit:65536 K
Total submissions:33152
Accepted:9641
DescriptionThe citizens of bytetown, AB, cocould not stand that the candidates in the mayoral election campaign
Language:DefaultThe bad numberDescriptionJohn and Brus believe that number N is a very bad number. Thus they try to avoid it every time and everywhere.Now the guys wowould like to represent number M as a sum of
Http://www.embedu.org/Column/Column208.htm
Author: Zeng Hongan,Hua Qing vision embedded college lecturer.
A common method in network programming is: after a socket is created, it is read and written in a blocking manner. If no data is readable,
Matrix
Time limit:3000 Ms
Memory limit:65536 K
Total submissions:14826
Accepted:5583
DescriptionGiven an N * n matrix A, whose elements are either 0 or 1. A [I, j] means the number in the I-th row and J-th
Tree Construction
Time Limit: 4000/2000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 689 accepted submission (s): 369Problem descriptionconsider a two-dimen1_space with a set of points (XI, Yi) that satisfy xi YJ
Antenna placement
Time limit:1000 ms
Memory limit:65536 K
Total submissions:5486
Accepted:2743
DescriptionThe global aerial research centre has been allotted the task of building the maximum th generation of
SigactionThe function is used to check or modify the processing actions associated with the specified signal (two operations can be performed at the same time ).
It is a POSIX signal interface, while signal () is a standard C signal interface (this
Card collector
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1708 accepted submission (s): 780Special JudgeProblem descriptionin your childhood, do you crazy for collecting the beautiful cards
Faulhaber's Triangle
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 152 accepted submission (s): 74Problem descriptionthe sum of the MTH powers of the First n Integers
S (n, m) = sum (j = 1 to n)
B. Routine problemtime limit per test
1 secondMemory limit per test
256 megabytesInput
Standard InputOutput
Standard output
Manao has a monitor. The screen of the monitor has horizontal to vertical length ratioA:B.Now he is going to watch a movie.
Pen counts
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 205 accepted submission (s): 112Problem descriptionchicken farmer
XiaoyanIs getting three new chickens, Lucy, Charlie and CC. she wants
RSA factorization
Time limit:1000 ms
Memory limit:65536 K
Total submissions:471
Accepted:124
DescriptionThe positive integer N is given. it is known that n = p * q, where p and q are primes, q InputEach line
Locker
Time Limit: 6000/3000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 880 accepted submission (s): 371Problem descriptiona password locker with N digits, each digit can be rotated to 0-9 circularly.
You can
Charge-Station
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 610 accepted submission (s): 306Problem descriptionthere are n cities in m ^ 3's empire. m ^ 3 owns a palace and a car and the
One person game
Time Limit: 1 second
Memory limit: 32768 kb Special Judge
There is a very simple and interesting one-person game. You have 3 dice, namelyDie1,Die2AndDie3.Die1HasK1Faces.Die2HasK2Faces.Die3HasK3Faces. All the dice are fair
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.
A Free Trial That Lets You Build Big!
Start building with 50+ products and up to 12 months usage for Elastic Compute Service