hdoj-5670-Machine

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

按照题目告诉你的规律，自己随便手推一下发现是有规律的
然后自己模拟过去就好了

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;typedef long long ll;char str[35];const char s[3] = {'R', 'G', 'B'};int main(){    int t;    scanf("%d",&t);    while(t--)    {        for(int i=0;i<35;i++) str[i]='R';        int n;        ll m;        scanf("%d%lld",&n,&m);        for (int i=n-1; i>=0; i--){            str[i] = s[m%3];            m /= 3;        }        for (int i=0; i<n; i++)            printf("%c", str[i]);        printf("\n");    }    return 0;}