The (3n+1) conjecture that C language kills people without paying for their lives

---

Algorithm design ideas

1. Judge whether a number is odd or even , May adopt ：n%2 Whether it is equal to zero
2. Calculate how many times you need to cut , Define a count Variable , Its initial value is 0, Cut once and add one
3. Output count value

---

Code

#include <stdio.h>

int get_step(int n){
    
        int count = 0;
        while(n != 1){
    
                if(n%2 == 0){
    
                        n /= 2;
                }else if(n%2 == 1){
    
                        n = (3 * n + 1) / 2;
                }
                count++;
        }
        return count;
}

int main(){
    
        int n;
        scanf("%d", &n);
        int steps = get_step(n);
        printf("%d", steps);
        return 0;
}

---

Running results