1027. Colors in Mars (20)
来源:互联网 发布:金百福珠宝软件多少钱 编辑:程序博客网 时间:2024/05/06 03:02
1027. Colors in Mars (20)
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 Input15 43 71Sample 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)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 1027. Colors in Mars (20)
- 寒江独钓-Windows内核安全编程笔记-第3章代码和笔记
- [JQ权威指南]第九天:wrap()和wrapInner()方法包裹元素节点
- Linux下su命令用法
- 南阳oj 题目96 n-1位数
- 在公司工作四年记
- 1027. Colors in Mars (20)
- ubuntu全盘备份与恢复
- Factory Method模式的误区:Factory Method模式是简化版的Abstract Factory吗?
- Java对象的创建
- SAP采购中形成的差异
- 第五天
- POJ 2456 Aggressive cows(二分-最大化最小值)
- 用java8的keytool生成自签名密钥库的方法
- Python list使用详解