解题思路:
注意事项:
参考代码
#include <bits/stdc++.h>
using namespace std;
int a[1001000];
int fuck(int x) {
int ans = 1;
while (x != 1) {
if (x % 2 == 0)
x /= 2;
else
x = x * 3 + 1;
ans++;
}
return ans;
}
int main() {
for (int i = 1; i < 1e5; i++) {
a[i] = fuck(i);
}
int n, m;
while (cin >> n >> m) {
int ma = max(n, m), mi = min(n, m);
sort(a + mi, a + ma );
cout << n << " " << m << " " << a[ma - 1] << endl;
}
return 0;
}
:
0.0分
0 人评分