1027. Colors in Mars (20)

最新推荐文章于 2024-05-22 17:52:35 发布

TAO先森

最新推荐文章于 2024-05-22 17:52:35 发布

阅读量113

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT习题

本文链接：https://blog.youkuaiyun.com/xiayu0002/article/details/79745403

PAT习题专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一个将十进制颜色值转换为火星计算机中使用的13进制RGB颜色表示的算法。通过具体的输入输出示例展示了如何实现这一转换，并提供了一段C++代码作为实现方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1027. Colors in Mars (20)

时间限制

400 ms

内存限制

65536 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

#include<iostream>
#include<fstream>
#include<string>
using namespace std;
int main()
{
	
	int num[3];
	cin >> num[0] >> num[1] >> num[2];
	string color;
	int i, j;
	char c;
	color.push_back('#');
	for (int m = 0; m < 3; m++)
	{
		i = num[m] / 13;
		if (i >= 10)c = i - 10 + 'A';
		else c = i + '0';
		color.push_back(c);
		j = num[m] % 13;
		if (j >= 10)c = j - 10 + 'A';
		else c = j + '0';
		color.push_back(c);
	}
	cout << color;
	
	return 0;
}