PAT 甲级 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.

题意:

三个数分别转十三进制

AC代码:

#include <iostream>
using namespace std;
int main(){
    char ans[13];
    for(int i=0;i<10;i++) ans[i]=i+‘0‘;
    ans[10]=‘A‘,ans[11]=‘B‘,ans[12]=‘C‘;
    int a[3];
    for(int i=0;i<3;i++) cin>>a[i];
    cout<<"#";
    for(int i=0;i<3;i++){
        cout<<ans[a[i]/13]<<ans[a[i]%13];
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
char d[15]={‘0‘,‘1‘,‘2‘,‘3‘,‘4‘,‘5‘,‘6‘,‘7‘,‘8‘,‘9‘,‘A‘,‘B‘,‘C‘};
int main(){
    int a[5];
    cin>>a[1]>>a[2]>>a[3];
    cout<<"#";
    for(int i=1;i<=3;i++)
    {
        int x=a[i];
        int b[5];
        int k=0;
        //转成13进制
        while(x>=13){
            b[++k] = x/13;
            x=x%13;
        }
        b[++k]=x;
        if(k==1){
            cout<<0<<d[b[1]];
        }else{
            cout<<d[b[1]]<<d[b[2]];
        }
    }
    return 0;
} 

原文地址:https://www.cnblogs.com/caiyishuai/p/11372196.html

时间: 2024-10-25 22:26:14

PAT 甲级 1027 Colors in Mars (20 分)(简单,进制转换)的相关文章

PAT Advanced 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

PAT 甲级 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

PAT 甲级 1015 Reversible Primes (20 分) (进制转换和素数判断(错因为忘了=))

1015 Reversible Primes (20 分) A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a prime. Now given

PAT:1027. Colors in Mars (20) AC

#include<stdio.h> #include<stdlib.h> int main() { int a,b,c; //[思维]168以内的数字可以用两位13进制数表示,大大简化代码 scanf("%d%d%d",&a,&b,&c); char arr[13]={'0','1','2','3','4','5','6','7','8','9','A','B','C'}; //转为13进制的符号 printf("#"

1027. Colors in Mars (20)【进制转换】——PAT (Advanced Level) Practise

题目信息 1027. Colors in Mars (20) 时间限制400 ms 内存限制65536 kB 代码长度限制16000 B 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 Re

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 Bl

PAT (Advanced Level) 1027. Colors in Mars (20)

简单题. #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; void pri(int a) { if (a <= 9) printf("%d", a); else printf("%c", a-10+'A'); } void print(int a){ if (a >= 13

【PAT甲级】1042 Shuffling Machine (20 分)

题意: 输入洗牌次数K(<=20),输入54张牌每次洗入的位置(不是交换的位置),输出洗好的牌. 代码: #define HAVE_STRUCT_TIMESPEC#include<bits/stdc++.h>using namespace std;multiset<int>st;int a[57];int card[57],b[57];int main(){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

【PAT甲级】1041 Be Unique (20 分)(多重集)

题意: 输入一个正整数N(<=1e5),接下来输入N个正整数.输出第一个独特的数(N个数中没有第二个和他相等的),如果没有这样的数就输出"None". 代码: #define HAVE_STRUCT_TIMESPEC#include<bits/stdc++.h>using namespace std;multiset<int>st;int a[100007];int main(){ ios::sync_with_stdio(false); cin.tie(