kms0204

#include using namespace std; int n; int f(int a, int b){ if(n

#include int a, n; long long int pow(int a, int n){ long long result=1; if(a == 1) return 1; for(int i=0;i

#include int n; long long int f(int n){ long long int sum=0; for(int i =1;i

#include int n, d[110]; int f(){ int max=d[0],index=0; for(int i=0;i

#include int arr[10000001] = { 0 }; int f(long long int n, int cnt) { if (n == 1) return cnt; if (n < 10000001 && arr[n] != 0) return cnt + arr[n]-1; if (n % 2 == 0) n /= 2; else n = n * 3 + 1; return f(n,++cnt); } int main() { int a, b,temp,max=-1,max_index; scanf("%d %d", &a, &b); for (int i = a; i max) { max = temp; max_index = i; } } printf("%d %d", max_index, max); return 0; } 사용자로부터 a, b를 ..