点击打开pat链接
#include<iostream> #include<math.h> #include<algorithm> #include<queue> #include<map> #include<set> #include<stack> #include<string> #include<vector> using namespace std; #define INF 100000000 #define maxn 100010 int store[maxn]={0}; int num,base; int k; char m[maxn]={'0','1','2','3','4','5','6','7','8','9','A','B','C'}; void change() { k=0; while(num){ store[k++]=num; num=num/13; } } int main() { cout<<"#"; for(int i=0;i<3;i++) { cin>>num; change(); for(int j=1;j>=0;j--){ cout<<m[store[j]];} fill(store,store+2,0); } return 0; }
