HDU 5670 Machine

来源：互联网发布：电脑程序编程编辑：程序博客网时间：2024/06/09 23:32

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=5670

思路：用递归实现输出在后，比较麻烦，保存在数组里，倒着输出数组比较方便

AC代码：

#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <queue>#include <stack>#include <map>#include <cstring>#include <climits>#include <cmath>#include <cctype>const int inf = 0x3f3f3f3f;//1061109567typedef long long LL;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;int deng[35];int main(){    int t;    scanf("%d",&t);    while(t--)    {        memset(deng,0,sizeof(deng));        int m;        unsigned long long n;        cin>>m>>n;        int len=0;        while(n!=0)        {            deng[len++] = n % 3;            n /= 3;        }        for(int i=m-1; i>=0; i--)        {            if(deng[i] == 0)                printf("R");            else if(deng[i] == 1)                printf("G");            else if(deng[i] == 2)                printf("B");        }        printf("\n");    }    return 0;}

0 0