HDOJ 5670 Machine

Machine

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 447    Accepted Submission(s): 265

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
  
  

 

中文题面：点击打开链接

代码如下：

//不要hack我可好(；′⌒`)
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 0x3f3f3f
#include<cmath>
using namespace std;
char str[40];
int main()
{
	int t,m,i;
	long long n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%I64d",&m,&n);
		n++;
		for(i=1;i<=m;++i)
		{
			long long cnt=(long long)pow(3.0,i);
			double num=pow(3.0,i-1);
			cnt=n%cnt;
			if(cnt==0)
			{
				str[i]='B';
				continue;	
			}
			num=cnt/num;
			if(num>0&&num<=1)
				str[i]='R';
			else if(num>1&&num<=2)
				str[i]='G';
			else if(num>2)
				str[i]='B';
		}
		for(i=m;i>0;i--)
			printf("%c",str[i]);
		printf("\n");
	}
	return 0;
}