时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小) 题目描述 People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits are for Red, the middle 2 digits for Green, and the last 2 digits for Blue. The only difference is that they use radix 13 (0-9 and A-C) instead of 16. Now given a color in three decimal numbers (each between 0 and 168), you are supposed to output their Mars RGB values.
输入描述: Each input file contains one test case which occupies a line containing the three decimal color values.
输出描述: For each test case you should output the Mars RGB value in the following format: first output “#”, then followed by a 6-digit number where all the English characters must be upper-cased. If a single color is only 1-digit long, you must print a “0” to the left.
输入例子: 15 43 71
输出例子: 123456
题解：题意是关于进制的转换
#include<bits/stdc++.h> #include<stdlib.h> #include<iostream> using namespace std; #define vi vector<int> #define pii pair<int,int> #define x first #define y second #define all(x) x.begin(),x.end() #define pb push_back #define mp make_pair #define SZ(x) x.size() #define rep(i,a,b) for(int i=a;i<b;i++) #define per(i,a,b) for(int i=b-1;i>=a;i--) #define pi acos(-1) #define mod 1000000007 #define inf 1000000007 #define ll long long #define DBG(x) cerr<<(#x)<<"="<<x<<"\n"; #define N 200010 template <class U,class T> void Max(U &x, T y){if(x<y)x=y;} template <class U,class T> void Min(U &x, T y){if(x>y)x=y;} template <class T> void add(int &a,T b){a=(a+b)%mod;} int main() { int g,b,d; cin>>g>>b>>d; char mar[13]={'0','1','2','3','4','5','6','7','8','9','A','B','C'}; cout<<"#"; cout<<mar[g/13]<<mar[g%13]<<mar[b/13]<<mar[b%13]<<mar[d/13]<<mar[d%13]; return 0; }