hdu 5670 Machine（模拟）

Description

There is a machine with  m (2\leq m\leq 30)  coloured bulbs and a button.When the button is pushed, the rightmost bulb changes. 
For any changed bulb, 

if it is red now it will be green; 

if it is green now it will be blue; 

if it is blue now it will be red and the bulb that on the left(if it exists) will change too. 

Initally all the bulbs are red. What colour are the bulbs after the button be 
pushed  n (1\leq n< {2}^{63})  times?

 

Input

There are multiple test cases. The first line of input contains an integer  T (1\leq T\leq 15)  indicating the number of test cases. For each test case: 

The only line contains two integers  m (2\leq m\leq 30)  and  n (1\leq n< {2}^{63}) .

 

Output

For each test case, output the colour of m bulbs from left to right. 
R indicates red. G indicates green. B indicates blue.

 

Sample Input

    
    

     
     2
3 1
2 3 
    
    

 

Sample Output

    
    

     
     RRG
GR 
    
    

分析：

可能是我语文学的不好吧，比赛时没有理解题意，等我理解了比赛也结束了，

题目是说灯有红蓝绿三种颜色转换，右边的一秒变一次，左边的3秒变一次，

依次向左推，输出最后灯的颜色！

#include<stdio.h>
#include<string.h>
int main()
{
    long long  n;
    int i,j,t,m;
    char a[35];
    scanf("%d",&t);
    while(t--)
    {
        memset(a,'R',sizeof(a));
        scanf("%d%I64d",&m,&n);
        long long  c=3,b=1;
        for(i=m-1; i>=0; i--)
        {
            if( (n%c)/b==0)
                a[i]='R';
            if((n%c)/b==1)
                a[i]='G';
            if((n%c)/b==2)
                a[i]='B';
            c*=3;
            b*=3;
        }
        a[m]='\0';
        printf("%s\n",a);
    }
    return 0;
}