-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathcolumn_names.py2
61 lines (52 loc) · 1013 Bytes
/
column_names.py2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
import sys
import math
import string
import doctest
LETTERS = string.ascii_uppercase
def solve(n):
"""
>>> solve(1)
'A'
>>> solve(26)
'Z'
>>> solve(27)
'AA'
>>> solve(28)
'AB'
>>> solve(52)
'AZ'
>>> solve(676)
'YZ'
>>> solve(677)
'ZA'
>>> solve(3702)
'ELJ'
"""
#if n <= 26:
# return LETTERS[n - 1]
#if n <= 676:
# fd = n // 26
# ld = n % 26
# return LETTERS[fd - 1] + LETTERS[ld - 1]
out = []
while n > 0:
r = n % 26
if r == 0:
pass
out.append('Z')
n = n // 26 - 1
else:
out.append(LETTERS[r - 1])
n = n // 26
out.reverse()
return ''.join(out)
if len(sys.argv) > 2 and sys.argv[2] == "--secrettests":
DEBUG = True
doctest.testmod()
sys.exit()
test_cases = open(sys.argv[1], 'r')
for test in test_cases:
test = test.strip()
n = int(test)
print(solve(n))
test_cases.close()