本地题面缓存已迁移,解析内容待补充。
OJ: noi_openjudge
题目 ID: ch0113-15
难度:未知
标签:python
日期: 2026-07-30 23:01
题意
完整题面见同目录的 problem.md。
思路
代码
Python代码
python
import sys
from collections import Counter
tokens = sys.stdin.read().split()
numbers = [int(token) for token in tokens[1:]]
frequencies = Counter(numbers)
if len(frequencies) == 1:
print("no")
else:
highest_frequency = max(frequencies.values())
for number in numbers:
if frequencies[number] == highest_frequency:
print(number)
break