关闭

HDU The 3n + 1 problem

标签: ACM数论HDU水题
220人阅读 评论(0) 收藏 举报
Problem Description
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.
Input
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.
Output
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).
Sample Input
1 10
100 200
201 210
900 1000
Sample Output
1 10 20
100 200 125
201 210 89

900 1000 174


这一题关键在于输入m,n当m<n交换m,n的值,但输出的还得按原来的顺序输出。

这一题我就按题目的意思,没有任何优化什么的就过了,可能测试数据不给力,还是说每个数的cycle length都不会太长?


AC代码:


# include <cstdio> 
using namespace std;

int cal(int n){//计算cycle length
	int cnt=1;
	while(n!=1){
		if(n%2==0){
			n=n/2;
		}
		else{
			n=3*n+1;
		}
		cnt++;
	}
	return cnt;
}
int main(){
	int i, j, k, n, m, n1, m1, temp;
	int ans;
	while(scanf("%d%d", &m, &n)!=EOF){
		ans=-2000000000;
         	m1=m;n1=n;
		if(m>n){
			temp=m;m=n;n=temp;
		}
		for(i=m; i<=n; i++){
			if((temp=cal(i))>ans){
				ans=temp;
			}
		}
		printf("%d %d %d\n", m1, n1, ans);
	}
	return 0;
}

以下是改进版,虽然oj上的时间都是0,但是以下按理说更快才对;


AC代码:


# include <iostream>                           
# include <algorithm>
# include <map>
using namespace std;
map<int, int> M;
int cal(int n){
    if(M[n]){
    	return M[n];
	}
	else{
		if(n%2==0){
			return M[n]=cal(n/2)+1;
		}
		else{
			return M[n]=cal(3*n+1)+1;
		}
	}
}
int main(){
    int i, j, k, m, n, m1, n1, ans, temp;
    M[1]=1;
    while(scanf("%d%d", &m, &n)!=EOF){
    	ans=-2000000000;
    	m1=m;n1=n;
    	if(m>n)
    	swap(m, n);
    	for(i=m; i<=n; i++){
    		if((temp=cal(i))>ans){
    			ans=temp;
			}
		}
		printf("%d %d %d\n", m1, n1, ans);
	}
	return 0;
}




0
0
查看评论

HDU-The 3n + 1 problem (3n + 1问题)

问题及代码: Problem J The 3n + 1 problem (3n + 1问题) Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/O...
  • MIKASA3
  • MIKASA3
  • 2015-02-27 22:53
  • 881

HDOJ, 杭电1032, The 3n+1 problem. POJ, 北大OJ,1207....数学题。。又一发

一个英文题。。。 Uva的第一道题目。HDOJ的1032题,POJ的1207题、、、 坑爹的POJ居然不识别 _int64,不过还好,他没要求大于int型的数字。。。所以,用int,AC险过了。。。 题目的大致意思就是,对于一个数字(1-10000),如果是偶数就将它除以二,如果是奇数就将它3*n+...
  • hu1020935219
  • hu1020935219
  • 2013-09-21 13:58
  • 1457

ACM--次数最多--HDOJ 1032--The 3n + 1 problem--水(数据太弱)

HDOJ题目地址:传送门 The 3n + 1 problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • qq_26891045
  • qq_26891045
  • 2016-07-15 15:51
  • 1395

3n+1_problem_Uva

这道题,其实说难也难,说简单也简单,关键在其测试数据。如果测试数据很苛刻,就很难了(参看博客UVa Problem 100 The 3n+1 problem (3n+1 问题))。 这里,我要写两点想法:第一,题目中说求数字i,j之间的最大循环节长度,但是样例输入却都是按min,max的顺序给出,这...
  • cylj102908
  • cylj102908
  • 2016-04-30 22:49
  • 262

3n+1problem

B - The 3n + 1 problem Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:10000KB   ...
  • a716121
  • a716121
  • 2015-08-19 17:32
  • 646

The 3n+1 Problem 题解

按照题目给的流程先计算然后找个max变量记录最大值输出即可 WA了一次,自以为n #include int main() { int n,m; while (scanf("%d%d",&n,&m)!=EOF) { int...
  • Parkerljc
  • Parkerljc
  • 2018-01-15 10:57
  • 33

HDU1032:The 3n + 1 problem

Problem Description Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). ...
  • libin56842
  • libin56842
  • 2013-02-27 12:13
  • 5783

UVa Problem 100 The 3n+1 problem (3n+1 问题)

// The 3n+1 problem (3n+1 问题) // PC/UVa IDs: 110101/100, Popularity: A, Success rate: low Level: 1 // Verdict: Accepted // Submission Date: 2011-05...
  • metaphysis
  • metaphysis
  • 2011-05-19 13:35
  • 10200

hdu The 3n + 1 problem

//hdu The 3n + 1 problem //想了很久没有一个好的方法,没想到暴力就可以过 #include #include #include using namespace std; int main() { int n,m,num,len,anslen,i,l,r; w...
  • u014068781
  • u014068781
  • 2014-09-24 21:08
  • 222

The 3n + 1 problem(杭电1032)(暴力求解)

The 3n + 1 problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2316...
  • hdd871532887
  • hdd871532887
  • 2014-11-24 23:33
  • 1039
    个人资料
    • 访问:71263次
    • 积分:2744
    • 等级:
    • 排名:第15494名
    • 原创:211篇
    • 转载:0篇
    • 译文:0篇
    • 评论:9条
    文章分类
    最新评论