#include<stdio.h>
int main(){
int n,step=0;
scanf("%d",&n);
while(n!=1){
if(n%2==0){
n/=2;
}
else{
n=(3*n+1)/2;
}
step++;
}
printf("%d",step);
return 0;
}
#include<stdio.h>
int main(){
int n,step=0;
scanf("%d",&n);
while(n!=1){
if(n%2==0){
n/=2;
}
else{
n=(3*n+1)/2;
}
step++;
}
printf("%d",step);
return 0;
}
超詳細解釋最短路算法:BFS、Dijkstra、A*、Bellman-Ford及Floyd-Warshall,並給出實現。 見:圖論:常用的最短路算法詳解