Little Jay

진법 계산을 요구하는 Brute Force 문제 #include #define endl '\n' using namespace std; const int numbers[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }; bool check(int dec, int hex, int doz) { return (dec == hex && hex == doz); } int dozen_calc(int n) { int doz_num = 0; int temp = n; while (temp) { doz_num += numbers[temp % 12]; temp /= 12; } return doz_num; } int hex_calc(int n) { int hex_num..