SDUToj 3035 你猜我猜不猜你猜不猜

你猜我猜不猜你猜不猜

Time Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^

题目描述

In the past 39th annual ACM international collegiate programming contest in Beijing station in Asia that Triple_S sent by our school team won the SDUT in Reginal bronze 11. At the same time,the team’s name is cray which is to let the host after reading the wrong three times, still missed a word to read. But zhuhu gave a high evaluation to the team.
As the creator of this team, I want to say is, in fact I was reminded of a game which is named ”ni cai wo cai bu cai ni cai bu cai wo cai bu cai”, may be the teacher didn\'t remember it. The name is just due to a conversation with a girl, so the origin is simple.
A:Why are you so diao?
B:Ni cai.
A:Ni cai wo cai bu cai.
B:Ni cai wo cai bu cai ni cai bu cai.
A:Ni cai wo cai bu cai ni cai bu cai wo cai bu cai.
Then do you know the content of their first conversation X?OK,in order to avoid the mle , RE professionals will popularize related knowledge for you . Please seize this chance!
The operation is very simple, only need to output the first letter of each word .For example , You can substitute N for Ni . Next, I\'ll demonstrate specific operation steps

输入

For everytestcase, each line of input a Character , said A or B.

Then enter an Integer X (0<X<=10^5), said the figure’s the first X words.

输出

Output the words.

示例输入

A 2
A 3
B 3

示例输出

Ncwcbc
Ncwcbcncbcwcbc
Ncwcbcncbcwcbcncbc
 
 
 
 
都马上大二了,做这个题,还想了想.....  ruo!
 
 
一看就是规律题,但是只有A,B在开头时要单独考虑,其他情况在纸上一画便知
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
string a[5]="wcnc",b[5]="ncbu";
int main()
{
    ios::sync_with_stdio(false);
    int n,m,i;
    char c;
    ios::sync_with_stdio(false);
    while(cin>>c>>n)
    {
        if(c=='A')
        {
            if(n==1)
            {
                printf("Waysd\n");
                continue;
            }
            if(n==2)
            {
                printf("Ncwcbc\n");
                continue;
            }
            else
            {
                printf("Ncwcbc");
                for(i=0;i<n-2;i++)
                {
                    printf("ncbcwcbc");
                }
                printf("\n");
            }
        }
        else
        {
            if(n==1)
            {
                printf("Nc\n");
                continue;
            }
            else
            {
                printf("Nc");
                for(i=0;i<n-1;i++)
                    printf("wcbcncbc");
                printf("\n");
            }
        }
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值