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)... | 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[inde... | # 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[inde... | 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 :
... | 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 ... | 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(co... | 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,... | 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)
pri... | 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))
... | 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
... | 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
prin... | 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
... | 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_su... | #!/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):
... | 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:
... | 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:
... | 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.appe... | 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
... | 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) f... | 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 ra... | 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
... | 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 ==... | 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
... | 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... | 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
retur... | 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
... | 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 +... | 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):
... | 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 calcResu... | 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+=... | 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(cn... | 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 ?... | 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
e... | 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... | 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... | 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 = ( ... | 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 )
... | 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:
... | 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)... | 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):
... | 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)... | 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 /... | 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:
con... | 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]):
... | # 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(" ")))
... | 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
pri... | 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
pri... | 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... | 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
# ???... | # -*- 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 == ... | 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:... | 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:
... | 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:
... | 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(c... | 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:
... | #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 <=... | 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... | 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==... | 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,... | 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... | 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 ... | 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 ... | 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:
... | 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()... | 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))
... | 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_cop... | 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:
... | 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 ... | 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
... | 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 ... | 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 ... | 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... | # -*- 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(... | 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(... | # -*- 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(... | 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:
... | 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... | 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 = t... | 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:... | 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 rang... | 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 rang... | 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 l... | #素因数分解、計算量は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 l... | 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 l... | #素因数分解、計算量は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 -=... | 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... | 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... | 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
... | 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:
... | 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(... | 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 ... | 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 ... | 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 ... | 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):
... | 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):
... | 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 ... | 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 ran... | 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
mappin... | 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... | 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 r... | 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 r... | 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 r... | 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... | 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... | 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
... | 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 ran... | 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 ... | 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()))
... | 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... | 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... | 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
whi... | 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,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):
... | 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))]
... | 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.