PAT 1027. Colors in Mars (20)

1027. Colors in Mars (20)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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.

Input

Each input file contains one test case which occupies a line containing the three decimal color values.

Output

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.

Sample Input

15 43 71

Sample Output

#123456

---

提交代码

/*
	1. Hash思想 实现下标转化为相应字符。
	2. 数位少果断暴力列举，不要把简单问题复杂化。
*/
#include<stdio.h>
const int MAX=6;
char ans[MAX];
char hashNum[]={'0','1','2','3','4','5','6','7','8','9','A','B','C'};
void radixCV(int a,int b,int c)  //x是一个2位十进制数
{
	int i;
	for(i=0;i<2;i++)
		ans[i]='0';
	ans[0]=hashNum[a/13];
	ans[1]=hashNum[a%13];
	ans[2]=hashNum[b/13];
	ans[3]=hashNum[b%13];
	ans[4]=hashNum[c/13];
	ans[5]=hashNum[c%13];	
}
int main()
{
	int a,b,c;
	//freopen("G:\\in.txt","r",stdin);
	while(scanf("%d%d%d",&a,&b,&c)!=EOF){
		radixCV(a,b,c);
		printf("#%s\n",ans);
	}
	return 0;
}