随笔分类 - ACM~~Timus
摘要:1017. StaircasesTime limit: 1.0 secondMemory limit: 64 MBOne curious child has a set ofNlittle bricks (5 ≤N≤ 500). From these bricks he builds different staircases. Staircase consists of steps of different sizes in a strictly descending order. It is not allowed for staircase to have steps equal size
        阅读全文
                
摘要:1007. Code WordsTime Limit: 2.0 secondMemory Limit: 64 MBA transmitter sends over a noisy line some binary code words. The receiver on the other end uses special technique to recover the original words.Every word originally consists of symbols 0 and 1. All words have the same lengthN(4 ≤N≤ 1000). Af
        阅读全文
                
摘要:1008. Image EncodingTime Limit: 2.0 secondMemory Limit: 64 MBThere are several ways to encode an image. In this problem we will consider two representations of an image. We assume that the image consists of black and white pixels. There is at least one black pixel and all black pixels are connected 
        阅读全文
                
摘要:1014. Product of DigitsTime Limit: 1.0 secondMemory Limit: 64 MBYour task is to find the minimal positive integer number Q so that the product of digits of Q is exactly equal to N.InputThe input contains the single integer number N (0 ≤ N ≤ 109). OutputYour program should print to the output the onl
        阅读全文
                
摘要:1013. K-based Numbers. Version 3Time Limit: 2.0 secondMemory Limit: 64 MBLet’s considerK-based numbers, containing exactlyNdigits. We define a number to be valid if itsK-based notation doesn’t contain two successive zeros. For example:1010230 is a valid 7-digit number;1000198 is not a valid number;0
        阅读全文
                
摘要:1011. ConductorsTime Limit: 2.0 secondMemory Limit: 64 MBBackgroundEveryone making translations from English to Russian knows an English phrase "Naked conductor runs along the bus". It has two very different meanings.ProblemEvery bus in the Ekaterinburg city has a special man (or woman) ca
        阅读全文
                
摘要:1010. Discrete FunctionTime Limit: 1.0 secondMemory Limit: 64 MBThere is a discrete function. It is specified for integer arguments from 1 to N (2 ≤ N ≤ 100000). Each value of the function is longint (signed long in C++). You have to find such two points of the function for which all points between 
        阅读全文
                
摘要:1009. K-based NumbersTime Limit: 1.0 secondMemory Limit: 64 MBLet’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t contain two successive zeros. For example:1010230 is a valid 7-digit number;1000198 is not a valid number;0001235 
        阅读全文
                
摘要:1073. Square CountryTime Limit: 1.0 secondMemory Limit: 64 MBThere live square people in a square country. Everything in this country is square also. Thus, the Square Parliament has passed a law about a land. According to the law each citizen of the country has a right to buy land. A land is sold in
        阅读全文
                
摘要: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
        阅读全文
                
摘要:1002. Phone NumbersTime Limit: 2.0 secondMemory Limit: 64 MBIn the present world you frequently meet a lot of call numbers and they are going to be longer and longer. You need to remember such a kind of numbers. One method to do it in an easy way is to assign letters to digits as shown in the follow
        阅读全文
                
摘要:1001. Reverse RootTime Limit: 2.0 secondMemory Limit: 64 MBThe problem is so easy, that the authors were lazy to write a statement for it!InputThe input stream contains aset ofinteger numbersAi(0≤Ai≤ 1018). The numbers are separated byany number ofspaces and line breaks. Asize ofthe input stream doe
        阅读全文
                

 
         浙公网安备 33010602011771号
浙公网安备 33010602011771号