前往
大廳
主題

[OJ練習] 100

テリ君(桃夫模式) | 2022-11-16 10:57:00 | 巴幣 16 | 人氣 177

100


# include <stdio.h>

int x[4],y[4];
int count[4], result[4];

int main(void){
    for(int i = 0; i < 4; i ++){
        scanf("%d %d", &x[i], &y[i]);
        printf("%d %d ", x[i], y[i]);
        while(x[i] < y[i]){
            int n;
            n = x[i];
            count[i] = 1;
            
            while(n != 1){
                if(n % 2 == 0){
                    n = n / 2;
                }
                else{
                    n = 3 * n + 1;
                }
                count[i] ++;
            }
            
            x[i] ++;
            
            if(count[i] > result[i]){
                result[i] = count[i];
            }
        }
        printf("%d\n", result[i]);
    }
    
    return 0;
}


主觀難度: 2/5

第一篇解釋一下難度:
1:自己完全寫得出來不用提示
2:爬文找些許提示就寫出來
3:想很久,抄了一些東西
4:想超久,幾乎全抄
5:全抄,只能當上課理解

創作回應

更多創作