Submission #74751773
Source Code Expand
S = input()
count_box = []
count = 0
for i in range(26):
for j in range(len(S)):
if chr(97+i) == S[j]:
count += 1
count_box.append(count)
count = 0
max_count = max(count_box)
for i in range(26):
if count_box[i] == max_count:
answer = i
break
print(chr(97+answer))
Submission Info
| Submission Time | |
|---|---|
| Task | D - Frequency |
| User | masucoder |
| Language | Python (CPython 3.13.7) |
| Score | 200 |
| Code Size | 311 Byte |
| Status | AC |
| Exec Time | 12 ms |
| Memory | 9136 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| 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 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 01-sample.txt | AC | 10 ms | 9120 KiB |
| 02-sample.txt | AC | 10 ms | 9020 KiB |
| 03-sample.txt | AC | 10 ms | 9120 KiB |
| 04-hidden.txt | AC | 10 ms | 9028 KiB |
| 05-hidden.txt | AC | 10 ms | 9136 KiB |
| 06-hidden.txt | AC | 12 ms | 8972 KiB |
| 07-hidden.txt | AC | 12 ms | 8984 KiB |
| 08-hidden.txt | AC | 12 ms | 9120 KiB |
| 09-hidden.txt | AC | 12 ms | 9044 KiB |
| 10-hidden.txt | AC | 12 ms | 9028 KiB |
| 11-hidden.txt | AC | 12 ms | 9108 KiB |