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
https://www.cnblogs.com/qscqesze/p/5427121.html
hdu 5670 Machine（BC规律题）
搜一下不就出来了。
First: get the button push n. set n =0, then n++ when push .
Second: set every bulb array. example bulb[0]=red. bulb[1]=green and so on.
Third： set a condition. for example
n=0;
if push{
n++;
for i=0; i<len(bulb);i++{
switch(bulb[i]){
red: bulb[i]=green;
green: bulb[i]=blue;
blue: bulb[i]=red;
}
}
}