zoukankan      html  css  js  c++  java
  • 1027 Colors in Mars (20 分)

    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 Specification:

    Each input file contains one test case which occupies a line containing the three decimal color values.

    Output Specification:

    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 its left.

    Sample Input:

    15 43 71
    

    Sample Output:

    #123456


    转十三进制,话不多的说,水题

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     string s;
     5     s = '#';
     6     int n;
     7     for(int i = 0; i < 3; i++){
     8         cin >> n;
     9         string st="";
    10         while(n){
    11             int k = n%13;
    12             if(k > 9){
    13                 st += (k-10) + 'A';
    14             }else{
    15                 st += k + '0';
    16             }
    17             n /= 13;
    18         }
    19         if(st.length() == 1){
    20             st += '0';
    21         }else if(st == ""){
    22             st = "00";
    23         }
    24         reverse(st.begin(),st.end());
    25         s += st;
    26     }
    27     cout << s << endl;
    28     return 0;
    29 }
  • 相关阅读:
    数据库事务之不可重复读
    数据库事务与脏读
    图结构代码实现
    哈希表与散列函数
    数据库表设计与视图
    B树和B+树
    java之字符串中查找字串的常见方法
    剑指 Offer 15. 二进制中1的个数——JS
    剑指 Offer 03. 数组中重复的数字——JS
    算法设计与分析——排序
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/11070982.html
Copyright © 2011-2022 走看看