POJ1207

The 3n + 1 problem

暴力破解

#include<iostream>

using namespace std;
int cycnum(int n)
{
  int ncycle=1;
  while(n != 1)
  {
    if(n%2) n=3*n + 1;
    else n = n/2;
    ncycle = ncycle + 1;
  }
  return ncycle;
}
int main()
{
  int a,b;
  while(cin>>a>>b)
  {
    int x = a<b?a:b;
    int y = a>b?a:b;
    int maxcycle=0;
    for(int i = x;i<=y;i++)
    {
      int temp = cycnum(i);
      if(maxcycle < temp)
          maxcycle = temp;
    }
    cout<<a<<' '<<b<<' '<<maxcycle<<endl;
  }
  return 0;
}