1027. Colors in Mars (20)
2016-04-06 22:29
267 查看
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
时间限制
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<vector> #include<string> using namespace std; int main() { vector<int> vec; int temp,count=0; int a[3]; cin>>a[0]>>a[1]>>a[2]; for(int i=2;i>=0;i--) { count=0; temp=a[i]; while(temp) { vec.push_back(temp%13); count++; temp=temp/13; } while(count<2)//判断为0的情况,如果temp是一位,则加一个零,如果temp是零,则要加两个零 { vec.push_back(0); count++; } } cout<<"#"; for(int i=vec.size()-1;i>=0;i--) { if(vec[i]==10) cout<<"A"; else if(vec[i]==11) cout<<"B"; else if(vec[i]==12) cout<<"C"; else cout<<vec[i]; } }
相关文章推荐
- 代理模式剖析
- IDE介绍以及Eclipse的简单使用
- PAT 乙级 1037. 在霍格沃茨找零钱
- hdu 1081 To The Max
- Recall(召回率);Precision(准确率);F1-Meature(综合评价指标);true positives;false positives;false negatives.
- 复利计算5.0—结对编程
- 一致性Hash算法及使用场景
- Python xlrd进行EXCEL操作
- JS中的实例方法与静态方法
- HDU-1426(Sudoku Killer)(dfs+巧妙思维)
- Codeforces--584A--Olesya and Rodion(水题)
- workSpace下多工程联编
- ATM机模拟消费
- 使用Navicat for Oracle新建表空间、用户及权限赋予---来自烂泥
- 电流环差分信号传送数字信号
- android下的读写权限
- Groovy1-基本类型与运算符
- openStack 主机流量计运行状态 随笔记录
- [IO]——文件的读取
- IPP 应用范围