input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
t = int(eval(input()))
h = t//3600
m = int(t%3600/60)
s = int(t%3600%60)
print((str(h) + ":" + str(m) + ":" + str(s))) | t = int(eval(input()))
a = int(t / 3600)
b = int(t % 3600 / 60)
c = int(t % 3600 % 60)
print((str(a)+':'+str(b)+':'+str(c))) | p02390 |
t = int(eval(input()))
a = int(t / 3600)
b = int(t % 3600 / 60)
c = int(t % 3600 % 60)
print((str(a)+':'+str(b)+':'+str(c))) | Input = int(eval(input()))
h = Input//3600
m = (Input % 3600)//60
s = (Input % 3600) % 60
print((str(h) + ':' + str(m) + ':' + str(s)))
| p02390 |
import datetime
s = int(eval(input()))
hour = int(s / 60 / 60)
minute = int((s - (hour * 60 * 60)) / 60)
second = int((s - (hour * 60 * 60)) % 60)
print(("{0}:{1}:{2}".format(hour,minute,second))) | S = int(eval(input()))
h = S // 3600
m = S % 3600 // 60
s = S % 3600 % 60
print(("%d:%d:%d" % (h,m,s))) | p02390 |
import datetime
n = int(input().rstrip())
#??????
int_hour = n // 3600
int_minute = (n % 3600) // 60
int_second = n- int_hour*3600 - int_minute * 60
# ??????????????????
print(int_hour,int_minute, int_second, sep=":" )
| n = int(input().rstrip())
#??????
int_hour = n // 3600
int_minute = (n % 3600) // 60
int_second = n- int_hour*3600 - int_minute * 60
# ??????????????????
print(int_hour,int_minute, int_second, sep=":" )
| p02390 |
S = int(input())
if S >= 3600:
h=S//3600
m=S%3600//60
s=S%60
elif 3600 > S >= 60:
h=0
m=S//60
s=S%60
else:
h=m=0
s=S
print(h, m, s, sep=":")
| s = int(input())
h = s // 3600
m = (s - h * 3600) // 60
s = s - h * 3600 - m * 60
print(h, m, s, sep=":")
| p02390 |
def main():
x = eval(input())
y = int(x)
h, z = divmod(y, 3600)
m, s = divmod(z, 60)
print((str(h)+":"+str(m)+":"+str(s)))
if __name__ == "__main__":
main() | S = int(input())
h, tmp = divmod(S, 3600)
m, s = divmod(tmp, 60)
print(h,m,s,sep=':')
| p02390 |
s = int(input())
print(s // 3600, end="")
print(":", end="")
print(s // 60 % 60, end="")
print(":", end="")
print(s % 60)
| S = int(eval(input()))
h = S // 3600
S %= 3600
m = S // 60
s = S % 60
print(f"{h}:{m}:{s}")
| p02390 |
t, s = divmod(int(eval(input())), 60)
h, m = divmod(t, 60)
print((str(h) + ':' + str(m) + ':' + str(s))) | t, s = divmod(int(input()), 60)
h, m = divmod(t, 60)
print(h, m, s, sep=':')
| p02390 |
from math import modf
S = int(eval(input()))
decimal_min, h = modf(S/3600)
decimal_sec, m = modf(decimal_min * 60)
s = round(decimal_sec * 60)
print((str(int(h)) + ':' + str(int(m)) + ':' + str(s)))
| S =int(eval(input()))
h = int(S // 3600)
m = int(S % 3600 // 60)
s = int(S % 3600 % 60)
print((str(h) + ':' + str(m) + ':' + str(s)))
| p02390 |
S = int(input())
print(S//3600, S // 60 % 60,S%60, sep = ':')
| n = eval(input())
print("%d:%d:%d"%(n/3600, n%3600/60, n%60))
| p02390 |
a = int(eval(input()))
h = int(a / 3600)
m = int((a - h * 3600) / 60)
s = int(a - h * 3600 - m * 60)
print((":" .join(map(str, [h, m, s])))) | num = int(input())
print(int(num/3600), int((num%3600)/60), num%60, sep=":")
| p02390 |
if __name__ == '__main__':
time_in_second = int(eval(input()))
hour = time_in_second // 3600
minute = (time_in_second % 3600) // 60
second = time_in_second % 60
print(('{0:d}:{1:d}:{2:d}'.format(hour, minute, second))) | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_D&lang=jp
"""
import sys
from sys import stdin
input = stdin.readline
def main(args):
S = int(eval(input()))
h = S // 3600
m = (S % 3600) // 60
s = S % 60
print(('{}:{}:{}'.format(h, m, s)))
if __name__ == '__main__':
main(sys.argv[1:])
| p02390 |
s = int(eval(input()))
m, s = s // 60, s % 60
h, m = m // 60, m % 60
print((':'.join(map(str, [h,m,s])))) | s = int(eval(input()))
second = s % 60
s = s // 60
min = s % 60
hour = s // 60
print(f'{hour}:{min}:{second}')
| p02390 |
x = int(input())
print(int(x / 3600), int(x / 60 % 60), int(x % 60), sep = ':')
| x = int(input())
print(x // 3600, x // 60 % 60, x % 60, sep = ':')
| p02390 |
import sys
if __name__ == '__main__':
import doctest
doctest.testmod()
S = int(sys.stdin.read())
h = S / 3600
m = (S % 3600) / 60
s = S % 60
print("%d:%d:%d" % (h, m, s))
| #!/usr/bin/env python
#-*- coding: utf-8 -*-
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_D
if __name__ == '__main__':
S = int(input())
h = S / 3600
m = (S % 3600) / 60
s = S % 60
print("%d:%d:%d" % (h, m, s))
| p02390 |
# coding: utf-8
import copy
def count_sort_count(numbers):
count = 0
for index_of_a in range(len(numbers)-1):
for index_of_b in range(index_of_a + 1, len(numbers)):
if numbers[index_of_a] > numbers[index_of_b]:
numbers[index_of_a], numbers[index_of_b] = (numbers[index_of_b], numbers[index_of_a])
count += 1
return count, numbers
def different_positions(answer, numbers):
different_positions = [-1 for index in range(len(numbers))]
index = 0
for answer_value in answer:
for position in range(len(numbers)):
if numbers[position] == answer_value:
different_positions[index] = abs(index - position)
index += 1
return different_positions
def find_best_swap_position(answer, numbers, differents, max_different_position):
min_sum = 1000000
min_pattern = None
for i in range(len(numbers)):
if differents[i] == 0:
continue
if i != max_different_position:
pattern = copy.deepcopy(numbers)
pattern[i], pattern[max_different_position] = (pattern[max_different_position], pattern[i])
sum_different = sum(different_positions(answer, pattern))
if min_sum > sum_different:
min_sum = sum_different
min_pattern = pattern
return min_pattern
numbers = [-1 for i in range(int(eval(input())))]
numbers = list([int(eval(input())) for x in numbers])
base_sort_count, answer = count_sort_count(copy.deepcopy(numbers))
if base_sort_count == 0:
print((1))
else:
differents = different_positions(answer, numbers)
max_different_position = differents.index(max(differents))
swaped = find_best_swap_position(answer, numbers, differents, max_different_position)
print((count_sort_count(swaped)[0])) | # coding: utf-8
import copy
def count_sort_count(numbers):
count = 0
for index_of_a in range(len(numbers)-1):
for index_of_b in range(index_of_a + 1, len(numbers)):
if numbers[index_of_a] > numbers[index_of_b]:
numbers[index_of_a], numbers[index_of_b] = (numbers[index_of_b], numbers[index_of_a])
count += 1
return count, numbers
def different_positions(answer, numbers):
different_positions = [index for index in range(len(numbers))]
different_positions = list([abs(answer.index(numbers[x]) - x) for x in different_positions])
return different_positions
def find_best_swap_position(answer, numbers, differents, max_different_position):
min_sum = 1000000
min_pattern = None
for i in range(len(numbers)):
if differents[i] == 0:
continue
if i != max_different_position:
pattern = copy.deepcopy(numbers)
pattern[i], pattern[max_different_position] = (pattern[max_different_position], pattern[i])
sum_different = sum(different_positions(answer, pattern))
if min_sum > sum_different:
min_sum = sum_different
min_pattern = pattern
return min_pattern
numbers = [-1 for i in range(int(eval(input())))]
numbers = list([int(eval(input())) for x in numbers])
base_sort_count, answer = count_sort_count(copy.deepcopy(numbers))
if base_sort_count == 0:
print((1))
else:
differents = different_positions(answer, numbers)
max_different_position = differents.index(max(differents))
swaped = find_best_swap_position(answer, numbers, differents, max_different_position)
print((count_sort_count(swaped)[0])) | p00530 |
while True :
n, x = list(map(int, input().split()))
if(n == 0 and x == 0) :
break
else :
s = 0
for i in range(1, n + 1) :
for j in range(1, i) :
for k in range(1, j) :
if(i + j + k == x) :
s += 1
else :
pass
print(s)
| while True :
n, x = list(map(int, input().split()))
if n == 0 :
break
else :
cnt = 0
for i in range(1, n - 1) :
for j in range(i + 1, n) :
for k in range(j + 1, n + 1) :
if i + j + k == x :
cnt += 1
print(cnt)
| p02412 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if i + j + k == x:
count += 1
print(count) | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if x - (i + j + k) == 0:
count += 1
if x - (i + j + k) < 0:
break
print(count) | p02412 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0: break
count = 0
for i in range(1,n - 1):
for j in range(i + 1 ,n):
for k in range(j + 1 ,n + 1):
if i + j + k == x: count += 1
print(count) | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0: break
count = 0
for i in range(1,n - 1):
for j in range(i + 1 ,n):
for k in range(j + 1 ,n + 1):
if i + j + k == x:
count += 1
break
print(count) | p02412 |
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
for i in range(1, n - 1):
for j in range(i + 1, n):
for k in range(j + 1, n + 1):
if (i + j + k) == x:
cnt += 1
print(cnt) | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
for i in range(1, min(n - 1, int(x / 3))):
for j in range(i + 1, n):
for k in range(j + 1, n + 1):
if (i + j + k) == x:
cnt += 1
print(cnt) | p02412 |
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
upper_max_value = min(x - 3, n)
lower_max_value = max(int(x / 3), 3)
for i in range(upper_max_value, lower_max_value - 1, -1):
for j in range(i - 1, 1, -1):
for k in range(j - 1, 0, -1):
if (i + j + k) == x:
cnt += 1
print(cnt) | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
max_a = min(x - 3, n)
min_a = max(x // 3 + 1, 3)
cnt = 0
for i in range(min_a, max_a + 1):
max_b = min(i - 1, x - i - 1)
min_b = (x - i) // 2 + 1
cnt += (max_b - min_b + 1)
print(cnt) | p02412 |
while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n - 1):
for m in range(s + 1, n):
for e in range(m + 1, n + 1):
if x == sum([s, m, e]):
count += 1
print(count) | while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n - 1):
for m in range(s + 1, n):
for e in range(m + 1, n + 1):
if x == s + m + e:
count += 1
print(count) | p02412 |
while True:
[n, m] = [int(x) for x in input().split()]
if [n, m] == [0, 0]:
break
hoge = list(range(1, n + 1))
data = []
for x in range(n - 1, 1, -1):
for y in range(x - 1, 0, -1):
for z in range(y - 1, -1, -1):
# print((x, y, z))
s = hoge[x] + hoge[y] + hoge[z]
if s < m:
break
if s == m:
data.append(s)
print((len(data))) | while True:
[n, m] = [int(x) for x in input().split()]
if [n, m] == [0, 0]:
break
data = []
for x in range(n, 2, -1):
for y in range(x - 1, 1, -1):
for z in range(y - 1, 0, -1):
s = x + y + z
if s < m:
break
if s == m:
data.append(s)
print((len(data))) | p02412 |
while 1:
k=input().split()
n=int(k[0])
x=int(k[1])
if n==0 and x==0 :
break
m=0
for i1 in range(1,n+1):
for i2 in range(1,n+1):
for i3 in range(1,n+1):
if (i1!=i2 and i2!=i3) and (i3!=i1 and x==i1+i2+i3):
m+=1
print((m//6))
| while 1:
k=input().split()
n=int(k[0])
x=int(k[1])
if n==0 and x==0 :
break
m=0
for i1 in range(1,n-1):
for i2 in range(i1+1,n):
for i3 in range(i2+1,n+1):
if (i1!=i2 and i2!=i3) and (i3!=i1 and x==i1+i2+i3):
m+=1
print(m)
| p02412 |
#!/usr/local/env python3
import sys
from itertools import combinations
def find_all_subsets_of_target_sum(numbers, target_sum):
subsets = []
for x in range(len(numbers)):
subsets.extend([
combo for combo in combinations(numbers, x)
if sum(combo) == target_sum
]
)
return subsets
def find_num_of_subset_with_x_elements(upper_bound, target_sum, x_elements):
numbers = [int(number) for number in range(1, upper_bound+1)]
subsets = find_all_subsets_of_target_sum(numbers, target_sum)
subset_count = 0
for subset in subsets:
if len(subset) == x_elements:
subset_count += 1
return subset_count
def program_runner():
while True:
n, x = list(map(int, sys.stdin.readline().split()))
if n == x == 0:
break
print((find_num_of_subset_with_x_elements(n, x, 3)))
def main():
program_runner()
if __name__ == '__main__':
main() | #!/usr/local/env python3
import sys
def main():
while True:
count = 0
n, r = list(map(int, sys.stdin.readline().split()))
if n == r == 0:
break
for n1 in range(1, n-1):
for n2 in range(n1+1, n):
for n3 in range(n2+1, n+1):
if n1 + n2 + n3 == r:
count += 1
print(count)
if __name__ == '__main__':
main() | p02412 |
from itertools import combinations
inputs = []
n,x = list(map(int,input().split()))
while n != 0 or x != 0:
inputs.append((n,x))
n,x = list(map(int,input().split()))
for n,x in inputs:
print((len([c for c in combinations(list(range(1,n+1)),3) if sum(c) == x])))
| from itertools import combinations
inputs = []
n,x = list(map(int,input().split()))
while n != 0 or x != 0:
inputs.append((n,x))
n,x = list(map(int,input().split()))
for n,x in inputs:
print((len([0 for c in combinations(list(range(1,n+1)),3) if sum(c) == x])))
| p02412 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
dataset = []
for a in range(1, n + 1):
for b in range(a + 1, n + 1):
for c in range(b + 1, n + 1):
dataset.append([a,b,c])
count = 0
for data in dataset:
if sum(data) == x:
count += 1
print(count) | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n + 1):
for b in range(a + 1, n + 1):
for c in range(b + 1, n + 1):
if sum([a,b,c]) == x:
count += 1
print(count) | p02412 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n + 1):
for b in range(a + 1, n + 1):
for c in range(b + 1, n + 1):
if sum([a,b,c]) == x:
count += 1
print(count) | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
limit = n if n < x else x
for a in range(1, limit + 1):
for b in range(a + 1, limit + 1):
for c in range(b + 1, limit + 1):
if sum([a,b,c]) == x:
count += 1
print(count) | p02412 |
#!/usr/bin/env python
# -*- coding:utf-8 -*-
import timeit
import time
import sys
import io
import re
import math
#start = time.time()
#start = time.clock()
while True:
l = []
(n,x)=list(map(int, input().split()))
if n==x==0:
break
ans=0
for a in range(1,n+1):
l.append(a)
for i in l:
if i > 98: break
for j in l:
if j > 99 or i+j>x: break
p=0
for k in l:
p=i+j+k
if (i != j and j != k and k != i) and p==x and i<j<k:
ans+=1
print(ans)
#end = time.clock()
#print end - start | while 1:
ans=0
n,x=list(map(int,input().split()))
if n:
for i in range(1,n-1):
for j in range(i+1,n):
for k in range(j+1,n+1):
if i+j+k==x:ans+=1
else:break
print(ans) | p02412 |
while 1:
ans=0
n,x=list(map(int,input().split()))
if n:
for i in range(1,n-1):
for j in range(i+1,n):
for k in range(j+1,n+1):
if i+j+k==x:ans+=1
else:break
print(ans) | while 1:
a=0
n,x=list(map(int,input().split()))
if n==0:break
for i in range(1,n-1):
for j in range(i+1,n):
c=x-i-j
if c>j and c<=n:a+=1
print(a) | p02412 |
from itertools import combinations
while True:
n,m=list(map(int,input().split()))
if n==m==0: break
print((sum(1 for p in combinations(list(range(1,n+1)),3) if sum(p)==m))) | while 1:
n,x=list(map(int,input().split()))
if n+x==0:break
print((len([1 for i in range(3,n+1)for j in range(2,x-i)if x-i-j<j<i]))) | p02412 |
while 1:
n,x=list(map(int,input().split()))
if n+x==0:break
print((len([1 for i in range(3,n+1)for j in range(2,x-i)if x-i-j<j<i]))) | while 1:
n,x=list(map(int,input().split()))
if n+x==0:break
print((len([1 for i in range(1,n-1)for j in range(i+1,n)if j<x-i-j<=n]))) | p02412 |
while True:
n, x = list(map(int, [_ for _ in input().split()]))
cnt = 0
if n == x == 0:
break
for n1 in range(1, n+1):
for n2 in range(2, n+1):
for n3 in range(3, n+1):
if n1 != n2 and n2 != n3 and n3 != n1:
if n1+n2+n3 == x and n1 < n2 < n3:
cnt += 1
print(cnt) | while True:
n, x = list(map(int, [_ for _ in input().split()]))
cnt = 0
if n == x == 0:
break
for n1 in range(1, n+1):
for n2 in range(n1+1, n+1):
for n3 in range(n2+1, n+1):
if n1 != n2 and n2 != n3 and n3 != n1:
if n1+n2+n3 == x:
cnt += 1
print(cnt) | p02412 |
a, b = (int(i) for i in input().split())
while a != 0 or b != 0:
count = 0
for i in range(1, a-1):
for j in range(i+1 , a):
for k in range(i+2, a+1):
if i + j + k == b and i < j < k:
count += 1
print(("{0}".format(count)))
a, b = (int(i) for i in input().split()) | a, b = (int(i) for i in input().split())
#0??¨0?????\??????????????´????????????????????????
while a != 0 or b != 0:
count = 0
#i?????????????????°???
for i in range(1, a-1):
#j?????????????????°???
for j in range(i+1 , a):
#k?????????????????°???
for k in range(i+2, a+1):
#??????????????´???????????????????????????
if i + j + k == b and i < j < k:
count += 1
print(("{0}".format(count)))
a, b = (int(i) for i in input().split()) | p02412 |
import itertools
while True:
n,x = list(map(int,input().split()))
if n==x==0: break
li = list(itertools.combinations([i+1 for i in range(n)],3))
ret = 0
for i in range(len(li)):
if sum(li[i]) == x: ret+= 1
print(ret) | import itertools
while True:
n,x = list(map(int,input().split()))
if n==x==0: break
ret = 0
for i in itertools.combinations([i+1 for i in range(n)],3):
if sum(i) == x: ret+= 1
print(ret) | p02412 |
import itertools
while True:
n,x = list(map(int,input().split()))
if n==x==0: break
ret = 0
for i in itertools.combinations([i+1 for i in range(n)],3):
if sum(i) == x: ret+= 1
print(ret) | while True:
n,x = list(map(int,input().split()))
if n == x == 0: break
ret = 0
max = x - 2
if n <= x: max = n
for _ in range(max):
if max == 2: break
mid = max - 1
for _ in range(mid):
min = x - max - mid
if min <= 0: mid -= 1
elif min >= mid:
break
else:
ret += 1
mid -= 1
max -= 1
print(ret) | p02412 |
def how_many_ways(n, x):
ways = 0
for i in range(1, n-1):
for j in range(i+1, n):
for k in range(j+1, n+1):
if i+j+k == x:
ways += 1
return ways
def main():
while True:
n, x = [int(x) for x in input().split()]
if n == x == 0:
break
print((how_many_ways(n, x)))
if __name__ == '__main__':
main()
| while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = x - i - j
if not (j < k <= n):
continue
count += 1
print(count)
| p02412 |
while True:
n, x = (int(x) for x in input().split())
if (n, x) == (0, 0): break
cnt = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if i + j + k == x:
cnt += 1
print(cnt) | while True:
n, x = (int(x) for x in input().split())
if (n, x) == (0, 0): break
cnt = sum(1 for i in range(1, n+1) for j in range(i+1, n+1) for k in range(j+1, n+1) if i + j + k == x)
print(cnt) | p02412 |
n, x = list(map(int, input().split()))
while n != 0 or x != 0:
cnt = 0
i = 1
while i <= n - 2:
j = i + 1
# if i >= x:
# break
while j <= n - 1:
k = j + 1
# if i + j >= x:
# break
while k <= n:
# if i + j + k > x:
# break
if i + j + k == x:
cnt += 1
k += 1
j += 1
i += 1
print(cnt)
n, x = list(map(int, input().split()))
| n, x = list(map(int, input().split()))
while n != 0 or x != 0:
cnt = 0
i = 1
while i <= n - 2:
j = i + 1
if i >= x:
break
while j <= n - 1:
k = j + 1
if i + j >= x:
break
while k <= n:
if i + j + k > x:
break
if i + j + k == x:
cnt += 1
k += 1
j += 1
i += 1
print(cnt)
n, x = list(map(int, input().split()))
| p02412 |
def solve(n,x):
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
if i == j :
continue
for k in range(1,n+1):
if j == k or i == k:
continue
if i+j+k == x:
count += 1
return count//6
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break;
print((solve(n,x))) | def solve(n,x):
count = 0
for i in range(1,n+1):
for j in range(i+1,n+1):
k = x - i - j
if j < k and k <= n:
count += 1
return count
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break;
print((solve(n,x))) | p02412 |
import itertools
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
ans = 0
for t in list(itertools.combinations([i + 1 for i in range(n)], 3)):
if sum(t) == x:
ans += 1
print(ans) | # http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_7_B "How many ways?" ????§£??????
#
import itertools
while True:
n, x = list(map(int, input().split()))
if not n:
break
print((list(map(sum, itertools.combinations(list(range(1, n + 1)), 3))).count(x))) | p02412 |
import itertools
while(True):
n, x = [int(i) for i in input().split()]
if n == 0 and x == 0: break
cnt = 0
for li in itertools.combinations(list(range(1, n + 1)),3):
if sum(li) == x: cnt += 1
print(cnt) | from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
for li in combinations(list(range(1, n + 1)), 3):
if sum(li) == x:
cnt += 1
print(cnt)
| p02412 |
from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
for li in combinations(list(range(1, n + 1)), 3):
if sum(li) == x:
cnt += 1
print(cnt)
| from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
print((sum(1 for li in combinations(list(range(1, n + 1)), 3) if sum(li) == x)))
| p02412 |
from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
print((sum(1 for li in combinations(list(range(1, n + 1)), 3) if sum(li) == x)))
| from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
print((sum(1 for a, b, c in combinations(list(range(1, n + 1)), 3) if a + b + c == x)))
| p02412 |
from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
print((sum(a + b + c == x for a, b, c in combinations(list(range(1, n + 1)), 3))))
| from itertools import combinations
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
print((len([1 for a, b, c in combinations(list(range(1, n + 1)), 3) if a + b + c == x])))
| p02412 |
num_list = []
while True:
values = [int(x) for x in input().split()]
if 0 == values[0] and 0 == values[1]:
break
num_list.append(values)
for n, t in num_list:
ret = ' '.join(str(x + y + z) for x in range(1, n + 1) for y in range(x + 1, n + 1) for z in range(y + 1, n + 1))
cnt = 0
for x in ret.split():
if str(t) == x:
cnt += 1
print(cnt) | num_list = []
while True:
values = [int(x) for x in input().split()]
if 0 == values[0] and 0 == values[1]:
break
num_list.append(values)
for n, t in num_list:
ret = ' '.join(str(x + y + z) for x in range(1, n + 1) for y in range(x + 1, n + 1) for z in range(y + 1, n + 1) if t == x + y + z)
print((ret.count(str(t)))) | p02412 |
while True:
n, x = list(map(int, input().split()))
count = 0
if not(n or x):
break
for i in range(1, n-1, 1):
for j in range(i+1, n, 1):
for k in range(j+1, n+1, 1):
if i + j + k == x:
count += 1
print(count) | while True:
n, x = list(map(int, input().split()))
count = 0
if not(n or x):
break
for i in range(1, n-1, 1):
for j in range(i+1, n, 1):
k = x - i -j
if k > j and k <= n:
count += 1
print(count) | p02412 |
combNum = [0]*10000
inNum = 0
while True:
n,x = list(map(int, input().split()))
calcResult = 0
numList1 = list(range(1,n+1,1))
numList2 = list(range(1,n+1,1))
numList3 = list(range(1,n+1,1))
if n is x is 0:
break
else:
for index1 in range(n):
for index2 in range(n):
for index3 in range(n):
#index = [numList1[index1], numList2[index2], numList3[index3]]
if numList1[index1] is numList2[index2] or numList1[index1] is numList3[index3] or numList2[index2] is numList3[index3] or numList1[index1] is numList2[index2] is numList3[index3]:
#if index.count(numList1[index1])>1 or index.count(numList1[index2])>1 or index.count(numList1[index3])>1:
pass
else:
if numList1[index1]<numList2[index2]<numList3[index3]:
calcResult = numList1[index1] + numList2[index2]+numList3[index3]
if calcResult == x:
combNum[inNum] =combNum[inNum]+1
else:
pass
inNum = inNum+1
for index in range(inNum):
print((combNum[index]))
| dataNum = 0
combNum = [0] * 100
while True:
n,x=list(map(int, input().split()))
if n is x is 0:
break
else:
for a in range(1,n-1):
for b in range(a+1,n):
for c in range(b+1,n+1):
calcResult = a + b + c
if calcResult == x:
combNum[dataNum] += 1
else:
pass
dataNum += 1
for index in range(dataNum):
print((combNum[index]))
| p02412 |
while True:
num = list(map(int,input().split()))
if(num[0] == 0 and num[1] == 0): break
c = 0
for i in range(1,num[0] - 1):
for j in range(i+1,num[0]):
for k in range(j+1,num[0]+1):
if(i+j+k == num[1]): c += 1
print(c)
| while True:
num = list(map(int,input().split()))
if(num[0] == 0 and num[1] == 0): break
c = 0
for i in range(1,num[0]+1):
for j in range(i+1,num[0]+1):
if j <= i:
continue
k = num[1]-(i+j)
if k > j and k <= num[0]:
c+= 1
print(c)
| p02412 |
import itertools
while True:
n,x = list(map(int,input().split(" ")))
if n == 0 and x == 0:
break
#データリスト作成
data = [m for m in range(1,n+1)]
data_cmb = list(itertools.combinations(data,3))
#検証
res = [ret for ret in data_cmb if sum(ret) == x]
print((len(res)))
| while True:
n,x = list(map(int,input().split(" ")))
if n == 0 and x == 0:
break
#データリスト作成
data = [m for m in range(1,n+1)]
data_list = []
cnt = 0
#n種類の数字があって、xになる組み合わせは？
for i in range(1,n+1):
for j in range(1+i,n+1):
for k in range(1+j,n+1):
if i+j+k == x:
cnt += 1
print(cnt)
| p02412 |
from itertools import combinations
while True:
n, x = [int(i) for i in input().split()]
if n == x == 0: break
count = 0
array = set(range(1, n+1))
for ele in combinations(array, 3):
if sum(ele) == x:
count += 1
print(count) | while True:
n,x = [int(i) for i in input().split()]
if n == 0 and x == 0: break
count = 0
# 3????????°?????????????°????x//3?????????x//3 * 3 == x ?????????????°????x//3??\?????§?????????????????????
for a in range(1, x//3):
# 3????????°?????????????????????x//2?????????x//2 * 2 == x ?????????????????????x//2??\?????§?????????????????????
for b in range(a+1,x//2):
c = x - (a + b)
if b < c <= n:
count += 1
print(count) | p02412 |
import itertools
while True:
n,x = [int(x) for x in input().split()]
if (n,x)==(0,0): break
cnt=0
for comb in itertools.combinations(list(range(1,n+1)),3):
if sum(comb) == x: cnt+=1
print(cnt) | while True:
n,x = [int(x) for x in input().split()]
if (n,x)==(0,0): break
cnt=0
if 3*(n-1) >= x: # If n-2 + n-1 + n < x, there is no combination
a_max = x//3 - 1 # a_max + a_max+1 + a_max+2 = x
if 2*n-1 < x:
a_min = x - (2*n-1) # set minimum value of a
else:
a_min = 1
for a in range(a_min,a_max+1):
b_max = (x-a-1)//2 # b_max + b_max+1 <= x-a
b_min = (x-a) - n # set minimum value of b
b_min = b_min if b_min > a+1 else a+1
cnt += b_max - b_min + 1
print(cnt) | p02412 |
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
comb = set()
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
if i == j or j == k or i == k:
continue
elif i + j + k == x:
sort_9 = sorted((i, j, k))
sort_9 = tuple(sort_9)
comb.add(sort_9)
print((len(comb)))
| while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
comb = set()
for i in range(1, n+1):
for j in range(2, n+1):
for k in range(3, n+1):
if i == j or j == k or i == k:
continue
elif i + j + k == x:
sort_9 = sorted((i, j, k))
comb.add(tuple(sort_9))
print((len(comb)))
| p02412 |
import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
goto = False
for i in range( 1, n-1 ):
if x < 3*(i+1):
break
for j in range( i+1, n ):
if x <= ( i+j ):
break
for k in range( j+1, n+1 ):
s = ( i + j + k )
if x == s:
cnt += 1
break
elif x < s:
goto = True
break
goto = False
print( cnt ) | import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
for i in range( 1, n-1 ):
if x < 3*(i+1):
break
for j in range( i+1, n ):
if x <= ( i+j ):
break
for k in range( j+1, n+1 ):
s = ( i + j + k )
if x == s:
cnt += 1
break
elif x < s:
break
print( cnt ) | p02412 |
import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
ave = x // 3
for i in range( 1, ave ):
for j in range( i+1, n ):
if x <= ( i+j ):
break
for k in range( j+1, n+1 ):
s = ( i + j + k )
if x == s:
cnt += 1
break
elif x < s:
break
print( cnt ) | import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
ave = x // 3
for i in range( 1, ave ):
ave2 = (x-i) // 2
for j in range( i+1, ave2+1 ):
k = x-i-j
if j < k and k <= n:
cnt += 1
print( cnt ) | p02412 |
while True:
k=list(map(int,input().split(" ")))
if k[0]==k[1]==0:
break
ct=0
a=0
b=0
c=0
max=k[0]
sum=k[1]
a=max+1
while True:
a-=1
b=a-1
c=sum-a-b
if not a>b>c:
print(ct)
break
while a>b>c:
if a>b>c>0:
ct+=1
b-=1
c+=1
| while True:
k=list(map(int,input().split(" ")))
if k[0]==k[1]==0:
break
ct=0
a=0
b=0
c=0
max=k[0]
sum=k[1]
a=max+1
while True:
a-=1
b=a-1
c=sum-a-b
if not a>c:
print(ct)
break
while b>c:
if c>0:
ct+=1
b-=1
c+=1 | p02412 |
while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n - 1):
for m in range(s + 1, n):
for e in range(m + 1, n + 1):
if x == sum([s, m, e]):
count += 1
print(count) | while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n - 1):
for m in range(s + 1, n):
for e in range(m + 1, n + 1):
if x == s+m+e:
count += 1
print(count) | p02412 |
while True:
arr = list(map(int, input().split()))
n = arr[0]
x = arr[1]
if n == 0 and x == 0:
break
c = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if i + j + k == x:
c += 1
print(c)
c = 0
|
while True:
arr = list(map(int, input().split()))
n = arr[0]
x = arr[1]
if n == 0 and x == 0:
break
ans = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if i + j + k == x:
ans += 1
print(ans)
| p02412 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n+1):
for b in range(a+1, n+1):
for c in range(b+1, n+1):
if (a + b + c) == x:
count += 1
print(count) | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n+1):
for b in range(a+1, n+1):
for c in range(b+1, n+1):
if (a + b + c) == x:
count += 1
elif (a + b + c) > x:
break
print(count) | p02412 |
count_a = []
pos = 0
while True:
n, x = list(map(int, input().split()))
count = 0
if n == x == 0:
break
else:
for i in range(1, (n+1)):
for j in range(1, (n+1)):
for k in range(1, (n+1)):
if (i != j) and (j != k) and (i != k):
if (i+j+k) == x:
count += 1
count_a.append(int(count/6))
pos = pos+1
for i in count_a:
print(i)
| count_a = []
pos = 0
while True:
n, x = list(map(int, input().split()))
count = 0
if n == x == 0:
break
else:
for i in range(1, (n+1)):
for j in range(i+1, (n+1)):
for k in range(j+1, (n+1)):
if (i != j) and (j != k) and (i != k):
if (i+j+k) == x:
count += 1
count_a.append(count)
pos = pos+1
for i in count_a:
print(i)
| p02412 |
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
y = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
if i != j != k != i and i + j + k == x:
y += 1
print((y // 6)) | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
y = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i == j:
continue
for k in range(1, n + 1):
if j == k or k == i:
continue
elif i + j + k == x:
y += 1
print((y // 6))
| p02412 |
while(1):
comb = []
count =0
inp = input().split(" ")
if inp[0] == "0" and inp[1] == "0":
break
for i in range(1,int(inp[0])+1):
for j in range(1,int(inp[0])+1):
if i == j:
break
sum = i + j
if sum > int(inp[1]):
j = int(inp[0])
break
for k in range(1,int(inp[0])+1):
if i == j or i == k or j == k:
break
sum = i + j + k
if sum > int(inp[1]):
k = int(inp[0])
break
if sum == int(inp[1]):
if not ([i,j,k] in comb or [i,k,j] in comb or [j,k,i] in comb or [j,i,k] in comb or [k,i,j] in comb or [k,j,i] in comb):
comb.append([i,j,k])
count += 1
print(count)
| # coding: UTF-8
def find_comb(n,x):
count = 0
#探索
for i in range(1,n-1):
for j in range(i+1,n):
k = x - i - j #←がi < j < k <= nを満たせばその時点で総和がxとなる
if j < k <= n:
count += 1
print(count)
while(1):
n,x = list(map(int, input().split(" ")))
if(n == 0 and x == 0):
break
find_comb(n,x)
| p02412 |
while True:
n,x= list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(i+1,n+1):
for k in range(j+1,n+1):
if i+j+k == x :
count = count + 1
print(count) | while True:
n,x= list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(i+1,n+1):
for k in range(j+1,n+1):
if i + j + k == x:
count = count + 1
break
print(count) | p02412 |
while True:
n,x= list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(i+1,n+1):
for k in range(j+1,n+1):
if i + j + k == x:
count = count + 1
break
print(count) | while True:
n,x= list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1,n-1):
for j in range(i+1,n):
for k in range(j+1,n+1):
if i + j + k == x:
count = count + 1
break
print(count) | p02412 |
from itertools import combinations
if __name__ == '__main__':
while True:
# ?????????????????\???
data = [int(x) for x in input().split(' ')]
upper_limit = data[0]
target_number = data[1]
if upper_limit == 0 and target_number == 0:
break
# ????????????????????????
choices = combinations(list(range(1, upper_limit+1)), 3)
# ????¨???????X????????´????????°????¢????????????????
hit_count = 0
for c in choices:
# print(c)
if sum(c) == target_number:
hit_count += 1
print(hit_count) | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_7_B&lang=jp
"""
import sys
from sys import stdin
from itertools import combinations
input = stdin.readline
def main(args):
while True:
n, x = list(map(int, input().split()))
if n == 0 and x == 0:
break
ans = 0
for c in combinations(list(range(1, n+1)), 3):
if sum(c) == x:
ans += 1
print(ans)
if __name__ == '__main__':
main(sys.argv[1:])
| p02412 |
while True:
n, x = list(map(int, input().split()))
if n == 0:
break
count = 0
for n1 in range(1, n+1):
for n2 in range(n1+1, n+1):
for n3 in range(n2+1, n+1):
if n1 + n2 + n3 == x:
count += 1
print(count) | while True:
n, x = list(map(int, input().split()))
if n == 0 and x == 0:
break
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i + k + j == x:
count += 1
print(count)
| p02412 |
n,x = -1,-1
table = []
while n != 0 or x != 0:
n,x = (int(x) for x in input().split())
table.append([n,x])
for t in table:
n = t[0]
x = t[1]
if n == 0 and x == 0:
break
i = 1
s = 0
while i < n:
if x - i > n + (n - 1):
continue
else:
j = i + 1
while j < n:
if x - i - j <= n and x - i - j > j:
# print (str(i) + "," + str(j) + "," + str(x - i - j))
s += 1
j += 1
i += 1
print (s)
| n,x = -1,-1
table = []
while n != 0 or x != 0:
n,x = (int(x) for x in input().split())
table.append([n,x])
for t in table:
n = t[0]
x = t[1]
if n == 0 and x == 0:
break
i = 1
s = 0
while i < n:
#print (i)
if x - i > n + (n - 1):
i += 1
continue
else:
j = i + 1
while j < n:
#print (str(i) + "," + str(j) + "," + str(x - i - j))
if x - i - j <= n and x - i - j > j:
s += 1
j += 1
i += 1
print (s)
| p02412 |
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
if (i != j and i != k and j != k and i < j < k):
if i+j+k == x:
count += 1
print(count) | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
if (i < j < k):
if i+j+k == x:
count += 1
print(count) | p02412 |
#coding:utf-8
#1_7_B 2015.4.5
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1 , n + 1):
for j in range(1 , n + 1):
for k in range(1 , n + 1):
if i + j + k == x and i < j < k:
count += 1
print(count) | #coding:utf-8
#1_7_B 2015.4.5
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1 , n + 1):
for j in range(1 , n + 1):
if (x - i - j) <= n and i < j < (x - i -j):
count += 1
print(count) | p02412 |
#coding:utf-8
#1_7_B 2015.4.5
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1 , n + 1):
for j in range(1 , n + 1):
if (x - i - j) <= n and i < j < (x - i -j):
count += 1
print(count) | #coding:utf-8
#1_7_B 2015.4.5
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1 , n + 1):
for j in range(1 , n + 1):
if i < j < (x - i - j) <= n:
count += 1
print(count) | p02412 |
ret = []
while True:
n, x = list(map(int, input().split()))
num_arr = [i for i in range(1, n+1)]
if (n, x) == (0, 0):
break
cnt = 0
for i in range(n, 0, -1):
if x - i <= 2:
continue
#print "i : %d" % i
for j in range(i -1, 0, -1):
if x-i-j <= 0:
continue
#print "j : %d" % j
for k in range(j - 1, 0 , -1):
if x-i-j-k < 0:
continue
if x -i-j-k == 0:
cnt += 1
#print "k : %d" % k
break
ret += [cnt]
for i in ret:
print(i) | ret = []
while True:
n, x = list(map(int, input().split()))
num_arr = [i for i in range(1, n+1)]
if (n, x) == (0, 0):
break
cnt = 0
for i in range(n, 0, -1):
for j in range(i -1, 0, -1):
if 0 < x - i - j < j:
cnt += 1
ret += [cnt]
for i in ret:
print(i) | p02412 |
def solve(sup,rest,digit,used1,used2):
if digit==0:
if rest==0:
return 1
else:
return 0
sum=0
for i in range(1,sup+1):
if i!=used1 and i!=used2:
if used1==0:
sum+=solve(sup,rest-i,digit-1,i,used2)
elif used2==0:
sum+=solve(sup,rest-i,digit-1,used1,i)
else:
sum+=solve(sup,rest-i,digit-1,used1,used2)
return sum
N=[]
X=[]
while True:
n,x=list(map(int,input().split()))
if (n,x)==(0,0):
break
N.append(n)
X.append(x)
for i in range(len(N)):
print(('%d'%(solve(N[i],X[i],3,0,0)/6))) | def solve(sup,rest,digit,used1,used2):
if rest<0:
return 0
if digit==0:
if rest==0:
return 1
else:
return 0
sum=0
for i in range(1,sup+1):
if i!=used1 and i!=used2:
if used1==0:
sum+=solve(sup,rest-i,digit-1,i,used2)
elif used2==0:
sum+=solve(sup,rest-i,digit-1,used1,i)
else:
sum+=solve(sup,rest-i,digit-1,used1,used2)
return sum
N=[]
X=[]
while True:
n,x=list(map(int,input().split()))
if (n,x)==(0,0):
break
N.append(n)
X.append(x)
for i in range(len(N)):
print(('%d'%(solve(N[i],X[i],3,0,0)/6))) | p02412 |
def dfs(i, j, s):
if j > 3:
return
if j == 3 and s == x:
ans.append(1)
for k in range(1, i):
dfs(k, j + 1, s + k)
while True:
ans = []
n, x = list(map(int, input().split()))
if n == x == 0:
break
for i in range(1, n + 1):
dfs(i, 1, i)
print((sum(ans)))
| def dfs(i, j, s):
if j > 3:
return
if j == 3 and s == x:
ans.append(1)
for k in range(1, i):
if s + k > x:
break
dfs(k, j + 1, s + k)
while True:
ans = []
n, x = list(map(int, input().split()))
if n == x == 0:
break
for i in range(3, n + 1):
dfs(i, 1, i)
print((sum(ans)))
| p02412 |
def dfs(i, j, s):
if j > 3:
return
if j == 3 and s == x:
ans.append(1)
for k in range(1, i):
if s + k > x:
break
dfs(k, j + 1, s + k)
while True:
ans = []
n, x = list(map(int, input().split()))
if n == x == 0:
break
for i in range(3, n + 1):
dfs(i, 1, i)
print((sum(ans)))
| def calc(n, x):
result = 0
for i in range(3, n + 1):
for j in range(2, i):
for k in range(1, j):
if sum([i, j, k]) == x:
result += 1
return str(result)
ans = []
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
ans.append(calc(n, x))
print(("\n".join(ans)))
| p02412 |
def dfs(i, j, s):
if j > 3:
return
if j == 3 and sum(s) == x:
res.append(1)
for k in range(1, i):
if sum(s) + k > x:
break
if k not in s:
dfs(k, j + 1, s + [k])
ans = []
while True:
res = []
n, x = list(map(int, input().split()))
if n == x == 0:
break
for i in range(3, n + 1):
dfs(i, 1, [i])
ans.append(sum(res))
print(("\n".join(map(str, ans))))
| def calc(n, x):
result = 0
for i in range(3, n + 1):
for j in range(2, i):
if i + j < x < i + 2 * j:
result += 1
return str(result)
ans = []
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
ans.append(calc(n, x))
print(("\n".join(ans)))
| p02412 |
from itertools import product
from math import sqrt
def main():
n = int(eval(input()))
n_copy = n
if n == 1:
print((1))
exit()
if n % 2 == 0:
ans = 2 * n - 1
n *= 2
else:
ans = n - 1
prime = [2, 3]
for i in range(5, int(sqrt(n_copy)) + 1, 2):
for p in prime:
if p * p > i:
prime.append(i)
break
if i % p == 0:
break
factors = []
for p in prime:
if p * p > n:
if n > 1:
factors.append(n)
break
if n % p == 0:
cnt = 0
while n % p == 0:
cnt += 1
n //= p
factors.append(p ** cnt)
for tf in product([True, False], repeat=len(factors)):
a, b = 1, 1
for i in range(len(factors)):
if tf[i]:
a *= factors[i]
else:
b *= factors[i]
if a == 1 or b == 1:
continue
if a < b:
a, b = b, a
# Euclidean Algorithm
# a*x - b*y = 1
# quotient: 商
l = []
quo = []
while a % b > 1:
l.append(a)
a = b
quo.append(0)
quo[-1], b = divmod(l[-1], b)
x, y = 1, a//b
flag = True
while l:
if flag:
x += y * quo.pop()
b = l.pop()
else:
y += x * quo.pop()
a = l.pop()
flag = not flag
if ans > b * y:
ans = b * y
print(ans)
main() | from itertools import product
def main():
n = int(eval(input()))
n_copy = n
if n == 1:
print((1))
exit()
if n % 2 == 0:
ans = 2 * n - 1
n *= 2
else:
ans = n - 1
factors = []
for p in range(2, n):
if p * p > n:
if n > 1:
factors.append(n)
break
if n % p == 0:
cnt = 0
while n % p == 0:
cnt += 1
n //= p
factors.append(p ** cnt)
for tf in product([True, False], repeat=len(factors)):
a, b = 1, 1
for i in range(len(factors)):
if tf[i]:
a *= factors[i]
else:
b *= factors[i]
if a == 1 or b == 1:
continue
if a < b:
a, b = b, a
# Euclidean Algorithm
# a*x - b*y = 1
# quotient: 商
l = []
quo = []
while a % b > 1:
l.append(a)
a = b
quo.append(0)
quo[-1], b = divmod(l[-1], b)
x, y = 1, a//b
flag = True
while l:
if flag:
x += y * quo.pop()
b = l.pop()
else:
y += x * quo.pop()
a = l.pop()
flag = not flag
if ans > b * y:
ans = b * y
print(ans)
main() | p02541 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
def extgcd(a, b):
if b:
d, y, x = extgcd(b, a % b)
y -= (a // b) * x
return d, x, y
return a, 1, 0
# V = [(X_i, Y_i), ...]: X_i (mod Y_i)
def remainder(V):
x = 0; d = 1
for X, Y in V:
g, a, b = extgcd(d, Y)
x, d = (Y*b*x + d*a*X) // g, d*(Y // g)
x %= d
return x, d
N = I()
def prime_factorization(n):
ANS = {}
for i in range(2,int(n**.5)+1):
if n % i == 0:
r = 0 # nがiで何回割り切れるか
while n % i == 0:
n //= i
r += 1
ANS[i] = r
if n != 1:
ANS[n] = 1
return ANS
prime = prime_factorization(N)
if not 2 in list(prime.keys()):
prime[2] = 1
else:
prime[2] += 1
A = list(prime.keys())
B = list(prime.values())
l = len(A)
ans = 2*N
from itertools import product
for a in list(product([-1,0],repeat=l)):
for i in range(l):
if a[i] != 0:
break
else:
continue
V = [(a[i],A[i]**B[i]) for i in range(l)]
x,d = remainder(V)
ans = min(ans,x)
print(ans)
| import sys
from itertools import product
def I(): return int(sys.stdin.readline().rstrip())
def ext_gcd(a, b):
if b:
d, y, x = ext_gcd(b, a % b)
y -= (a // b) * x
return d, x, y
return a, 1, 0
# V = [(X_i, Y_i), ...]: X_i (mod Y_i)
def remainder(V):
x = 0; d = 1
for X, Y in V:
g, a, b = ext_gcd(d, Y)
x, d = (Y*b*x + d*a*X) // g, d*(Y // g)
x %= d
return x, d
def prime_factorization(n):
res = {}
for i in range(2,int(n**.5)+1):
if n % i == 0:
r = 0 # nがiで何回割り切れるか
while n % i == 0:
n //= i
r += 1
res[i] = r
if n != 1:
res[n] = 1
return res
N = I()
prime_fac = prime_factorization(N)
if 2 in list(prime_fac.keys()):
prime_fac[2] += 1
else:
prime_fac[2] = 1
# prime_fac = 2*N の素因数分解
# 2*N|k*(k+1)
# 中国剰余定理を用いる
A = list(prime_fac.keys())
l = len(A)
ans = 2*N
for a in list(product([-1,0],repeat=l)):
V = [(a[i],A[i]**prime_fac[A[i]]) for i in range(l)]
x,d = remainder(V)
if x != 0:
ans = min(ans,x)
print(ans)
| p02541 |
from itertools import product
def prime_factors(N): #素因数 1を含まないことに注意
ret = []
middle = int( N**(1/2))
tmp = N
for i in range(2, middle+1):
if tmp%i == 0:
t = 1
while tmp%i == 0:
tmp //= i
t *= i
ret.append(t)
if tmp != 1:
ret.append(tmp)
return ret
def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def main():
N = int( eval(input()))
P = prime_factors(2*N)
M = len(P)
ans = 2*N-1
for p in product( list(range(2)), repeat=M):
x = 1
for i, t in enumerate(p):
if t == 1:
x *= P[i]
y = N*2//x
if x == 1:
if y-1 < ans:
ans = y-1
continue
if y == 1:
if x-1 < ans:
ans = x-1
continue
_, a, b = xgcd(x,y)
now = -a*x
# print(x, y, a, b)
if a < 0:
pass
else:
now = -b*y
if now < ans:
ans = now
print(ans)
if __name__ == '__main__':
main()
| from itertools import product
def prime_factors(N): #素因数 1を含まないことに注意
ret = []
middle = int( N**(1/2))
tmp = N
for i in range(2, middle+1):
if tmp%i == 0:
t = 1
while tmp%i == 0:
tmp //= i
t *= i
ret.append(t)
if tmp != 1:
ret.append(tmp)
return ret
def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def main():
N = int( eval(input()))
# print("start")
P = prime_factors(2*N)
M = len(P)
ans = 2*N-1
# print(M)
for p in product( list(range(2)), repeat=M):
x = 1
for i, t in enumerate(p):
if t == 1:
x *= P[i]
y = N*2//x
if x == 1:
if y-1 < ans:
ans = y-1
continue
if y == 1:
if x-1 < ans:
ans = x-1
continue
_, a, b = xgcd(x,y)
now = -a*x
# print(x, y, a, b)
if a < 0:
pass
else:
now = -b*y
if now < ans:
ans = now
print(ans)
if __name__ == '__main__':
main()
| p02541 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 50
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
@mt
def slv(K):
def f(n):
return (n+1)*n // 2
b = Bisect(f)
for i in range(1, INF):
t = K*i
j = b.bisect_left(t, 1, INF)
if f(j) == t:
return j
def main():
K = read_int()
print(slv(K))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 50
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
def divisor(n):
for i in range(1, int(n**0.5)+1):
if n % i == 0:
yield i
if i != n // i:
yield n // i
def exEuclid(a, mod):
b = mod
s, u = 1, 0
while b:
q = a // b
a, b = b, a % b
s, u = u, s - q * u
return a, s % mod
def crt(R, M):
assert len(R) == len(M)
N = len(R)
r0, m0 = 0, 1
for r, m in zip(R, M):
assert m >= 1
r %= m
if m0 < m:
r0, r = r, r0
m0, m = m, m0
if m0 % m == 0:
if r0 % m != r:
return (0, 0)
continue
g, im = exEuclid(m0, m)
u = m // g
if (r - r0) % g:
return (0, 0)
x = (r - r0) // g % u * im % u
r0 += x * m0
m0 *= u
if r0 < 0:
r0 += m0
return (r0, m0)
@mt
def slv(N):
def f(n):
return (n+1)*n // 2
cand = list(divisor(2*N))
cand.sort()
ans = INF
for x in cand:
kc, _ = crt([0, -1], (x, 2*N//x))
if kc != 0:
ans = min(ans, kc)
return ans
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| p02541 |
# -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 50
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
def divisor(n):
for i in range(1, int(n**0.5)+1):
if n % i == 0:
yield i
if i != n // i:
yield n // i
def exEuclid(a, mod):
b = mod
s, u = 1, 0
while b:
q = a // b
a, b = b, a % b
s, u = u, s - q * u
return a, s % mod
def crt(R, M):
assert len(R) == len(M)
N = len(R)
r0, m0 = 0, 1
for r, m in zip(R, M):
assert m >= 1
r %= m
if m0 < m:
r0, r = r, r0
m0, m = m, m0
if m0 % m == 0:
if r0 % m != r:
return (0, 0)
continue
g, im = exEuclid(m0, m)
u = m // g
if (r - r0) % g:
return (0, 0)
x = (r - r0) // g % u * im % u
r0 += x * m0
m0 *= u
if r0 < 0:
r0 += m0
return (r0, m0)
@mt
def slv(N):
def f(n):
return (n+1)*n // 2
cand = list(divisor(2*N))
cand.sort()
ans = INF
for x in cand:
kc, _ = crt([0, -1], (x, 2*N//x))
if kc != 0:
ans = min(ans, kc)
return ans
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 50
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
def divisor(n):
for i in range(1, int(n**0.5)+1):
if n % i == 0:
yield i
if i != n // i:
yield n // i
def exEuclid(a, mod):
b = mod
s, u = 1, 0
while b:
q = a // b
a, b = b, a % b
s, u = u, s - q * u
return a, s % mod
def crt(R, M):
assert len(R) == len(M)
N = len(R)
r0, m0 = 0, 1
for r, m in zip(R, M):
assert m >= 1
r %= m
if m0 < m:
r0, r = r, r0
m0, m = m, m0
if m0 % m == 0:
if r0 % m != r:
return (0, 0)
continue
g, im = exEuclid(m0, m)
u = m // g
if (r - r0) % g:
return (0, 0)
x = (r - r0) // g % u * im % u
r0 += x * m0
m0 *= u
if r0 < 0:
r0 += m0
return (r0, m0)
@mt
def slv(N):
ans = INF
for x in divisor(2*N):
kc, _ = crt([0, -1], (x, 2*N//x))
if kc != 0:
ans = min(ans, kc)
return ans
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| p02541 |
import copy
N = int(eval(input()))
K = [[1, N]]
for i in range(2, max(int(N**0.5)+1, 2)):
if N % i == 0:
K.append([i, N//i])
ans = 3*N
for i in range(len(K)):
a, b = K[i]
p = copy.copy(b)
while(True):
if b > ans:
break
if (2*b-1) % a == 0:
ans = min(ans, 2*b-1)
elif (2*b+1) % a == 0:
ans = min(ans, 2*b)
if b % 2 == 1:
if ((b - 1) // 2) % a == 0:
ans = min(ans, b - 1)
elif ((b + 1) // 2) % a == 0:
ans = min(ans, b)
b += p
if N == 1:
print((1))
elif N == 2:
print((3))
else:
print(ans) | import math
def extgcd(a, b):
"""
ax + by = gcd(a,b) = d となる (x,y,d) を返す
"""
if b == 0:
return (1, 0, a)
q, r = a // b, a % b
x, y, d = extgcd(b, r)
s, t = y, x - q * y
return s, t, d
def inv_mod(a, N):
"""
ax = 1 mod N となる x を返す
"""
return extgcd(a, N)[0]
def CRT(a_1, a_2, m_1, m_2):
"""
x = a_1 mod m_1, x = a_2 mod m_2 となる x を返す
"""
y = (a_2 - a_1) * inv_mod(m_1, m_2) % m_2
return a_1 + m_1 * y
N = int(eval(input()))
N *= 2
K = [[1, N]]
for i in range(2, max(int(N**0.5)+1, 2)):
if N % i == 0:
K.append([i, N//i])
ans = float("inf")
for i in range(len(K)):
a, b = K[i]
if math.gcd(a, b) == 1:
P = CRT(0, -1, a, b)
if P != 0:
ans = min(P, ans)
Q = CRT(0, -1, b, a)
if Q != 0:
ans = min(Q, ans)
print(ans) | p02541 |
import sys
from collections import deque
input = sys.stdin.readline
def inv_gcd(a, b):
a = (a + b) % b
if a == 0:
return (b, 0)
s, t = b, a
m0, m1 = 0, 1
while t:
u = s // t
s -= t * u
m0 -= m1 * u
tmp = s
s = t
t = tmp
tmp = m0
m0 = m1
m1 = tmp
if m0 < 0:
m0 += b // s
return (s, m0)
def crt(r, m):
n = len(r)
r0, m0 = 0, 1
for i in range(n):
r1, m1 = (r[i] + m[i]) % m[i], m[i]
if m0 < m1:
m0, m1 = m1, m0
r0, r1 = r1, r0
if m0 % m1 == 0:
if r0 % m1 != r1:
return (0, 0)
continue
g, im = inv_gcd(m0, m1)
u1 = m1 // g
if (r1 - r0) % g:
return (0, 0)
x = (r1 - r0) // g % u1 * im % u1
r0 += x * m0
m0 *= u1
if (r0 < 0):
r0 += m0
return (r0, m0)
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
def main():
n = int(eval(input()))
divisors = make_divisors(2 * n)
ans = n-1 if n%2 else 2*n-1
for x in divisors:
y = n * 2 // x
if y == 1:
continue
r = [0, y-1]
m = [x, y]
rem, mod = crt(r, m)
if rem == mod == 0:
continue
ans = min(ans, rem)
print((ans if n-1 else 1))
if __name__ == "__main__":
main() | def inv_gcd(a, b):
a = (a + b) % b
if a == 0:
return (b, 0)
s, t = b, a
m0, m1 = 0, 1
while t:
u = s // t
s -= t * u
m0 -= m1 * u
tmp = s
s = t
t = tmp
tmp = m0
m0 = m1
m1 = tmp
if m0 < 0:
m0 += b // s
return (s, m0)
def crt(r, m):
n = len(r)
r0, m0 = 0, 1
for i in range(n):
r1, m1 = (r[i] + m[i]) % m[i], m[i]
if m0 < m1:
m0, m1 = m1, m0
r0, r1 = r1, r0
if m0 % m1 == 0:
if r0 % m1 != r1:
return (0, 0)
continue
g, im = inv_gcd(m0, m1)
u1 = m1 // g
if (r1 - r0) % g:
return (0, 0)
x = (r1 - r0) // g % u1 * im % u1
r0 += x * m0
m0 *= u1
if (r0 < 0):
r0 += m0
return (r0, m0)
def divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
# print(divisors(z))
z=int(eval(input()))
ans = z-1 if z%2 else 2*z-1
for i in divisors(2*z):
y=2*z//i
if y == 1:
continue
a=[0,-1]
b=[i,y]
rem, mod = crt(a, b)
#print(rem)
#print(mod)
if rem == mod == 0:
continue
ans = min(ans, rem)
print((ans if z-1 else 1)) | p02541 |
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10
def factorize(num: int) -> dict:
""" 素因数分解 """
from math import sqrt
from collections import Counter
d = Counter()
for i in range(2, int(sqrt(num))+1):
while num % i == 0:
num //= i
d[i] += 1
if num == 1:
break
if num != 1:
d[num] += 1
return d
def extgcd(a, b, x, y):
""" 拡張ユークリッドの互除法(ax+by=gcd(a, b)の解を求める) """
if b == 0:
x = 1
y = 0
return (y, x)
else:
x, y = extgcd(b, a%b, y, x)
y -= a // b * x
return (y, x)
N = INT()
fact = list(factorize(N*2).items())
M = len(fact)
ans = N
for bit in range(1<<M):
a = b = 1
for i in range(M):
if (bit>>i) & 1:
a *= fact[i][0] ** fact[i][1]
else:
b *= fact[i][0] ** fact[i][1]
y, x = extgcd(a, b, 0, 0)
if x == 0 or y == 0:
continue
res = min(a*abs(x), b*abs(y))
ans = min(ans, res)
print(ans)
| import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10
def factorize(num: int) -> dict:
""" 素因数分解 """
from math import sqrt
from collections import Counter
d = Counter()
for i in range(2, int(sqrt(num))+1):
while num % i == 0:
num //= i
d[i] += 1
if num == 1:
break
if num != 1:
d[num] += 1
return d
def extgcd(a, b, x, y):
""" 拡張ユークリッドの互除法(ax+by=gcd(a, b)の解を求める) """
if b == 0:
x = 1
y = 0
return (y, x)
else:
x, y = extgcd(b, a%b, y, x)
y -= a // b * x
return (y, x)
N = INT()
fact = list(factorize(N*2).items())
M = len(fact)
ans = N
for bit in range(1<<M):
a = b = 1
for i in range(M):
if (bit>>i) & 1:
a *= fact[i][0] ** fact[i][1]
else:
b *= fact[i][0] ** fact[i][1]
y, x = extgcd(a, b, 0, 0)
if x == 0 or y == 0:
continue
res = min(abs(a*x), abs(b*y))
ans = min(ans, res)
print(ans)
| p02541 |
#素因数分解、計算量はO(√N)
from collections import defaultdict
def factorize(n):
b = 2
dic = defaultdict(lambda: 0)
while b * b <= n:
while n % b == 0:
n //= b
dic[b] += 1
b = b + 1
if n > 1:
dic[n] += 1
return dic
N = int(eval(input()))
fct = factorize(2*N)
lis = []
for k,v in list(fct.items()):
lis.append(pow(k,v))
lis.sort(reverse=True)
ans = 10**18
from itertools import groupby, accumulate, product, permutations, combinations
for pro in product([1,0],repeat=len(lis)):
prod1 = 1
for i,p in enumerate(pro):
if p==1:
prod1 *= lis[i]
prod2 = (N*2)//prod1
if prod1<prod2:
# prod1,prod2 = prod2,prod1
continue
for i in range(1,prod2+1):
if prod1*i>ans:
break
if (prod1*i-1)%prod2==0:
ans = min(ans, prod1*i-1)
break
if (prod1*i+1)%prod2==0:
ans = min(ans, prod1*i)
break
print(ans)
| #素因数分解、計算量はO(√N)
from collections import defaultdict
def factorize(n):
b = 2
dic = defaultdict(lambda: 0)
while b * b <= n:
while n % b == 0:
n //= b
dic[b] += 1
b = b + 1
if n > 1:
dic[n] += 1
return dic
N = int(eval(input()))
fct = factorize(2*N)
lis = []
for k,v in list(fct.items()):
lis.append(pow(k,v))
ans = 10**18
from itertools import groupby, accumulate, product, permutations, combinations
for pro in product([1,0],repeat=len(lis)):
prod1 = 1
for i,p in enumerate(pro):
if p==1:
prod1 *= lis[i]
prod2 = (N*2)//prod1
if prod1<prod2:
# prod1,prod2 = prod2,prod1
continue
for i in range(1,prod2+1):
if prod1*i>ans:
break
if (prod1*i-1)%prod2==0:
ans = min(ans, prod1*i-1)
break
if (prod1*i+1)%prod2==0:
ans = min(ans, prod1*i)
break
print(ans)
| p02541 |
#素因数分解、計算量はO(√N)
from collections import defaultdict
def factorize(n):
b = 2
dic = defaultdict(lambda: 0)
while b * b <= n:
while n % b == 0:
n //= b
dic[b] += 1
b = b + 1
if n > 1:
dic[n] += 1
return dic
N = int(eval(input()))
fct = factorize(2*N)
lis = []
for k,v in list(fct.items()):
lis.append(pow(k,v))
ans = 10**18
from itertools import groupby, accumulate, product, permutations, combinations
for pro in product([0,1],repeat=len(lis)):
prod1 = 1
for i,p in enumerate(pro):
if p==1:
prod1 *= lis[i]
prod2 = (N*2)//prod1
if prod1<prod2:
prod1,prod2 = prod2,prod1
# continue
for i in range(1,prod2+1):
# if prod1*i>ans:
# break
if (prod1*i-1)%prod2==0:
ans = min(ans, prod1*i-1)
break
if (prod1*i+1)%prod2==0:
ans = min(ans, prod1*i)
break
print(ans)
| #素因数分解、計算量はO(√N)
from collections import defaultdict
def factorize(n):
b = 2
dic = defaultdict(lambda: 0)
while b * b <= n:
while n % b == 0:
n //= b
dic[b] += 1
b = b + 1
if n > 1:
dic[n] += 1
return dic
def extgcd(a, b):
if b:
d, y, x = extgcd(b, a%b)
y -= (a//b)*x
return d, x, y
else:
return a, 1, 0
N = int(eval(input()))
fct = factorize(2*N)
lis = []
for k,v in list(fct.items()):
lis.append(pow(k,v))
ans = 10**18
from itertools import groupby, accumulate, product, permutations, combinations
for pro in product([0,1],repeat=len(lis)):
prod1 = 1
for i,p in enumerate(pro):
if p==1:
prod1 *= lis[i]
prod2 = (N*2)//prod1
if min(prod1,prod2)==1:
ans = min(ans, max(prod1,prod2)-1)
else:
d,a1,a2 = extgcd(prod1,prod2)
ans = min(ans, min(abs(a1*prod1),abs(a2*prod2)))
print(ans)
| p02541 |
import math
N=int(eval(input()))
ANS=[0,1, 3, 2, 7, 4, 3, 6, 15, 8, 4, 10, 8, 12, 7, 5, 31, 16, 8, 18, 15, 6, 11, 22, 15, 24, 12, 26, 7, 28, 15, 30, 63, 11, 16, 14, 8, 36, 19, 12, 15, 40, 20, 42, 32, 9, 23, 46, 32, 48, 24, 17, 39, 52, 27, 10, 48, 18, 28, 58, 15, 60, 31, 27, 127, 25, 11, 66, 16, 23, 20, 70, 63, 72, 36, 24, 56, 21, 12, 78, 64, 80, 40, 82, 48, 34, 43, 29, 32, 88, 35, 13, 23, 30, 47, 19, 63, 96, 48, 44, 24]
if N<=100:
print((ANS[N]))
exit()
def ff(x):
L=int(math.sqrt(x))
FACT=dict()
for i in range(2,L+2):
while x%i==0:
FACT[i]=FACT.get(i,0)+1
x=x//i
if x!=1:
FACT[x]=FACT.get(x,0)+1
return FACT
# 拡張ユークリッドの互除法.ax+by=gcd(a,b)となる(x,y)を一つ求め、(x,y)とgcd(x,y)を返す.
def Ext_Euc(a,b,axy=(1,0),bxy=(0,1)): # axy=a*1+b*0,bxy=a*0+b*1なので,a,bに対応する係数の初期値は(1,0),(0,1)
# print(a,b,axy,bxy)
q,r=divmod(a,b)
if r==0:
return bxy,b # a*bxy[0]+b*bxy[1]=b
rxy=(axy[0]-bxy[0]*q,axy[1]-bxy[1]*q) # rに対応する係数を求める.
return Ext_Euc(b,r,bxy,rxy)
FACT=ff(N*2)
LIST=[]
for f in FACT:
LIST.append(f**FACT[f])
L=len(LIST)
LANS=1<<60
for i in range(1,(1<<L)-1):
A=1
B=1
for j in range(L):
if i & (1<<j)!=0:
A*=LIST[j]
else:
B*=LIST[j]
#print(A,B)
#print(Ext_Euc(A,-B))
x,_=Ext_Euc(A,-B)
x,y=x[0],x[1]
# ANS=x+B*k
if x<0:
x+=(1+abs(x)//B)*B
#k=(B+x-1)//x
#ANS=x+B*k
#print(x,B,k,ANS)
LANS=min(LANS,x*A)
print(LANS)
| import math
N=int(eval(input()))
def ff(x):
L=int(math.sqrt(x))
FACT=dict()
for i in range(2,L+2):
while x%i==0:
FACT[i]=FACT.get(i,0)+1
x=x//i
if x!=1:
FACT[x]=FACT.get(x,0)+1
return FACT
# 拡張ユークリッドの互除法.ax+by=gcd(a,b)となる(x,y)を一つ求め、(x,y)とgcd(x,y)を返す.
def Ext_Euc(a,b,axy=(1,0),bxy=(0,1)): # axy=a*1+b*0,bxy=a*0+b*1なので,a,bに対応する係数の初期値は(1,0),(0,1)
# print(a,b,axy,bxy)
q,r=divmod(a,b)
if r==0:
return bxy,b # a*bxy[0]+b*bxy[1]=b
rxy=(axy[0]-bxy[0]*q,axy[1]-bxy[1]*q) # rに対応する係数を求める.
return Ext_Euc(b,r,bxy,rxy)
FACT=ff(N*2)
LIST=[]
for f in FACT:
LIST.append(f**FACT[f])
L=len(LIST)
LANS=2*N-1
for i in range(1<<L):
A=1
B=1
for j in range(L):
if i & (1<<j)!=0:
A*=LIST[j]
else:
B*=LIST[j]
if A==1 or B==1:
continue
x,_=Ext_Euc(A,-B)
x,y=x[0],x[1]
if x<0:
x+=(1+abs(x)//B)*B
LANS=min(LANS,x*A)
print(LANS)
| p02541 |
from collections import defaultdict
import typing
def _is_prime(n: int) -> bool:
'''
Reference:
M. Forisek and J. Jancina,
Fast Primality Testing for Integers That Fit into a Machine Word
'''
if n <= 1:
return False
if n == 2 or n == 7 or n == 61:
return True
if n % 2 == 0:
return False
d = n - 1
while d % 2 == 0:
d //= 2
for a in (2, 7, 61):
t = d
y = pow(a, t, n)
while t != n - 1 and y != 1 and y != n - 1:
y = y * y % n
t <<= 1
if y != n - 1 and t % 2 == 0:
return False
return True
def _inv_gcd(a: int, b: int) -> typing.Tuple[int, int]:
a %= b
if a == 0:
return (b, 0)
# Contracts:
# [1] s - m0 * a = 0 (mod b)
# [2] t - m1 * a = 0 (mod b)
# [3] s * |m1| + t * |m0| <= b
s = b
t = a
m0 = 0
m1 = 1
while t:
u = s // t
s -= t * u
m0 -= m1 * u # |m1 * u| <= |m1| * s <= b
# [3]:
# (s - t * u) * |m1| + t * |m0 - m1 * u|
# <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)
# = s * |m1| + t * |m0| <= b
s, t = t, s
m0, m1 = m1, m0
# by [3]: |m0| <= b/g
# by g != b: |m0| < b/g
if m0 < 0:
m0 += b // s
return (s, m0)
def _primitive_root(m: int) -> int:
if m == 2:
return 1
if m == 167772161:
return 3
if m == 469762049:
return 3
if m == 754974721:
return 11
if m == 998244353:
return 3
divs = [2] + [0] * 19
cnt = 1
x = (m - 1) // 2
while x % 2 == 0:
x //= 2
i = 3
while i * i <= x:
if x % i == 0:
divs[cnt] = i
cnt += 1
while x % i == 0:
x //= i
i += 2
if x > 1:
divs[cnt] = x
cnt += 1
g = 2
while True:
for i in range(cnt):
if pow(g, (m - 1) // divs[i], m) == 1:
break
else:
return g
g += 1
def factorize(n):
dd = defaultdict(int)
for i in range(2,int(n**0.5)+1):
while n%i==0 and n>0:
dd[i]+=1
n//=i
if n>1:
dd[n]+=1
return dd
def crt(r: typing.List[int], m: typing.List[int]) -> typing.Tuple[int, int]:
assert len(r) == len(m)
n = len(r)
# Contracts: 0 <= r0 < m0
r0 = 0
m0 = 1
for i in range(n):
assert 1 <= m[i]
r1 = r[i] % m[i]
m1 = m[i]
if m0 < m1:
r0, r1 = r1, r0
m0, m1 = m1, m0
if m0 % m1 == 0:
if r0 % m1 != r1:
return (0, 0)
continue
# assume: m0 > m1, lcm(m0, m1) >= 2 * max(m0, m1)
'''
(r0, m0), (r1, m1) -> (r2, m2 = lcm(m0, m1));
r2 % m0 = r0
r2 % m1 = r1
-> (r0 + x*m0) % m1 = r1
-> x*u0*g % (u1*g) = (r1 - r0) (u0*g = m0, u1*g = m1)
-> x = (r1 - r0) / g * inv(u0) (mod u1)
'''
# im = inv(u0) (mod u1) (0 <= im < u1)
g, im = _inv_gcd(m0, m1)
u1 = m1 // g
# |r1 - r0| < (m0 + m1) <= lcm(m0, m1)
if (r1 - r0) % g:
return (0, 0)
# u1 * u1 <= m1 * m1 / g / g <= m0 * m1 / g = lcm(m0, m1)
x = (r1 - r0) // g % u1 * im % u1
'''
|r0| + |m0 * x|
< m0 + m0 * (u1 - 1)
= m0 + m0 * m1 / g - m0
= lcm(m0, m1)
'''
r0 += x * m0
m0 *= u1 # -> lcm(m0, m1)
if r0 < 0:
r0 += m0
return (r0, m0)
N = int(eval(input()))
if N==1:
print((1))
else:
D = factorize(N)
D[2] += 1
key = list(D.keys())
m = [k**D[k] for k in key]
ans = 2*N
for i in range(2**len(key)):
j = 1
r = []
while j < 2**len(key):
if j&i>0:
r.append(-1)
else:
r.append(0)
j*=2
y,z = crt(r,m)
if y==0:
y = z
if y==1:
continue
ans = min(ans,y)
print(ans) | from collections import defaultdict
def _is_prime(n):
'''
Reference:
M. Forisek and J. Jancina,
Fast Primality Testing for Integers That Fit into a Machine Word
'''
if n <= 1:
return False
if n == 2 or n == 7 or n == 61:
return True
if n % 2 == 0:
return False
d = n - 1
while d % 2 == 0:
d //= 2
for a in (2, 7, 61):
t = d
y = pow(a, t, n)
while t != n - 1 and y != 1 and y != n - 1:
y = y * y % n
t <<= 1
if y != n - 1 and t % 2 == 0:
return False
return True
def _inv_gcd(a, b):
a %= b
if a == 0:
return (b, 0)
# Contracts:
# [1] s - m0 * a = 0 (mod b)
# [2] t - m1 * a = 0 (mod b)
# [3] s * |m1| + t * |m0| <= b
s = b
t = a
m0 = 0
m1 = 1
while t:
u = s // t
s -= t * u
m0 -= m1 * u # |m1 * u| <= |m1| * s <= b
# [3]:
# (s - t * u) * |m1| + t * |m0 - m1 * u|
# <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)
# = s * |m1| + t * |m0| <= b
s, t = t, s
m0, m1 = m1, m0
# by [3]: |m0| <= b/g
# by g != b: |m0| < b/g
if m0 < 0:
m0 += b // s
return (s, m0)
def _primitive_root(m: int) -> int:
if m == 2:
return 1
if m == 167772161:
return 3
if m == 469762049:
return 3
if m == 754974721:
return 11
if m == 998244353:
return 3
divs = [2] + [0] * 19
cnt = 1
x = (m - 1) // 2
while x % 2 == 0:
x //= 2
i = 3
while i * i <= x:
if x % i == 0:
divs[cnt] = i
cnt += 1
while x % i == 0:
x //= i
i += 2
if x > 1:
divs[cnt] = x
cnt += 1
g = 2
while True:
for i in range(cnt):
if pow(g, (m - 1) // divs[i], m) == 1:
break
else:
return g
g += 1
def factorize(n):
dd = defaultdict(int)
for i in range(2,int(n**0.5)+1):
while n%i==0 and n>0:
dd[i]+=1
n//=i
if n>1:
dd[n]+=1
return dd
def crt(r, m):
assert len(r) == len(m)
n = len(r)
# Contracts: 0 <= r0 < m0
r0 = 0
m0 = 1
for i in range(n):
assert 1 <= m[i]
r1 = r[i] % m[i]
m1 = m[i]
if m0 < m1:
r0, r1 = r1, r0
m0, m1 = m1, m0
if m0 % m1 == 0:
if r0 % m1 != r1:
return (0, 0)
continue
# assume: m0 > m1, lcm(m0, m1) >= 2 * max(m0, m1)
'''
(r0, m0), (r1, m1) -> (r2, m2 = lcm(m0, m1));
r2 % m0 = r0
r2 % m1 = r1
-> (r0 + x*m0) % m1 = r1
-> x*u0*g % (u1*g) = (r1 - r0) (u0*g = m0, u1*g = m1)
-> x = (r1 - r0) / g * inv(u0) (mod u1)
'''
# im = inv(u0) (mod u1) (0 <= im < u1)
g, im = _inv_gcd(m0, m1)
u1 = m1 // g
# |r1 - r0| < (m0 + m1) <= lcm(m0, m1)
if (r1 - r0) % g:
return (0, 0)
# u1 * u1 <= m1 * m1 / g / g <= m0 * m1 / g = lcm(m0, m1)
x = (r1 - r0) // g % u1 * im % u1
'''
|r0| + |m0 * x|
< m0 + m0 * (u1 - 1)
= m0 + m0 * m1 / g - m0
= lcm(m0, m1)
'''
r0 += x * m0
m0 *= u1 # -> lcm(m0, m1)
if r0 < 0:
r0 += m0
return (r0, m0)
N = int(eval(input()))
if N==1:
print((1))
else:
D = factorize(N)
D[2] += 1
key = list(D.keys())
m = [k**D[k] for k in key]
ans = 2*N
for i in range(2**len(key)):
j = 1
r = []
while j < 2**len(key):
if j&i>0:
r.append(-1)
else:
r.append(0)
j*=2
y,z = crt(r,m)
if y==0:
y = z
if y==1:
continue
ans = min(ans,y)
print(ans) | p02541 |
from math import sqrt
from decimal import *
import decimal
N=int(eval(input()))
getcontext().prec=30
"""
l=[]
pf={}
m=N
for i in range(2,int(m**0.5)+1):
while m%i==0:
pf[i]=pf.get(i,0)+1
m//=i
if m>1:pf[m]=1
print(pf)
keys=list(pf.keys())
values=list(pf.values())
for i in range(len(keys)):
l.append([keys[i],values[i]])
print(l)
"""
a=1
while True:
t=Decimal(1+8*a*N).sqrt()
#print(t)
#print(t.to_integral_value())
n=t.to_integral_value()
if (pow(n,Decimal(2),1+8*a*N)==0)and(int(t)%2==1):
print(((int(t)-1)//2))
break
a=a+1
| from math import sqrt
from collections import deque
def ggcd(a,b):
if(b==0):
return a
return ggcd(b,a%b)
N=int(eval(input()))
def gcd_ext(a, b):
x, y, lastx, lasty = 0, 1, 1, 0
while b != 0:
q = a // b
a, b = b, a % b
x, y, lastx, lasty = lastx - q * x, lasty - q * y, x, y
return (lastx, lasty)
l=[]
pf={}
m=N*2
for i in range(2,int(m**0.5)+1):
while m%i==0:
pf[i]=pf.get(i,0)+1
m//=i
if m>1:pf[m]=1
#print(pf)
keys=list(pf.keys())
values=list(pf.values())
for i in range(len(keys)):
l.append([keys[i],values[i]])
#print(l)
d=deque()
d.append([])
for i in range(len(l)):
x=list(range(values[i]+1))
d2 = deque()
#print(x)
while len(d)>0:
l=d.popleft()
for j in x:
l2=l[:]
l2.append(j)
d2.append(l2)
d=d2
#print(d)
ans=float("inf")
x=0
y=0
while len(d)>0:
l=d.popleft()
num=1
res=1
for i in range(len(l)):
num=num*pow(keys[i],l[i])
res=res*pow(keys[i],values[i]-l[i])
#print(num,res)
#x*num=k+1のときを考える
if ggcd(num,res)==1:
#x*num+y*res=1
x,y=gcd_ext(num,res)
if (x==0)or(y==0):
x1=x+num*res
y1=y+num+res
ans=min(ans,x1*num-1)
x2=x-num*res
y2=x-num*res
ans=min(ans,-x2*num)
else:#どっちかは+でどっちかは-
if x>y:
ans=min(ans,x*num-1)
x1=x-num*res
ans=min(ans,-x1*num)
else:
x1=x+num*res
ans=min(ans,x1*num-1)
ans=min(ans,-x*num)
print(ans)
| p02541 |
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, input().strip().split()))
dp = {}
keys = []
i = 1
while i <= N:
v = N // i
j = N // v
keys.append((v, j - i + 1))
i += j - i + 1
total = 0
for nj, w in keys:
total += w
dp[nj] = total
for i in range(2, K + 1):
tmp = {}
total = 0
for nj, w in keys:
j = N // nj
v = dp[j] * w
total += v
total %= MOD
tmp[nj] = total
dp = tmp
return dp[1]
if __name__ == '__main__':
print((main())) | MOD = 10 ** 9 + 7
def main(N, K):
W = []
i = 1
while i <= N:
v = N // i
j = N // v
# keys.append((v, j - i + 1))
W.append(j - i + 1)
i += j - i + 1
l = len(W)
dp = [0] * l
total = 0
for i, w in enumerate(W):
total += w
dp[l - i - 1] = total
for i in range(2, K + 1):
tmp = [0] * l
total = 0
for j, w in enumerate(W):
v = dp[j] * w
total += v
total %= MOD
tmp[l - j - 1] = total
dp = tmp
return dp[0]
if __name__ == '__main__':
N, K = list(map(int, input().strip().split()))
# import time
# t = time.time()
print((main(N, K)))
# print(time.time() - t) | p02992 |
import bisect
import heapq
import sys
import itertools
import queue
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10 ** 9 + 7
class V:
def __init__(self, f):
self.f = f
self.v = None
def __str__(self):
return str(self.v)
def ud(self, n):
if self.v is None:
self.v = n
else:
self.v = self.f(self.v, n)
def get(self):
return self.v
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def P(N):
D = []
for n in range(1, int(N ** 0.5) + 1):
D.append(n)
if N // n != n:
D.append(N // n)
D.sort()
return D
def main():
N, K = read_values()
D = P(N)
C = [D[i] - D[i - 1] if i != 0 else D[i] for i, d in enumerate(D)]
dp = {}
SS = [[0] + D] + [[0] * (len(D) + 1) for k in range(K - 1)]
for k in range(1, K):
for i, d in enumerate(D):
j = bisect.bisect_left(D, N // d)
dp[d] = (SS[k - 1][j + 1] * C[i]) % mod
SS[k][i + 1] = (SS[k][i] + dp[d]) % mod
print((sum(dp.values()) % mod))
if __name__ == "__main__":
main()
| import bisect
import heapq
import sys
import itertools
import queue
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10 ** 9 + 7
class V:
def __init__(self, f):
self.f = f
self.v = None
def __str__(self):
return str(self.v)
def ud(self, n):
if self.v is None:
self.v = n
else:
self.v = self.f(self.v, n)
def get(self):
return self.v
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def P(N):
D = []
for n in range(1, int(N ** 0.5) + 1):
D.append(n)
if N // n != n:
D.append(N // n)
D.sort()
return D
def main():
N, K = read_values()
D = P(N)
C = [(D[i] - D[i - 1]) % mod if i != 0 else D[i] for i, d in enumerate(D)]
dp = [0] * len(D)
S = [D] + [[0] * len(D) for k in range(K - 1)]
I = [bisect.bisect_left(D, N // d) for d in D]
for k in range(1, K):
for i in range(len(D)):
j = I[i]
dp[i] = (S[k - 1][j] * C[i]) % mod
S[k][i] = (S[k][i - 1] + dp[i]) % mod
print((S[-1][-1] % mod))
if __name__ == "__main__":
main()
| p02992 |
import sys
from bisect import bisect_left as bl
input = sys.stdin.readline
N, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
h = 1
t = set()
while h * h <= N:
t.add(N // h)
t.add(h)
h += 1
t = sorted(t)
#print(t)
tt = []
for x in t:
tt.append(N // x)
dp = [[0] * len(t) for _ in range(K + 1)]
dp[0][0] = 1
for i in range(K):
for j in range(len(t)):
k = bl(t, tt[j])
dp[i + 1][k] += dp[i][j]
dp[i + 1][k] %= mod
#print(dp)
for k in range(len(t) - 1, 0, -1):
dp[i + 1][k - 1] += dp[i + 1][k]
dp[i + 1][k - 1] %= mod
for k in range(1, len(t)):
rng = (t[k] - t[k - 1]) % mod
dp[i + 1][k] *= rng
dp[i + 1][k] %= mod
#print(dp)
res = 0
#print(dp)
for j in range(len(t)):
res += dp[-1][j]
res %= mod
print(res) | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
h = 1
t = set()
while h * h <= N:
t.add(N // h)
t.add(h)
h += 1
t = sorted(t)
#print(len(t))
tt = []
for x in t:
tt.append(N // x)
dp = [[0] * len(t) for _ in range(K + 1)]
dp[0][0] = 1
for i in range(K):
for j in range(len(t)):
k = len(t) - j - 1
dp[i + 1][k] += dp[i][j]
dp[i + 1][k] %= mod
#print(dp)
for k in range(len(t) - 1, 0, -1):
dp[i + 1][k - 1] += dp[i + 1][k]
dp[i + 1][k - 1] %= mod
rng = (t[k] - t[k - 1]) % mod
dp[i + 1][k] *= rng
dp[i + 1][k] %= mod
#print(dp)
res = 0
#print(dp)
for j in range(len(t)):
res += dp[-1][j]
res %= mod
print(res) | p02992 |
import math
from bisect import bisect_left
MOD = 10**9 + 7
def main():
N, K = list(map(int, input().split()))
R = int(math.sqrt(N))
if N // R == R:
M = R * 2 - 1
else:
M = R * 2
mapping = [0] * (M+1)
for i in range(1, R+1):
mapping[i] = i
mapping[-i] = N//i
cnt = [0] * (M+1)
for i in range(1, M+1):
cnt[i] = mapping[i] - mapping[i-1]
dp = [[0] * (M+1) for _ in range(K+1)]
dp[0] = list(cnt)
for i in range(M):
dp[0][i+1] += dp[0][i]
for i in range(K-1):
for j in range(1, M+1):
v = N // mapping[j]
idx = bisect_left(mapping, v)
dp[i+1][j] = dp[i][idx]
for j in range(M):
dp[i+1][j+1] = (dp[i+1][j] + dp[i+1][j+1] * cnt[j+1]) % MOD
print((dp[K-1][M]))
if __name__ == "__main__":
main()
| import math
MOD = 10**9 + 7
def main():
N, K = list(map(int, input().split()))
R = int(math.sqrt(N))
if N // R == R:
M = R * 2 - 1
else:
M = R * 2
mapping = [0] * (M+1)
for i in range(1, R+1):
mapping[i] = i
mapping[-i] = N//i
cnt = [0] * (M+1)
for i in range(1, M+1):
cnt[i] = mapping[i] - mapping[i-1]
dp = [[0] * (M+1) for _ in range(K+1)]
dp[0] = list(cnt)
for i in range(M):
dp[0][i+1] += dp[0][i]
for i in range(K-1):
for j in range(1, M+1):
if j <= R:
idx = -j
else:
idx = M - j + 1
dp[i+1][j] = dp[i][idx]
for j in range(M):
dp[i+1][j+1] = (dp[i+1][j] + dp[i+1][j+1] * cnt[j+1]) % MOD
print((dp[K-1][M]))
if __name__ == "__main__":
main()
| p02992 |
from bisect import bisect
mod = 10**9+7
N,K = list(map(int,input().split()))
c = []
for i in range(1,int(N**0.5)+1):
c.append(i)
c.append(int(N/i))
c = list(set(c))
c.sort()
k = []
for i in c:
if int(N/i) != int(N/(i+1)):
k.append(i)
dp = [[0]*len(k) for _ in range(K)]
for i in range(len(k)):
dp[0][i]=k[i]
def S(n,m):
l = bisect(k,m)
return dp[n][l-1]+(dp[n][l]-dp[n][l-1])*(m-k[l-1])*pow(k[l]-k[l-1],mod-2,mod)
for i in range(K-1):
dp[i+1][0] = dp[i][-1]
for j in range(len(k)-1):
dp[i+1][j+1] = dp[i+1][j]+(k[j+1]-k[j])*S(i,int(N/(k[j]+1)))
dp[i+1][j+1] %= mod
print((dp[-1][-1])) | from bisect import bisect
mod = 10**9+7
N,K = list(map(int,input().split()))
c = []
for i in range(1,int(N**0.5)+1):
c.append(i)
c.append(int(N/i))
c = list(set(c))
c.sort()
k = []
for i in c:
if int(N/i) != int(N/(i+1)):
k.append(i)
dp = [[0]*len(k) for _ in range(K)]
for i in range(len(k)):
dp[0][i]=k[i]
inv = [0]*(len(k)-1)
for i in range(len(k)-1):
inv[i] = pow(k[i+1]-k[i],mod-2,mod)
index = [0]*len(k)
for i in range(len(k)):
m = int(N/(k[i]+1))
index[i] = bisect(k,m)
for i in range(K-1):
dp[i+1][0] = dp[i][-1]
for j in range(len(k)-1):
m = int(N/(k[j]+1))
l = index[j]
S = dp[i][l-1]+(dp[i][l]-dp[i][l-1])*(m-k[l-1])*inv[l-1]
dp[i+1][j+1] = dp[i+1][j]+(k[j+1]-k[j])*S
dp[i+1][j+1] %= mod
print((dp[-1][-1])) | p02992 |
from bisect import bisect
mod = 10**9+7
N,K = list(map(int,input().split()))
c = []
for i in range(1,int(N**0.5)+1):
c.append(i)
c.append(int(N/i))
c = list(set(c))
c.sort()
k = []
for i in c:
if int(N/i) != int(N/(i+1)):
k.append(i)
dp = [[0]*len(k) for _ in range(K)]
for i in range(len(k)):
dp[0][i]=k[i]
inv = [0]*(len(k)-1)
for i in range(len(k)-1):
inv[i] = pow(k[i+1]-k[i],mod-2,mod)
index = [0]*len(k)
for i in range(len(k)):
m = int(N/(k[i]+1))
index[i] = bisect(k,m)
for i in range(K-1):
dp[i+1][0] = dp[i][-1]
for j in range(len(k)-1):
m = int(N/(k[j]+1))
l = index[j]
S = dp[i][l-1]+(dp[i][l]-dp[i][l-1])*(m-k[l-1])*inv[l-1]
dp[i+1][j+1] = dp[i+1][j]+(k[j+1]-k[j])*S
dp[i+1][j+1] %= mod
print((dp[-1][-1])) | mod = 10**9+7
N,K = list(map(int,input().split()))
M = int(N**0.5)
dp = [[0]*M for _ in range(K+1)]
dp1 = [[0]*M for _ in range(K+1)]
dp2 = [[0]*M for _ in range(K+1)]
dp[0][0] = 1
dp1[0][0] = 1
dp2[0][0] = N
for m in range(1,M):
dp[0][m] = 1
dp1[0][m] = dp1[0][m-1]+dp[0][m]
dp2[0][m] += dp2[0][m-1]+N//(m+1)*dp[0][m]
dp[1][0] = N
dp1[1][0] = N
dp2[1][0] = N**2
for m in range(1,M):
dp[1][m] = N//(m+1)
dp1[1][m] = dp1[1][m-1]+dp[1][m]
dp2[1][m] += dp2[1][m-1]+N//(m+1)*dp[1][m]
for k in range(1,K):
for m in range(M):
dp[k+1][m] = dp1[k][M-1]+N//(m+1)*dp1[k-1][m]+dp2[k-1][M-1]-dp2[k-1][m]-M*dp1[k-1][M-1]
dp[k+1][m] %= mod
dp1[k+1][m] = dp1[k+1][m-1]+dp[k+1][m]
dp1[k+1][m] %= mod
dp2[k+1][m] = dp2[k+1][m-1]+N//(m+1)*dp[k+1][m]
dp2[k+1][m] %= mod
print((dp[K][0]))
| p02992 |
import sys
sys.setrecursionlimit(10**6)
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
U = [0]
V = []
for x in range(1, int(N**.5)+1):
U.append(x)
if x < N//x:
V.append(N//x)
V.reverse()
U.extend(V)
L = len(U)
memo = {(K, e): 1 for e in U}
for k in range(K-1, -1, -1):
memo[k, 0] = 0
r = 0
for x, y in zip(U, U[1:]):
memo[k, y] = r = ((y - x) * memo[k+1, N//y] + r) % MOD
print((memo[0, N])) | import sys
sys.setrecursionlimit(10**6)
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
U = [0]; V = []
for x in range(1, int(N**.5)+1):
U.append(x)
if x < N//x:
V.append(N//x)
V.reverse(); U.extend(V)
L = len(U)
S = [1]*L
S[0] = 0
for k in range(K-1, -1, -1):
T = [0]*L
r = 0
for i in range(1, L):
x = U[i-1]; y = U[i]
T[i] = r = ((y - x) * S[L-i] + r) % MOD
S = T
print((S[-1])) | p02992 |
def f(n,k):
lim = int((n + 0.1) ** 0.5) + 1
ws = []
s = 0
for i in range(1, lim):
w = n // i - n // (i + 1)
ws.append(w)
s += w
ws += [1] * (n - s)
m = len(ws)
dp0 = ws[::-1]
dp1 = [0] * m
for _ in range(k - 1):
s = 0
for j in range(m):
s += dp0[j]
dp1[m - j - 1] = (s * ws[j]) % md
dp0 = dp1[:]
print((sum(dp0) % md))
md=10**9+7
n,k=list(map(int,input().split()))
f(n,k)
| from itertools import accumulate
def f(n,k):
lim = int((n + 0.1) ** 0.5) + 1
ws = []
s = 0
for i in range(1, lim):
w = n // i - n // (i + 1)
ws.append(w)
s += w
ws += [1] * (n - s)
dp=ws
m = len(ws)
for _ in range(k - 1):
dp=[s*w%md for s,w in zip(accumulate(dp[::-1]),ws)]
print((sum(dp) % md))
md=10**9+7
n,k=list(map(int,input().split()))
f(n,k)
| p02992 |
import math
import os
import sys
from collections import defaultdict
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N, K = list(map(int, sys.stdin.readline().split()))
@lru_cache(maxsize=None)
def next_max(n):
# ある数と隣り合わせになれる数
return int(N // n)
NM = []
prev = 0
for i in range(1, int(math.sqrt(N)) + 2):
NM.append(N - next_max(i) - prev)
prev = (N - next_max(i))
@lru_cache(maxsize=None)
def rec(n, k):
if n <= 0:
return 0
if k <= 1:
return n
i = next_max(n)
p = NM[i] if i < len(NM) else 1
ret = rec(i, k - 1) * p % MOD
cum = rec(n - p, k)
return (cum + ret) % MOD
cnt = N
nums = []
while cnt >= 1:
nums.append(cnt)
i = next_max(cnt)
p = NM[i] if i < len(NM) else 1
cnt -= p
nums.reverse()
# dp[k][n]: rec(n, k)
dp = defaultdict(lambda: defaultdict(int))
for n in nums:
dp[1][n] = n
for k in range(2, K+1):
for n in nums:
i = next_max(n)
p = NM[i] if i < len(NM) else 1
ret = dp[k - 1][i] * p % MOD
cum = dp[k][n - p]
dp[k][n] = (cum + ret) % MOD
ans = dp[K][N]
print((ans % MOD))
# ans = rec(N, K)
# print(ans % MOD)
| import math
import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N, K = list(map(int, sys.stdin.readline().split()))
NM = []
prev = 0
for i in range(1, int(math.sqrt(N)) + 2):
m = int(N // i)
NM.append(N - m - prev)
prev = N - m
cnt = N
nums = []
while cnt >= 1:
nums.append(cnt)
i = int(N // cnt)
p = NM[i] if i < len(NM) else 1
cnt -= p
nums.reverse()
# dp[k][n]: rec(n, k)
dp = defaultdict(lambda: defaultdict(int))
for n in nums:
dp[1][n] = n
for k in range(2, K + 1):
for n in nums:
i = int(N // n)
p = NM[i] if i < len(NM) else 1
ret = dp[k - 1][i] * p % MOD
cum = dp[k][n - p]
dp[k][n] = (cum + ret) % MOD
ans = dp[K][N]
print((ans % MOD))
# ans = rec(N, K)
# print(ans % MOD)
| p02992 |
import math
import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N, K = list(map(int, sys.stdin.readline().split()))
NM = []
prev = 0
for i in range(1, int(math.sqrt(N)) + 2):
m = int(N // i)
NM.append(N - m - prev)
prev = N - m
cnt = N
nums = []
while cnt >= 1:
nums.append(cnt)
i = int(N // cnt)
p = NM[i] if i < len(NM) else 1
cnt -= p
nums.reverse()
# dp[k][n]: rec(n, k)
dp = defaultdict(lambda: defaultdict(int))
for n in nums:
dp[1][n] = n
for k in range(2, K + 1):
for n in nums:
i = int(N // n)
p = NM[i] if i < len(NM) else 1
ret = dp[k - 1][i] * p % MOD
cum = dp[k][n - p]
dp[k][n] = (cum + ret) % MOD
ans = dp[K][N]
print((ans % MOD))
# ans = rec(N, K)
# print(ans % MOD)
| import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N, K = list(map(int, sys.stdin.readline().split()))
# ある程度数をまとめられるのでまとめておく
nexts = []
n = N
while True:
p = int(N // (int(N // n) + 1))
nexts.append(n)
if p <= 0:
break
n = p
# dp[k][i]: i に続く k 文字のパターン数
dp = defaultdict(lambda: defaultdict(int))
prev = 0
for n, m in zip(nexts, reversed(nexts)):
dp[0][m] = m
for k in range(1, K):
dp[k][0] = 0
prev = 0
for n, m in zip(nexts, reversed(nexts)):
dp[k][m] = (dp[k][prev] + dp[k-1][n] * (m-prev)) % MOD
prev = m
print((dp[K - 1][N]))
| p02992 |
N,K = list(map(int, input().split()))
L = [N]
c = 2
while c < N**0.5:
if L[-1] != N//c:
L.append(N//c)
c += 1
if c > N**0.5:
c -= 1
L.append(c)
else:
L.append(c)
L.reverse()
dp = [[0 for j in range(c+len(L))] for i in range(K+1)]
for j in range(1, c+1):
dp[2][j] = N//j
for j in range(1, len(L)):
dp[2][j+c] = N//L[j]*(L[j]-L[j-1])
for i in range(2, K):
dp[i+1][-1] = dp[i][1]
for j in range(2, c+len(L)):
dp[i+1][c+len(L)-j] = dp[i+1][c+len(L)-j+1]+dp[i][j]
for j in range(1, len(L)):
dp[i+1][j+c] *= (L[j]-L[j-1])
print((sum(dp[K])%(10**9+7))) | N,K = list(map(int, input().split()))
L = [N]
c = 2
while c < N**0.5:
if L[-1] != N//c:
L.append(N//c)
c += 1
if c > N**0.5:
c -= 1
L.append(c)
else:
L.append(c)
L.reverse()
dp1 = [0 for _ in range(c+len(L))]
dp2 = [0 for _ in range(c+len(L))]
for j in range(1, c+1):
dp1[j] = N//j
for j in range(1, len(L)):
dp1[j+c] = N//L[j]*(L[j]-L[j-1])
for i in range(2, K):
if i%2 == 0:
dp2[-1] = dp1[1]
for j in range(2, c+len(L)):
dp2[c+len(L)-j] = dp2[c+len(L)-j+1]+dp1[j]
for j in range(1, len(L)):
dp2[j+c] *= (L[j]-L[j-1])
else:
dp1[-1] = dp2[1]
for j in range(2, c+len(L)):
dp1[c+len(L)-j] = dp1[c+len(L)-j+1]+dp2[j]
for j in range(1, len(L)):
dp1[j+c] *= (L[j]-L[j-1])
if K%2 == 0:
ans = sum(dp1)
else:
ans = sum(dp2)
print((ans%(10**9+7))) | p02992 |
N,K = list(map(int, input().split()))
L = [N]
for i in range(2, int(N**0.5)+1):
if L[-1] != N//i:
L.append(N//i)
c = int(N**0.5)+1
if c > N**0.5:
c -= 1
L.append(c)
else:
L.append(c)
L.reverse()
dp1 = [0 for _ in range(c+len(L))]
dp2 = [0 for _ in range(c+len(L))]
for j in range(1, c+1):
dp1[j] = N//j
for j in range(1, len(L)):
dp1[j+c] = N//L[j]*(L[j]-L[j-1])
for i in range(2, K):
if i%2 == 0:
dp2[-1] = dp1[1]
for j in range(2, c+len(L)):
dp2[c+len(L)-j] = dp2[c+len(L)-j+1]+dp1[j]
for j in range(1, len(L)):
dp2[j+c] *= (L[j]-L[j-1])
else:
dp1[-1] = dp2[1]
for j in range(2, c+len(L)):
dp1[c+len(L)-j] = dp1[c+len(L)-j+1]+dp2[j]
for j in range(1, len(L)):
dp1[j+c] *= (L[j]-L[j-1])
if K%2 == 0:
ans = sum(dp1)
else:
ans = sum(dp2)
print((ans%(10**9+7))) | from itertools import accumulate
N,K = list(map(int, input().split()))
mod = 10**9+7
sqt = int(N**0.5)
cnt = [N // i-N // (i+1) for i in range(1, N//sqt)] + [1]*sqt
x = cnt
for _ in range(K):
x = [(i*j)%mod for i, j in zip(accumulate(reversed(x)), cnt)]
print((x[-1])) | p02992 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.