提出 #49727323
ソースコード 拡げる
#!/usr/bin/env python
# coding: utf-8
import sys
import itertools
def i_in(): return int(sys.stdin.readline().rstrip())
def li_in(): return list(map(int, sys.stdin.readline().rstrip().split()))
def s_in(): return sys.stdin.readline().rstrip()
def ls_in(): return list(sys.stdin.readline().rstrip().split())
def solve1():
s = s_in()
# s = [ input() for i in range(N)]
count_dic = {}
for x in s:
if count_dic.get(x):
count_dic[x] += 1
else:
count_dic[x] = 1
maxv = max(count_dic.values())
kvlist = []
for x in count_dic.items():
if x[1] == maxv:
kvlist.append(x)
sorted1 = sorted(kvlist, key=lambda x: x[0])
print(sorted1[0][0])
def main():
solve1()
if __name__ == '__main__':
main()
提出情報
| 提出日時 | |
|---|---|
| 問題 | B - Frequency |
| ユーザ | pogin503 |
| 言語 | Python (CPython 3.11.4) |
| 得点 | 200 |
| コード長 | 840 Byte |
| 結果 | AC |
| 実行時間 | 10 ms |
| メモリ | 8900 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 200 / 200 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | 01-sample.txt, 02-sample.txt, 03-sample.txt |
| All | 01-sample.txt, 02-sample.txt, 03-sample.txt, 04-hidden.txt, 05-hidden.txt, 06-hidden.txt, 07-hidden.txt, 08-hidden.txt, 09-hidden.txt, 10-hidden.txt, 11-hidden.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| 01-sample.txt | AC | 9 ms | 8804 KiB |
| 02-sample.txt | AC | 10 ms | 8868 KiB |
| 03-sample.txt | AC | 9 ms | 8828 KiB |
| 04-hidden.txt | AC | 10 ms | 8868 KiB |
| 05-hidden.txt | AC | 10 ms | 8816 KiB |
| 06-hidden.txt | AC | 10 ms | 8808 KiB |
| 07-hidden.txt | AC | 9 ms | 8816 KiB |
| 08-hidden.txt | AC | 10 ms | 8824 KiB |
| 09-hidden.txt | AC | 10 ms | 8868 KiB |
| 10-hidden.txt | AC | 9 ms | 8900 KiB |
| 11-hidden.txt | AC | 10 ms | 8876 KiB |