秋心无波

摘要： 1133. Fibonacci SequenceTime limit: 1.0 secondMemory limit: 64 MBis an infinite sequence of integers that satisfies to Fibonacci conditionFi+2=Fi+1+Fifor any integeri. Write a program, which calculates the value ofFnfor the given values ofFiandFj.InputThe input contains five integers in the followin 阅读全文

摘要： 1352. Mersenne PrimesTime limit: 1.0 secondMemory limit: 64 MBDefinition.If the number 2N−1 is prime then it is called aMersenne prime number.For example, 22−1 — the first Mersenne prime, 23−1 — the second Mersenne prime, 211213−1 — the 23rd, 2216091−1 — the 31st.It’s a hard problem to find those nu 阅读全文

摘要： 1086. CryptographyTime limit: 2.0 secondMemory limit: 64 MBWhile preparing this problem set the jury has run into the following problem: it was necessary to send by e-mail the texts of the problems. As it is well known, e-mail is not reliable, messages are sent not enciphered, there is a danger that 阅读全文

摘要： 1118. Nontrivial NumbersTime limit: 2.0 secondMemory limit: 64 MBSpecialists of SKB Kontur have developed a unique cryptographic algorithm for needs of information protection while transmitting data over the Internet. The main advantage of the algorithm is that you needn't use big numbers as key 阅读全文

摘要： Channel AllocationTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 18Accepted Submission(s) : 7Problem DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a st 阅读全文

摘要： Shredding CompanyTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 15Accepted Submission(s) : 11Problem DescriptionYou have just been put in charge of developing a new shredder for the Shredding Company Although a "normal" shredder would jus 阅读全文

摘要： PotsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 31Accepted Submission(s) : 14Special JudgeProblem DescriptionYou are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 阅读全文

摘要： Prime PathTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 21Accepted Submission(s) : 18Problem DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-di 阅读全文

摘要： Find The MultipleTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 43Accepted Submission(s) : 21Special JudgeProblem DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains onl 阅读全文

摘要： Catch That CowTime Limit : 4000/2000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 67Accepted Submission(s) : 22Problem DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 ≤N≤ 100,000) o 阅读全文