每日一题第四十七期 Codeforces Round 886 (Div. 4)

最新推荐文章于 2024-10-15 16:38:57 发布

娇娇yyyyyy

最新推荐文章于 2024-10-15 16:38:57 发布

阅读量481

点赞数 10

分类专栏：每日一题文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/2301_80882026/article/details/137126216

版权

每日一题专栏收录该内容

97 篇文章 1 订阅

订阅专栏

C. Word on the Paper

time limit per test: 1 second

memory limit per test: 256 megabytes

input: standard input

output: standard output

On an $\times 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$ ( $\leq t \leq 1000$ ) — the number of test cases.

Each test case consists of $8$ lines, each containing $8$ characters. Each character in the grid is either $\texttt{.}$ (representing a dot) or a lowercase Latin letter ( $\texttt{a}$ – $\texttt{z}$ ).

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 ( $\texttt{a}$ – $\texttt{z}$ ) that is written vertically in one column from top to bottom.

Example
inputCopy
5
…
…
…
…
…i…
…
…
…
…
.l…
.o…
.s…
.t…
…
…
…
…
…
…
…
…t.
…h.
…e.
…
…
…
…
…
…g
…a
…m
…e
a…
a…
a…
a…
a…
a…
a…
a…
outputCopy
i
lost
the
game
aaaaaaaa

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
//#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e8 + 10;

int t;
char c[10][10];
int main()
{
	cin >> t;
	while(t --){
		string a;
		for(int i = 1; i <= 8; i ++)
		{
			for(int j = 1; j <= 8; j ++)
			{
				cin >> c[i][j];
				if(isalpha(c[i][j])) a += c[i][j];
			}
		}
		cout << a << endl;
	}
	return 0;
}