现在的位置: 首页 > 综合 > 正文

ZOJ Problem Set – 2987 Misspelling

2012年12月18日 ⁄ 综合 ⁄ 共 1100字 ⁄ 字号 评论关闭
ZOJ Problem Set - 2987
Misspelling


Time Limit: 1 Second      Memory Limit: 32768 KB


Misspelling is an art form that students seem to excel at. Write a program that removes the nth character from an input string.

Input

The first line of input contains a single integer N, (1 <= N <= 1000) which is the number of datasets that follow.

Each dataset consists of a single line of input containing M, a space, and a single word made up of uppercase letters only. M will be less than or equal to the length of the word. The length of the word is guaranteed to be less than or equal to 80.

Output

For each dataset, you should generate one line of output with the following values: The dataset number as a decimal integer (start counting at one), a space, and the misspelled word. The misspelled word is the input word with the indicated character deleted.

Sample Input

4
4 MISSPELL
1 PROGRAMMING
7 CONTEST
3 BALLOON

Sample Output

1 MISPELL
2 ROGRAMMING
3 CONTES
4 BALOON


Source: Greater New York Region 2007
SOURCE CODE:

#include<iostream>
#include
<sstream>
using namespace std;

int main()
{
int cases;cin>>cases;
for(int time = 1; time <= cases; time++)
{
int p;cin>>p;
p
-= 1;
string input;cin>>input;
istringstream
is(input);
char c;
int i = 0;
cout
<<time<<" ";
for(;is>>c;i++)
{
if(p != i)
cout
<<c;
}
cout
<<endl;
}
return 0;
}

抱歉!评论已关闭.