-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFizzBuzz.py
74 lines (56 loc) · 1.32 KB
/
FizzBuzz.py
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
from math import *
#定義
VALUE = 20
def convert_fizzbuzz_str(i):
if(i % 15 == 0):
return 'FizzBuzz'
elif(i % 3 == 0):
return 'Fizz'
elif(i % 5 == 0):
return 'Buzz'
else:
return str(i)
def calc_fizzbuzz(n):
if(n % 15 == 0):
return 8
elif(n % 3 == 0):
return 4
elif(n % 5 == 0):
return 4
else:
return keta(n)
def keta(n):
return int(log10(n)) + 1
#def calc_str_length(index: number) -> number:
def calc_str_length(index):
# fizz buzz における、index番目の文字数を返す関数
length = 0
length = calc_fizzbuzz(index)
#ここで試行中
return length
# 二分探索をする関数を定義 調査中
def binary_search(n):
# 探索範囲
left = 0
right = 10 ** 18
# 探索範囲を狭めていく
while right - left > 1:
# 探索範囲の中央
mid = (left + right) // 2
length = calc_str_length(mid)
if length < n:
left = mid
else :
right = mid
return False
def main():
#n入力
n = int(input())
ans = ''
a = 0
a = calc_str_length(n)
for i in range(a, a + VALUE):
ans = ans + str(calc_fizzbuzz(i))
print(ans[n - 1 : n + VALUE])
if __name__ == '__main__':
main()