포럼
문제 ICPC00349

D. Democratic Naming

설명

A new county has been created on artificially created land out from the coast, with code name "Built Anew Peninsula County", but the final name still needs to be chosen. To establish a new name, the cities within the county get to vote on the individual letters of the name.

As it happens, all cities in the county have a name with exactly \(m\) letters, and so they decide the name of the county will also have exactly \(m\) letters. Naturally, each city prefers their own name, and thus votes that the \(i\)th letter of the county name should match theirs. For each of the \(m\) positions, the letter that received the most votes across all cities gets picked. In case of a tie between multiple letters, the one occurring earliest in the English alphabet gets picked.

Given the list of the city names, determine the result of the vote for the new county's name.

제약
입력 형식

The input consists of:
- One line with two integers \(n\) and \(m\) (\(1\leq n\leq 1000\), \(1 \leq m \leq 1000\)), the number of cities and the number of letters in each city name.
- \(n\) lines, each with a string of length \(m\), the name of a city.

The city names only consist of lowercase English letters (a-z).

출력 형식

Output the name of the new county.

예제 1
입력
3 5
apple
maple
alpha
출력
aaple
예제 2
입력
3 4
icpc
back
laps
출력
bapc
문제 정보

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

출처 ICPC BAPC 2023

평가 및 의견

D. Democratic Naming

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

Log in to rate problems.

개별 의견

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

풀이 제출

D. Democratic Naming

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