【UVA】【第0章】694 - The Collatz Sequence

The Collatz Sequence

An algorithm given by Lothar Collatz produces sequences of integers, and isdescribed as follows:

Step 1:

Choose an arbitrary positive integer A as the first item inthe sequence.

Step 2:

If A = 1 then stop.

Step 3:

If A is even, then replace A by A / 2 and go to step 2.

Step 4:

If A is odd, then replace A by 3 * A + 1 and go to step 2.

It has been shown that this algorithm will always stop (in step 2) for initialvalues of A as large as 10⁹, but some values of A encountered inthe sequence may exceed the size of an integer on many computers. In thisproblem we want to determine the length of the sequence that includes allvalues produced until either the algorithm stops (in step 2), or a valuelarger than some specified limit would be produced (in step 4).

Input 

The input for this problem consists of multiple test cases. For each case,the input contains a single line with two positive integers, the first givingthe initial value of A (for step 1) and the second giving L, the limitingvalue for terms in the sequence. Neither of these, A or L, is largerthan 2,147,483,647 (the largest value that can be stored in a 32-bit signedinteger). The initial value of A is always less than L. A line thatcontains two negative integers follows the last case.

Output 

For each input case display the case number (sequentially numbered startingwith 1), a colon, the initial value for A, the limiting value L, and thenumber of terms computed.

Sample Input 

 3 100
 34 100
 75 250
 27 2147483647
 101 304
 101 303
 -1 -1

Sample Output 

 Case 1: A = 3, limit = 100, number of terms = 8
 Case 2: A = 34, limit = 100, number of terms = 14
 Case 3: A = 75, limit = 250, number of terms = 3
 Case 4: A = 27, limit = 2147483647, number of terms = 112
 Case 5: A = 101, limit = 304, number of terms = 26
 Case 6: A = 101, limit = 303, number of terms = 1

额。没什么好说的 递归搜索

越界或者为0 就返回

注意越界的一次不算 所以返回time - 1

代码如下

#include <cstdlib>
#include <cstdio>
#include <iomanip>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

int A;
int limit;

int dfs(int num, int time)
{
  if (num == 1) return time;
  if (num > limit || num < 0) return time - 1;
  if (num % 2 == 0)
  {
   return dfs(num / 2, time + 1);
  }
  else if(num % 2 != 0)
  {
   return dfs(3 * num + 1, time + 1);
  }
  return time;
}

void init_file()
{
	freopen("White_GS_11.in", "r", stdin);
	freopen("White_GS_11.out", "w", stdout);
}

void read_data()
{
	int l = 0;
	while(scanf("%d %d", &A, &limit) == 2)
	{
		if (A == -1 && limit == -1) exit(0);
		l++;
		printf("Case %d: A = %d, limit = %d, number of terms = %d\n", l, A, limit, dfs(A, 1));
	}
}

void work()
{

}

int main()
{
  init_file();
  read_data();
  work();
  return 0;
}