10400:The 3n + 1 problem Time Limit: 10 sec Background Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs. Description Consider the following algorithm: […]

10401: Fibonaccimal Base Time Limit: 10 sec Background The well known Fibonacci sequence is obtained by starting with 0 and 1 and then adding the two last numbers to get the next one. For example the third number in the sequence is 1 (1=1+0), the forth is 2 (2=1+1), the fifth is 3 (3=2+1) and […]

10402:What's Cryptanalysis? Time Limit: 3 sec Description Cryptanalysis is the process of breaking someone else's cryptographic writing. This sometimes involves some kind of statistical analysis of a passage of (encrypted) text. Your task is to write a program which performs a simple analysis of a given text. Input The first line of input contains a […]

10403: Funny Encryption Method Time Limit: 3 sec Background A student from ITESM Campus Monterrey plays with a new encryption method for numbers. These method consist of the following steps: Steps : (Example for 265) 1) Read the number N to encrypt M = 265 2) Interpret N as a decimal number X1= 265 (decimal) […]

10409: A mid-summer night’s dream Time Limit: 3 sec Description This is year 2200AD. Science has progressed a lot in two hundred years. Two hundred years is mentioned here because this problem is being sent back to 2000AD with the help of time machine. Now it is possible to establish direct connection between man and […]

10404: Primary Arithmetic Time Limit: 3 sec Description Children are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in which a 1 is carried from one digit position to be added to the next - to be a significant challenge. Your job is to count […]

## Recent Comments