hdu 5670 Machine（模拟）

最新推荐文章于 2019-03-18 20:48:45 发布

linyuxilu

最新推荐文章于 2019-03-18 20:48:45 发布

阅读量397

点赞数

分类专栏：数学

本文链接：https://blog.youkuaiyun.com/linyuxilu/article/details/51387800

版权

数学专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一种灯泡颜色变化的算法实现，灯泡有红、绿、蓝三种颜色，通过按钮触发颜色的变化，右侧灯泡每秒变化一次，左侧灯泡每隔三秒变化一次，文章提供了完整的C语言代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

There is a machine with

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

times?

Input

There are multiple test cases. The first line of input contains an integer

indicating the number of test cases. For each test case:

The only line contains two integers

and

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

Sample Output

分析：

可能是我语文学的不好吧，比赛时没有理解题意，等我理解了比赛也结束了，

题目是说灯有红蓝绿三种颜色转换，右边的一秒变一次，左边的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;
}