1095: The 3n + 1 problem

解题思路:

注意事项:

参考代码:

#include

int asd(int n)

{

    int a;

if (n % 2 == 0)

{

a = 1;

}

else

{

a = 0;

}

return a;

}

int main()

{

int i, j; int max = 0, k;

int a, b = 0;

while (scanf("%d%d", &i, &j)!=EOF)

{

printf("%d %d", i, j);

if (i > j)

{

int t;

t = i;

i = j;

j = t;

}

for (int q = i; q <= j; q++)

{

int w = q;

a = 1;

while (w != 1)

{

if (asd(w))

{

w /= 2;

a++;

}

if (!asd(w) && w != 1)

{

w = w * 3 + 1;

a++;

}

}

k = a;

if (max < k)

{

max = k;

}

}

printf(" %d\n", max);

max = 0;

}

}