1027. Colors in Mars (20)
2015-12-06 10:33
232 查看
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
来源: <http://www.patest.cn/contests/pat-a-practise/1027>
[/code]
来自为知笔记(Wiz)
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 71Sample Output
#123456提交代码
来源: <http://www.patest.cn/contests/pat-a-practise/1027>
#pragma warning(disable:4996)
#include <stdio.h>
#include <iostream>
using namespace std;
string Change(int i) {
string s,s1,s2;
int a, b;
a = i / 13;
b = i % 13;
char c, d;
if (a < 10)
c = (a + '0');
else
c = (a - 10 + 'A');
if (b < 10)
d = (b + '0');
else
d = (b - 10 + 'A');
s1 = c;
s2 = d;
s = s1 + s2;
return s;
}
int main(void) {
int r, g, b;
cin >> r >> g >> b;
string s1, s2, s3;
s1 = Change(r);
s2 = Change(g);
s3 = Change(b);
printf("#");
//printf("%s%s%s", s1,s2 ,s3 );
cout << s1[0]<<s1[1];
cout << s2[0] << s2[1];
cout << s3[0] << s3[1];
return 0;
}
[/code]
来自为知笔记(Wiz)
相关文章推荐
- hdu5296 Annoying problem
- Message Decowding
- hdu2475 Box
- Bad Hair Day
- Code Forces 601 A. The Two Routes(Floyd)
- html5 postMessage解决跨域、跨窗口消息传递
- crash发生时,新开一个进程的activity用于显示crash发生的详情
- 操作系统进程环境
- javaScript基础入门
- 1026. Table Tennis (30)
- Zookeeper工作原理二
- 桂林龙胜游
- c++操作符优先级表格 + 记忆方法整理
- log4j配置说明
- 河床
- UVA230-图书馆管理
- HTML5的 input:file上传类型控制
- 1025. PAT Ranking (25)
- AngularJS进阶(十八)在AngularJS应用中集成科大讯飞语音输入功能
- AngularJS进阶(十八)在AngularJS应用中集成科大讯飞语音输入功能