ACM--steps--2.2.5--模拟
2015-02-02 21:29
232 查看
The 3n + 1 problem |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 1102 Accepted Submission(s): 512 |
[align=left]Problem Description[/align] 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. Consider the following algorithm: 1. input n 2. print n 3. if n = 1 then STOP 4. if n is odd then n <- 3n + 1 5. else n <- n / 2 6. GOTO 2 Given the input 22, the following sequence of numbers will be printed 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 It is conjectured that the algorithm above will terminate (when a 1 is printed) for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.) Given an input n, it is possible to determine the number of numbers printed (including the 1). For a given n this is called the cycle-length of n. In the example above, the cycle length of 22 is 16. For any two numbers i and j you are to determine the maximum cycle length over all numbers between i and j. |
[align=left]Input[/align] The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 1,000,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no opperation overflows a 32-bit integer. |
[align=left]Output[/align] For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear in the output in the same order in which they appeared in the input and should be followed by the maximum cycle length (on the same line). |
[align=left]Sample Input[/align]1 10 100 200 201 210 900 1000 |
[align=left]Sample Output[/align]1 10 20 100 200 125 201 210 89 900 1000 174 得出的结论就是if(a&1)不能乱用,坑死我了,知识太少。#include<iostream> using namespace std; int dyx(int a) { int wyx=0; //用来计算需要进行的次数。 while(a!=1) { if(a%2==0)//奇数&1为1,偶数&1为0; //为奇数的时候。 { a/=2; } else { a=3*a+1; } wyx++; } return wyx+1; } int main() { int i,j; while(cin>>i>>j) { cout<<i<<" "<<j<<" "; if(i>j) { i=i^j; j=i^j; i=i^j; } int ans,tem; ans=tem=0; for(int a=i;a<=j;a++) { tem=dyx(a); ans=ans>tem?ans:tem; } cout<<ans<<endl; } return 0; } |
相关文章推荐
- hdu acm steps 2.2.5
- [2011山东ACM省赛] Identifiers(模拟)
- hdu acmsteps 1.2.2
- poj 1581 [ acm 判题模拟]
- hdu acm steps 1.3.8
- HDU ACMSteps 1.3.2:: 今年暑假不AC(动态规划)
- 【ACM-Steps1.2】简单字符串处理、简单数学题、进制转换系列8题(一)
- hdu-acm steps Max sum
- hdu-acm steps Common Subsequence
- 2016.2.11-2.12 HDU ACM steps
- ACM--steps--2.1.4--素数筛选
- ACM--steps--3.1.3--母牛的故事
- ACM--steps--3.3.2--Piggy-Bank(完全背包)
- HDU ACM Steps解题报告
- ACM--steps--4.3.2--Prime Ring Problem
- hdu acmsteps 2-1-3相遇周期
- ACM--steps--dyx--1.3.2--今年暑假不AC
- ACM--steps--dyx--1.3.8--Fighting for HDU
- 2015年ACM北京网络赛 B题Mission Impossible 6-链表模拟
- H Intelligent Parking Building 河南第十届ACM真题 【模拟】