본문 바로가기
반응형

[Public] 컴퓨터공학/UVA4

[UVA] 11362 Age Sort B Age Sort Input: Standard Input Output: Standard Output You are given the ages (in years) of all people of a country with at least 1 year of age. You know that no individual in that country lives for 100 or more years. Now, you are given a very simple task of sorting all the ages in ascending order. Input There are multiple test cases in the input file. Each case starts with an integer n (0 2011. 7. 28.
[UVA] 100 3n+1 problem The 3n + 1 problem 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. The Problem Consider the following algorithm: 1. input n 2. print n 3. if n = 1 then STOP 4. if n is odd then 5. el.. 2011. 7. 25.
[UVA] 575 Skew Binary Skew Binary When a number is expressed in decimal, the k-th digit represents a multiple of 10k. (Digits are numbered from right to left, where the least significant digit is number 0.) For example, When a number is expressed in binary, the k-th digit represents a multiple of 2k. For example, In skew binary, the k-th digit represents a multiple of 2k+1 - 1. The only possible digits are 0 and 1, e.. 2010. 4. 26.
[UVA] 10019 Funny Encryption Method 오늘 부터 UVA 알고리즘을 활성화 하기로 했다. 많은 문제를 풀어서 ACM 대회 나가보장~ 화이팅 Funny Encryption Method The ProblemHistory : A student from ITESM Campus Monterrey plays with a new encryption method for numbers. These method consist of the following steps: Steps : Example 1) Read the number N to encrypt M = 265 2) Interpret N as a decimal number X1= 265 (decimal) 3) Convert the decimal interpretation of N to its binary .. 2010. 4. 18.
반응형