RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
COCI00299

Lozinka

Unrated 레이팅 미적용
난이도
1s
시간 제한
32MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

\(5^{th}\) round, February \(15^{th}\), 2014

Mirko is an evil plotting genius and has gotten hold of a list of all possible passwords for a certain user
account. The first thing he noticed was all the passwords are of odd length. Mirko assumes that the
correct password is the one which can be found in both the original and reverse order in the list. For
example, if the word “tulipan” would be the correct password, the word “napilut” has to also appear in
the list. Given that both words are correct passwords, Mirko will try to use both, one at a time.

Help Mirko discover what the correct password is and output its length and central character.

제약
입력 형식

The first line of input contains the integer N (\(1 \le N \le 100\)), the number of possible passwords.
Each of the following N lines contains a single word, its length being an odd number greater than 2
and lesser than 14. All characters are lowercase letters of the English alphabet.

출력 형식

The first and only line of output must contain the length of the correct password and its central letter.
The solution will be unique.

예제 1
입력
4
las
god
psala
sal
출력
3 a
예제 2
입력
4
kisik
ptq
tttrp
tulipan
출력
5 s
설명

Clarification of the first example: The required pair of words is “las” and “sal”. Their length is 3
letters and the central character is 'a'.
Clarification of the second example: The word “kisik” can be found in both the original and reverse
order on the list (the word is a palindrome), so it is a valid correct password.

문제 정보

생성자가 기록되지 않았습니다.

출처 COCI 2013/2014 Contest 5

평가 및 의견

Lozinka

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Lozinka

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8