zoukankan      html  css  js  c++  java
  • PAT (Advanced Level) Practice 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 <iostream>
     2 #include <string.h>
     3 #include <cstring>
     4 #include <algorithm>
     5 #include <cstdio>
     6 using namespace std;
     7 char _deal(int x)
     8 {
     9     if(x>=0&&x<10) return x+'0';
    10     else if(x>=10) return x+'A'-10;
    11 }
    12 int main()
    13 {
    14     int a,b,c;
    15     while(cin>>a>>b>>c){
    16         char s[6];
    17         s[0]='#';
    18         int tmp=a/13;
    19         s[1]=_deal(tmp);
    20         tmp=a%13;
    21         s[2]=_deal(tmp);
    22         tmp=b/13;
    23         s[3]=_deal(tmp);
    24         tmp=b%13;
    25         s[4]=_deal(tmp);
    26         tmp=c/13;
    27         s[5]=_deal(tmp);
    28         tmp=c%13;
    29         s[6]=_deal(tmp);
    30         printf("%s
    ",s);
    31     }
    32     return 0;
    33 }
  • 相关阅读:
    UVa 725 Division --- 简单枚举
    最短路之Floyd算法
    最短路之Bellman-Ford算法
    快速排序算法
    Dijkstra算法 --- 单源最短路
    HDU 2553 N皇后问题 --- 经典回溯
    HDU 2072 单词数
    HDU 1241 Oil Deposits --- 入门DFS
    jq val() 和 html() 用法注意
    jq 登录正则验证
  • 原文地址:https://www.cnblogs.com/shixinzei/p/11065467.html
Copyright © 2011-2022 走看看