CodeForces626B(有点像博弈?找规律?)

Cards
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

CodeForces 626B
Description
Catherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions:

take any two (not necessarily adjacent) cards with different colors and exchange them for a new card of the third color;
take any two (not necessarily adjacent) cards with the same color and exchange them for a new card with that color.
She repeats this process until there is only one card left. What are the possible colors for the final card?

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 200) — the total number of cards.

The next line contains a string s of length n — the colors of the cards. s contains only the characters ‘B’, ‘G’, and ‘R’, representing blue, green, and red, respectively.

Output
Print a single string of up to three characters — the possible colors of the final card (using the same symbols as the input) in alphabetical order.

Sample Input
Input
2
RB
Output
G
Input
3
GRG
Output
BR
Input
5
BBBBB
Output
B

#include "cstring"
#include "cstdio"
#include "string.h"
#include "iostream"
using namespace std;
char s[205];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",s);
        int cntr,cntg,cntb;
        cntr=cntg=cntb=0;
        for(int i=0;i<strlen(s);i++)
        {
            if(s[i]=='R')
                cntr++;
            if(s[i]=='G')
                cntg++;
            if(s[i]=='B')
                cntb++;
        }
        if(cntr==0&&cntg==0)
        {
            printf("B\n");
            continue;
        }
        if(cntr==0&&cntb==0)
        {
            printf("G\n");
            continue;
        }
        if(cntb==0&&cntg==0)
        {
            printf("R\n");
            continue;
        }
        if(n==2)
        {
            if(cntr==0&&cntg!=0&&cntb!=0)
                printf("R\n");
            if(cntg==0&&cntr!=0&&cntb!=0)
                printf("G\n");
            if(cntb==0&&cntr!=0&&cntg!=0)
                printf("B\n");
            continue;
        }
        if(cntr==0&&cntg==1&&cntb>1)
        {
            printf("GR\n");
            continue;
        }
        if(cntr==0&&cntg>1&&cntb==1)
        {
            printf("BR\n");
            continue;
        }

        if(cntg==0&&cntr==1&&cntb>1)
        {
            printf("GR\n");
            continue;
        }

        if(cntg==0&&cntr>1&&cntb==1)
        {
            printf("BG\n");
            continue;
        }

        if(cntb==0&&cntr==1&&cntg>1)
        {
            printf("BR\n");
            continue;
        }

        if(cntb==0&&cntr>1&&cntg==1)
        {
            printf("BG\n");
            continue;
        }

        printf("BGR\n");

    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值