U E D R , A S I H C RSS

3N+1 Problem/강소현

Status

Problem1207Usertalin0528
Memory252KTime16MS
LanguageC++ResultAccepted

Source Code

#include <iostream>
using namespace std;
int length(int n){
	int len = 1;
	while(n != 1){
		if(n%2 == 1)
			n = 3*n+1;
		else
			n = n/2;
		len++;
	}
	return len;

}
int maxLength(int num1, int num2){
	int i, j, max=0;
	j = num1<num2? num2 : num1;
	for(i = num1<num2? num1 : num2; i <=j; i++){
		if(max < length(i))
			max = length(i);
	}
	return max;
}
int main(){
	int num1, num2;
	while(cin>>num1>>num2)
		cout<<num1<<" "<<num2<<maxLength(num1, num2);
	return 0;
}
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2011-06-04 07:27:18
Processing time 14.5712 sec