BestCoder Round #81 (div.2) 1001 Machine(找规律)

题意

思路

代码

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define LL long long

int main()
{
int T;
cin>>T;
while(T--)
{
int m;
LL n;
int d[39], a = 3;
cin>>m>>n;
for(int i=m; i>=1; i--)
{
d[i] = n%3;
n /= 3;
}
for(int i=1; i<=m; i++)
{
if(d[i] == 0)
cout<<"R";
else if(d[i] == 1)
cout<<"G";
else
cout<<"B";
}
cout<<endl;
}
return 0;
}