当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5670:Machine

题目描述
There is a machine with $m (2\leq m\leq 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\leq n< {2}^{63})$ times?
输入解释
There are multiple test cases. The first line of input contains an integer $T (1\leq T\leq 15)$ indicating the number of test cases. For each test case:

The only line contains two integers $m (2\leq m\leq 30)$ and $n (1\leq n< {2}^{63})$.
输出解释
For each test case, output the colour of m bulbs from left to right.
R indicates red. G indicates green. B indicates blue.
输入样例
2
3 1
2 3
输出样例
RRG
GR
来自杭电HDUOJ的附加信息
Recommend wange2014

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5670

最后修改于 2020-10-25T23:24:40+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)