HDU 2573 模拟

最新推荐文章于 2018-08-17 14:11:58 发布

mkopvec13579

最新推荐文章于 2018-08-17 14:11:58 发布

阅读量326

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/mkandysylove/article/details/48768115

版权

模拟专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Typing

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 997 Accepted Submission(s): 628

Problem Description

A boy named Pirates who wants to develop typing software finds that it’s hard to judge whether a letter is lowercase or uppercase. He searches lots of information about it, and find out the solution, but he doesn’t know how to realize it. Can you help him?

The Solution:
1: If the caps lock is on, and the letter is typed with shift key down, the letter is lowercase, otherwise it’s uppercase.
2: If the caps lock is off, and the letter is typed with shift key down, the letter is uppercase, otherwise it’s lowercases.

Input

The first line is an integer t, which is the number of test case in the input data file. Each test case begins with an integer n (0<n<=100), which means there follow n lines. For each line, if there is only a letter, it means the key is typed, and if there begins with a string “Shift”, then will follows one letter, it means the letter is typed with shift key, and if there begins with a string “Caps”, it means the caps lock key is typed and changes the mood of caps lock. The entire letter is lowercase. At the beginning of each test case, you can assume that the caps lock is off.

Output

Please output a string which the user typed.

Sample Input

  
  
   
   2
5
Caps
a
c
Shift i
Shift t
6
Caps
a
c
Caps
i
t

Sample Output

  
  
   
   ACit
ACit
  
  
  
  
   
   #include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{

   
   	int T=0;

   
   	scanf("%d",&T);

   
   	while(T--)

   
   	{

   
   		char na[105];

   
   		char op[100];

   
   		bool mark=0;

   
   		int t=0;

   
   		int n=0;

   
   		scanf("%d",&n);

   
   		getchar();

   
   		for(int i=0;i<n;i++)

   
   		{

   
   			gets(op);

   
   			if(strcmp(op,"Caps")==0)

   
   			{

   
   				mark=!mark;

   
   			}

   
   			else

   
   			{

   
   				if(mark)

   
   				{

   
   				  if(strlen(op)>1)

   
   				  {

   
   				  
   
   	na[t++]=op[6];

   
   				  }

   
   				  else

   
   				  {

   
   				  
   
   	na[t++]=op[0]-32;

   
   				  }
   
   	

   
   				}

   
   				else

   
   				{

   
   				  if(strlen(op)>1)

   
   				  {

   
   				  
   
   	na[t++]=op[6]-32;

   
   				  }

   
   				  else

   
   				  {

   
   				  
   
   	na[t++]=op[0];

   
   				  }
   
   	

   
   				}

   
   			}

   
   		}

   
   		na[t]='\0';

   
   		printf("%s\n",na);

   
   	}

   
   	return 0;
}