PKU2894线上测试A题，三十分钟理解题意完成程序一遍AC

这道题目最让我难忘的就是理解它的英文题意和一遍AC的感觉。是这次线上测试最简单的一道题目。大概花了30分钟，一遍AC。

我的程序代码：

 

/*
Problem A:Ancient Keyboard
Time Limit:1000MS  Memory Limit:65536K
Total Submit:206 Accepted:129

Description
The scientists have found an ancient device that works in a strange way. The device has a keyboard and an output tape. The keyboard has 26 keys, with symbols 'A' through 'Z' on them. Each key has an LED on it (like the Caps Lock key on some keyboards). Each time you press a key, the LED on it toggles (changes its state from off to on or vice versa). All LEDs are off initially.

To study the output written on the tape, we consider the device in discrete time steps. Suppose we are in time t. If no LED is on, no output is written on the tape. If there are i LEDs on, the ith letter of the English alphabet is written on the tape. For example, if three LEDs are on at a time step, a letter 'C' is written on the tape. This process repeats at every time step.

You are asked to write a program that simulates the ancient device.

Input
The input contains multiple test cases. The first line of the input, contains t, the number of test cases that follow. Each of the following t blocks, describes a test case.

The first line of each block contains one integer n (0 <= n <= 26). After this, there are n lines, each containing one capital alphabet letter, followed by two integers a and b, (0 <= a < b <= 1000). The capital letter shows the key pressed. The number a is the first time step at which the key is pressed and the number b is the second time step at which the key is pressed. During the interval a, a + 1, . . . , b -1, theLED of the key is on. You can assume that, in each test case, these letters are distinct.

Output
For each test case, output one line containing the output string that is written on the tape.

Sample Input

2
2
X 2 6
Y 4 9
3
A 1 5
B 4 8
C 9 10

Sample Output

AABBAAA
AAABAAAA
*/
#include "stdio.h"
#include "iostream"

using namespace std;

int main()
{
 int t,n,i,a,b,f,sum,k,flag,g,j;
 char ch[26];
 int ad[26];
 int bd[26];
 
 scanf("%d",&t);
 while(t)
 { 
  int leds[26][1000]={0};
  i=0;
  scanf("%d",&n);
  if(n<0||n>26)
   return 0;
  k=n;
  while(n)
  {
   cin>>ch[i];
   cin>>ad[i]>>bd[i];
   if((ad[i]>1000||ad[i]<0)&&(bd[i]<0||bd[i]>1000))
    return 0;
   i++;
   n--;
  }
  j=i;
  i=0;
  flag=0;
  while(k)
  {
   g=ch[i]-'A';
   for(f=ad[i];f<bd[i];f++){
    if(leds[g][f]==1)
    {
     flag=1;
     break;
    }
    if(flag=1)
    {
     flag=0;
     continue;
    }
   }
   for(f=ad[i];f<bd[i];f++)
    leds[g][f]=1;
   k--;
   i++;
  }
  sum=0;
  for(i=0;i<1000;i++){
   for(j=0;j<26;j++){
    sum+=leds[j][i];
   }
   if(sum!=0){
    printf("%c",sum+'A'-1);
    sum=0;
   }
  }
  t--;
  printf("/n");
 }
 return 0;
}