The 3n + 1 problem

题目描述

Consider the following algorithm to generate a sequence of numbers. Start with an integer n. If n is even, divide by 2. If n is odd, multiply by 3 and add 1. Repeat this process with the new value of n, terminating when n = 1. For example, the following sequence of numbers will be generated for n = 22

输入

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

输出

For each pair of input integers i and j, output i, j in the same order in which they appeared in the input and then the maximum cycle length for integers between and including i and j. These three numbers should be separated by one space, with all three numbers on one line and with one line of output for each line of input

样例输入：

1 10
100 200
201 210
900 1000

样例输出：

1 10 20
100 200 125
201 210 89
900 1000 174

#include <stdio.h>
int main()
{
	int  i, j, k=1,m,n ;
	int s[1000];
	int a,b,c;
	while (scanf("%d %d", &a, &b) != EOF)
	{

		for (i = a; i <= b; i++)
		{
			j = i;
			k = 1;
			while (j != 1)
			{
				if (j % 2 == 0)
				{
					j = j / 2;
				}
				else
				{
					j = j * 3 + 1;
				}
				k++;
			}
			s[i] = k;
		}

		for (m = a; m <= b; m++)
		{
			for (n = a; n < a + b - m; n++)
			{
				if (s[n] > s[n + 1])
				{
					int temp = s[n];
					s[n] = s[n + 1];
					s[n + 1] = temp;
				}
			}
		}
		printf("%d %d %d\n", a, b, s[b]);
	}
	
	return 0;
}