http://acm.hdu.edu.cn/showproblem.php?pid=1197
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define rep(i,a,b) for(int i = a ; i <= b ; i ++)
#define rrep(i,a,b) for(int i = b ; i >= a ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x) memset(a,x,sizeof(a))
#define eps 1e-8
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5;
const int MAXE = 2e5;
typedef long long LL;
typedef unsigned long long ULL;
int T,n,m,k;
void input() {
}
void solve() {
int tmp,cnt12,cnt10,cnt16;
rep(i,2992,9999) {
tmp = i;
cnt12 = cnt10 = cnt16 = 0;
while(tmp) {
cnt12 += tmp % 12; tmp /= 12;
}
tmp = i;
while(tmp) {
cnt10 += tmp % 10; tmp /= 10;
}
tmp = i;
while(tmp) {
cnt16 += tmp % 16; tmp /= 16;
}
if(cnt12 == cnt10 && cnt10 == cnt16) {
printf("%d\n",i);
}
}
}
int main(void) {
input();
solve();
return 0;
}