hdu5670Machine

Problem Description
There is a machine with m(2≤m≤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≤n<263) times?

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

The only line contains two integers m(2≤m≤30) and n(1≤n<263).

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个状态循环，每3影响左一位。其实就是化3进制，保留低m位数。有几个转态循环就是几进制。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
char s[]={'R','G','B'};
int main()
{
    long long int m,n,x,y;
    int t;
    cin>>t; 
    while(t--)
    {
        char b[100];
        cin>>m>>n;
        int rel=0;
        while(n)
        {
            y=n%3;
            b[rel++]=s[y];
            n/=3;
        }
        if(m>rel)
        {
          for(int i=1;i<=m-rel;i++)
           cout<<"R";
           for(int i=rel-1;i>=0;i--)
           cout<<b[i];
            cout<<endl;
        }
        else
        {
            for(int i=m-1;i>=0;i--)
            cout<<b[i];
            cout<<endl;
        }
    }
    return 0;
}