题解 | #xxx定律# 递归解法

#define  _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
using namespace std;

int func(int num, int *times) {
	int n = num;
	int ans = *times;
	if (n == 1) {
		return ans;
	}
	else if (n % 2 == 0) {
		n /= 2; ans++;
		func(n, &ans);
	}
	else {
		n = 3 * n + 1;
		n /= 2; ans++;
		func(n, &ans);
	}
	*times = ans;
	return ans;
}

int main() {
	int n;
	while (scanf("%d",&n) != EOF) {
		int ans = 0;
		int* p1 = &ans;
		ans = (func(n,p1));
		printf("%d",ans);
	}
}