time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
On an 8×88×8 grid of dots, a word consisting of lowercase Latin letters is written vertically in one column, from top to bottom. What is it?
Input
The input consists of multiple test cases. The first line of the input contains a single integer t� (1≤t≤10001≤�≤1000) --- the number of test cases.
Each test case consists of 88 lines, each containing 88 characters. Each character in the grid is either .. (representing a dot) or a lowercase Latin letter (aa--zz).
The word lies entirely in a single column and is continuous from the beginning to the ending (without gaps). See the sample input for better understanding.
Output
For each test case, output a single line containing the word made up of lowercase Latin letters (aa--zz) that is written vertically in one column from top to bottom.
Example
input
Copy
5
........
........
........
........
...i....
........
........
........
........
.l......
.o......
.s......
.t......
........
........
........
........
........
........
........
......t.
......h.
......e.
........
........
........
........
........
.......g
.......a
.......m
.......e
a.......
a.......
a.......
a.......
a.......
a.......
a.......
a.......
output
Copy
i
lost
the
game
aaaaaaaa
解题说明:水题,直接遍历输出字母即可。
cpp
#include<stdio.h>
int main()
{
int t;
scanf("%d", &t);
for (t; t > 0; t--)
{
char a[72];
for (int i = 0; i < 72; i++)
{
scanf("%c", &a[i]);
}
for (int i = 0; i < 72; i++)
{
if (a[i] >= 'a' && a[i] <= 'z')
{
printf("%c", a[i]);
}
}
printf("\n");
}
return 0;
}