hdu 5670 Machine(模拟)
来源:互联网 发布:人工智能计算器 安卓 编辑:程序博客网 时间:2024/05/18 21:10
Description
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?
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?
Input
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}).
The only line contains two integers m (2\leq m\leq 30) and n (1\leq n< {2}^{63}).
Output
For each test case, output the colour of m bulbs from left to right.
R indicates red. G indicates green. B indicates blue.
R indicates red. G indicates green. B indicates blue.
Sample Input
23 12 3
Sample Output
RRGGR
可能是我语文学的不好吧,比赛时没有理解题意,等我理解了比赛也结束了,
题目是说灯有红蓝绿三种颜色转换,右边的一秒变一次,左边的3秒变一次,
依次向左推,输出最后灯的颜色!
#include<stdio.h>#include<string.h>int main(){ long long n; int i,j,t,m; char a[35]; scanf("%d",&t); while(t--) { memset(a,'R',sizeof(a)); scanf("%d%I64d",&m,&n); long long c=3,b=1; for(i=m-1; i>=0; i--) { if( (n%c)/b==0) a[i]='R'; if((n%c)/b==1) a[i]='G'; if((n%c)/b==2) a[i]='B'; c*=3; b*=3; } a[m]='\0'; printf("%s\n",a); } return 0;}
0 0
- hdu 5670 Machine(模拟)
- hdu--5670--Machine (模拟三进制)
- hdu 5417 Victor and Machine(模拟)
- hdoj Machine 5670 (模拟)水
- hdu 5417 Victor and Machine 模拟
- hdu 5670 Machine(BC规律题)
- hdu 5670 Machine(水题)
- HDU 5670 Machine
- HDU 5670 Machine
- HDU 5670 Machine
- HDU 5417 Victor and Machine(模拟||递推)
- HDOJ 5417 Victor and Machine(模拟)
- PAT-A1042 Shuffling Machine(简单模拟)
- [hdu 5670][BestCoder Round #81 t1] Machine
- HDU 5670 Machine(水题锻炼思维)
- Prolog 模拟 Turing Machine
- hdu 1150 Machine Schedule (最小覆盖)
- hdu 4045 Machine scheduling(组合数学)
- 安卓基于回调的事件处理(一)
- boost之program_options库,解析命令行参数、读取配置文件
- 102_用Picasso下载图片
- 3-6 分解质因数
- 排序 希尔排序
- hdu 5670 Machine(模拟)
- bestcoder 百度之星 1004 放盘子
- 103_复习NetworkImageView
- usaco奶牛家谱
- Qt笔记之QGADGET
- java新手入门视频
- [Android]百度地图之几何标注和文字覆盖物
- 用数据库作学生管理系统时问题的解决
- Windows平台下Doxygen+GraphViz+HtmlHelp自动生成函数调用关系图