解题思路:真的是又长又臭
参考代码:
#include<iostream>
using namespace std;
int main()
{
long long count = 1;
long long a, b;
long long max = 0;
long long n;
int flag = 0;
while (scanf("%lld%lld", &a, &b) != EOF)
{
if (a > b)
{
long long temp = a;
a = b;
b = temp;
flag = 1;
}
max = 0;
for (long long i = a; i <= b; i++)
{
count = 1;
n = i;
while (n > 1)
{
if (n % 2 == 1) n = 3 * n + 1;
else n = n / 2;
count++;
}
if (count > max)
max = count;
}
if(flag==1)
{
cout << b << ' ' << a << ' ' << max << endl;
}
else
cout << a << ' ' << b << ' ' << max << endl;
}
return 0;
}
0.0分
2 人评分