题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1197
心得:
利用映射表转换字符。
代码:
#include <iostream>
#include <map>
using namespace std;
int main(){
char base10[20],base12[20],base16[20];
int i,j,sum10,sum12,sum16;
map<char,int> mp;
for(i=0;i<10;i++) mp['0'+i]=i;
for(i='a';i<='f';i++) mp[char(i)]=i-'a'+10;
for(i=2992;i<10000;i++){
sum10=0;sum12=0;sum16=0;
itoa(i,base10,10);
itoa(i,base12,12);
itoa(i,base16,16);
for(j=0;j<strlen(base10);j++) sum10+=mp[base10[j]];
for(j=0;j<strlen(base12);j++) sum12+=mp[base12[j]];
for(j=0;j<strlen(base16);j++) sum16+=mp[base16[j]];
if(sum10==sum12 && sum12==sum16) cout<<i<<endl;
}
return 0;
}
如果输出值较少,为了提高运行效率,可以将以上输出值存入txt,然后直接输出结果。
下附暴力0MS打表代码:
#include <iostream>
using namespace std;
int main(){
int a[100]= {2992,2993,2994,2995,2996,2997,2998,2999,4470,4471,4472,4473,4474,4475,4970,4971,4972,4973,
4974,4975,5460,5461,5462,5463,5464,5465,5466,5467,5468,5469,5960,5961,5962,5963,6456,6457,6458,6459,
7440,7441,7442,7443,7444,7445,7446,7447,7448,7449,7940,7941,7942,7943,8436,8437,8438,8439,9424,9425,
9426,9427,9428,9429,9924,9925,9926,9927,9928,9929};
for(int i=0;i<strlen(a);i++){
cout<<a[i]<<endl;
}
return 0;
}