시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
0.2 초 | 256 MB | 36 | 26 | 24 | 72.727% |
We build the infinite sequence of uppercase letters (A-Z) which starts with single-letter strings (A, B, …, Z), continues with two-letter strings (AA, AB, …, AZ, BA, BB, …, BZ, …, ZZ), then threeletter strings and so on. The same-length strings are ordered lexicographically. We are interested in finding which letter sits at a given index in the sequence.
The letter index, ranging between 0 and 2*109 .
The letter at the specified index.
0
A
25
Z
50
A
100
B
250
E
500
J
1000
S
ICPC > Regionals > Europe > Southeastern European Regional Contest > SEERC 2016 F번