1027. Colors in Mars (20)

原创 2015年07月10日 13:21:53

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

这个题很简单,但是我能说我刚开始没理解题意吗?后来看了网上的解释,才知道这题其实就是进制转换和符合要求的格式输出,题目不难,代码也实现了,但是代码确实不优

//功能是实现了,代码确实不优美
int main()
{
	int r, g, b;
	int d = 13;
	cin >> r >> g >> b;
	vector<int> rnum;
	int rshang = r / d;
	int ryushu = r%d;
	rnum.push_back(ryushu);
	while (rshang != 0)
	{
		ryushu = rshang % d;
		rnum.push_back(ryushu);
		rshang = rshang / d;
	}	

	vector<int> gnum;
	int gshang = g / d;
	int gyushu = g%d;
	gnum.push_back(gyushu);
	while (gshang != 0)
	{
		gyushu = gshang % d;
		gnum.push_back(gyushu);
		gshang = gshang / d;
	}

	vector<int> bnum;
	int bshang = b / d;
	int byushu = b%d;
	bnum.push_back(byushu);
	while (bshang != 0)
	{
		byushu = bshang %  d;
		bnum.push_back(byushu);
		bshang = bshang / d;
	}

	cout << "#";
	if (rnum.size() == 1)
	{
		int num = rnum[0];
		cout << 0;
		if (num < 10)
		{
			cout << num;
		}
		else if (num==10)
		{
			cout << "A";
		}
		else if (num == 11){ cout << "B"; }
		else if (num == 12){ cout << "C"; }
	}
	else
	{
		for (int i = rnum.size() - 1; i >= 0; i--)
		{
			int num = rnum[i];
			if (num<10)
			{
				cout << num;
			}
			else if (num == 10){ cout << "A"; }
			else if (num == 11){ cout << "B"; }
			else if (num == 12){ cout << "C"; }
		}
	}

	
	if (gnum.size() == 1)
	{
		int num = gnum[0];
		cout << 0;
		if (num < 10)
		{
			cout << num;
		}
		else if (num == 10)
		{
			cout << "A";
		}
		else if (num == 11){ cout << "B"; }
		else if (num == 12){ cout << "C"; }
	}
	else
	{
		for (int i = gnum.size() - 1; i >= 0; i--)
		{
			int num = gnum[i];
			if (num<10)
			{
				cout << num;
			}
			else if (num == 10){ cout << "A"; }
			else if (num == 11){ cout << "B"; }
			else if (num == 12){ cout << "C"; }
		}
	}

	if (bnum.size() == 1)
	{
		int num = bnum[0];
		cout << 0;
		if (num < 10)
		{
			cout << num;
		}
		else if (num == 10)
		{
			cout << "A";
		}
		else if (num == 11){ cout << "B"; }
		else if (num == 12){ cout << "C"; }
	}
	else
	{
		for (int i = bnum.size() - 1; i >= 0; i--)
		{
			int num = bnum[i];
			if (num<10)
			{
				cout << num;
			}
			else if (num == 10){ cout << "A"; }
			else if (num == 11){ cout << "B"; }
			else if (num == 12){ cout << "C"; }
		}
	}
	return 0;
}

别人的简洁代码http://blog.csdn.net/realxuejin/article/details/10183487

#include<vector>
#include <sstream>
#include<cmath>
#include<iomanip>
#include<iostream>
#include <ctype.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

char red[2];
char green[2];
char blue[2];

void change(int a, char color[2], int d)
{
	int i = 0;
	do
	{
		if ((a%d) < 10)
		{
			color[i++] = ((a%d) + '0');
		}
		else
		{
			color[i++] = (a%d) + 'A' - 10;
		}		
	} while (a != 0);
}

int main()
{
	memset(red, '0', sizeof(red));//用memset函数进行内存初始化
	memset(green,'0',sizeof(green));
	memset(blue,'0',sizeof(blue));

	int d = 13;
	int a, b, c;
	cin >> a >> b >> c;
	change(a, red, d);
	change(b, green, d);
	change(c, blue, d);
	cout << "#";
	cout << red[1] << red[0];
	cout << green[1] << green[0];
	cout << blue[1] << blue[0] << endl;

	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

1027. Colors in Mars (20)

这个题目的本质是考察除k取余法,方法为用十进制数去除以基数k,每次把商数作为下一次的值,余数写在旁边,一直做到商数小于基数,结束运算,然后从下到上,从最后一个商数到第一个余数的路径上所有的数构成了结果...

PAT甲级.1027. Colors in Mars (20)

1027. Colors in Mars (20) 题目: People in Mars represent the colors in their computers in a similar ...

pat乙级真题:1027. 打印沙漏(20)

题目链接                点击打开链接 题目思路     由于输入为不大于1000的整数,于是构建一个hourglass[50][99]存储一个沙漏的上半部分。0代表空格,1代表输入...

1027. 打印沙漏(20)

本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印 ***** *** * *** ***** 所谓“沙漏形状”,是指每行输出奇数个符号;各行符号中心...

PAT(B) - 1027. 打印沙漏(20)

1027. 打印沙漏(20) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判题...
  • flx413
  • flx413
  • 2016年07月25日 10:04
  • 269

1027. 打印沙漏(20)-PAT乙级

题目: 本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印 ***** *** * *** *****所谓“沙漏形状”,是指每行输出奇数个符号;各行符...

1027. 打印沙漏(20) PAT乙级真题

1027. 打印沙漏(20) 本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印 ***** *** * *** ***** 所谓“沙漏形状”,...

PAT B1027. 打印沙漏(20)

本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印 ***** *** * *** ***** 所谓“沙漏形状”,是指每行输出奇数个符号;各行符...
  • jolivan
  • jolivan
  • 2017年02月05日 10:52
  • 65

1027. 打印沙漏(20)

本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印 ***** *** * *** ***** 所谓“沙漏形状”,是指每行输出奇数个符号;各行符...

PAT 乙级 1027. 打印沙漏(20)

1027. 打印沙漏(20) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判题...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1027. Colors in Mars (20)
举报原因:
原因补充:

(最多只允许输入30个字)