#include <stdio.h>
 
// 整数nが1に到達するまでの操作回数 K(n) を計算する関数//
 
int calculate_k(long long n) {
    int count = 0;
    while (n != 1) {
        if (n % 2 == 0) {
            n = n / 2;     // 偶数の場合
        } else {
            n = 3 * n + 1; // 奇数の場合
        }
        count++;
    }
    return count;
}
 
int main() {
    printf("n, K(n)\n"); // ヘッダー出力
 
    // n=1から100までループを回して計算
    for (int i = 1; i <= 100; i++) {
        int k = calculate_k(i);
        printf("%d, %d\n", i, k);
    }
 
    return 0;
}
 
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyDmlbTmlbBu44GMMeOBq+WIsOmBlOOBmeOCi+OBvuOBp+OBruaTjeS9nOWbnuaVsCBLKG4pIOOCkuioiOeul+OBmeOCi+mWouaVsC8vCiAKaW50IGNhbGN1bGF0ZV9rKGxvbmcgbG9uZyBuKSB7CiAgICBpbnQgY291bnQgPSAwOwogICAgd2hpbGUgKG4gIT0gMSkgewogICAgICAgIGlmIChuICUgMiA9PSAwKSB7CiAgICAgICAgICAgIG4gPSBuIC8gMjsgICAgIC8vIOWBtuaVsOOBruWgtOWQiAogICAgICAgIH0gZWxzZSB7CiAgICAgICAgICAgIG4gPSAzICogbiArIDE7IC8vIOWlh+aVsOOBruWgtOWQiAogICAgICAgIH0KICAgICAgICBjb3VudCsrOwogICAgfQogICAgcmV0dXJuIGNvdW50Owp9CgppbnQgbWFpbigpIHsKICAgIHByaW50ZigibiwgSyhuKVxuIik7IC8vIOODmOODg+ODgOODvOWHuuWKmwoKICAgIC8vIG49MeOBi+OCiTEwMOOBvuOBp+ODq+ODvOODl+OCkuWbnuOBl+OBpuioiOeulwogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gMTAwOyBpKyspIHsKICAgICAgICBpbnQgayA9IGNhbGN1bGF0ZV9rKGkpOwogICAgICAgIHByaW50ZigiJWQsICVkXG4iLCBpLCBrKTsKICAgIH0KCiAgICByZXR1cm4gMDsKfQoJCg==