杭电 -- 1197

最新推荐文章于 2022-09-30 15:14:02 发布

weixin_30695195

最新推荐文章于 2022-09-30 15:14:02 发布

阅读量101

点赞数

原文链接：http://www.cnblogs.com/kyrie211/p/11088814.html

版权

#include<stdio.h>
#include<string.h> 

int trans(int n,int type){
    int sum = 0;
    int index = 0;
    if(type==16){
        while(n != 0){
            sum += n%type;
            n = n/type;            
        }
    }else if(type==12){
        while(n != 0){
            sum += n%type;
            n = n/type;         
        }
    }
    return sum;
}

void judge(int res[],int n){
    int flag = 1;
    for(int i=1;i<3;i++){
        if(res[i]!=res[i-1]){
            flag = 0;
            break;
        }
    }
    if(flag){
        printf("%d\n",n);
    }else{
        //do null
    }
}

int sum(int n){
    int res = 0;
    res += n%10+n/10%10+n/10/10%10+n/1000;
    return res;
}

int main(){
    int res[3];
    int k;
    for(int i=2992;i<=9999;i++){
        //reset
        k = 0;
        //10
        res[k++] = sum(i);
        //12
        res[k++] = trans(i,12);
        //16
        res[k++] = trans(i,16);
        //judge
        judge(res,i);
    }
    return 0;
}