#include<bits/stdc++.h>
#include<stack>
using namespace std;
stack<int> s;
int main()
{
int n;
cin>>n;
while(n!=1){
s.push(n);
if(n%2==0){
n/=2;
}
else{
n=n*3+1;
}
}
s.push(1);
while(!s.empty()){
cout<<s.top()<<" ";
s.pop();
}
return 0;
}
P5727栈解法
猜你喜欢
转载自blog.csdn.net/weixin_45253216/article/details/107339691
今日推荐
周排行