input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from bisect import bisect, bisect_left
from collections import Counter
from functools import reduce
from itertools import accumulate
from operator import itemgetter, xor
import sys
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
class BIT:
def __init__(self, N):
... | # -*- coding: utf-8 -*-
from bisect import bisect, bisect_left
from collections import Counter
from functools import reduce
from itertools import accumulate
from operator import itemgetter, xor
import sys
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
class BIT:
def __... | p03033 |
# -*- coding: utf-8 -*-
from bisect import bisect, bisect_left
from collections import Counter
from functools import reduce
from itertools import accumulate
from operator import itemgetter, xor
import sys
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
class BIT:
def __... | # -*- coding: utf-8 -*-
from bisect import bisect, bisect_left
from collections import Counter
from functools import reduce
from itertools import accumulate
from operator import itemgetter, xor
import sys
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
class BIT:
def __... | p03033 |
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return list(map(int, input().split()))
###template###
N, Q = mi()
Events = []
#イベントを格納する配列
#各要素はタプルで、(s-x or t-x, 1or-1, x)が入っている
#意味は、「時間s-xもしくはt-xに出発する人が」「座標xで」
# 「1:通行止めにぶつかる -1:通行止めにぶつかりそうだったが、助かる」を表す
for _ in ran... | ###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return list(map(int, input().split()))
###template###
N, Q = mi()
Events = []
#イベントを格納する配列
#各要素はタプルで、(s-x or t-x, 1or-1, x)が入っている
#意味は、「時間s-xもしくはt-xに出発する人が」「座標xで」
# 「1:通行止めにぶつかる -1:通行止めにぶつかりそうだったが、助かる」を表す
for _ in ran... | p03033 |
import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
STX = []
D = []
D2 = []
ans = [0]*Q
timer = 0
m = 0
for _ in range(N):
stx = list(map(int, input().split()))
STX.append(stx)
if stx[2] > m:
m = stx[2]
for _ in range(Q):
ds = int(eval(input()))
D... | import sys
input = sys.stdin.readline
from bisect import bisect_left
N, Q = map(int, input().split())
W = [tuple(map(int, input().split())) for _ in range(N)]
W.sort(key=lambda x:x[2])
D = [int(input()) for _ in range(Q)]
ans = [-1]*Q
skip = [-1]*Q
for s, t, x in W:
l = bisect_left(D, s-x)
r = bisect... | p03033 |
import bisect
class DualSegmentTree():
def __init__(self, n):
INF = float("inf")
self.size = 1
while self.size < n:
self.size *= 2
self.node = [INF] * (2*self.size - 1)
def update(self, begin, end, val):
begin += (self.size - 1)
end +... | import sys
import bisect
class DualSegmentTree():
def __init__(self, n):
INF = float("inf")
self.size = 1
while self.size < n:
self.size *= 2
self.node = [INF] * (2*self.size - 1)
def update(self, begin, end, val):
begin += (self.size - 1)
... | p03033 |
from bisect import bisect,bisect_left
import sys
import itertools
input=sys.stdin.readline
def main():
n,q=list(map(int,input().split()))
xst=[]
for i in range(n):
s,t,x=list(map(int,input().split()))
xst.append([x,s,t])
xst.sort()
d=[None]*q
for i in range(q):
... | from bisect import bisect,bisect_left
import sys
input=sys.stdin.readline
def main():
n,q=list(map(int,input().split()))
xst=[]
for i in range(n):
s,t,x=list(map(int,input().split()))
xst.append([x,s-x,t-x])
xst.sort()
d=[None]*q
for i in range(q):
d[i]=int(... | p03033 |
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | p03033 |
from math import ceil, log2
import sys
class SegmentTree:
def __init__(self, length, init_value=None, aggfunc=min):
self.aggfunc = aggfunc
self.depth = ceil(log2(length))
self.data = [init_value] * (2 ** (1 + self.depth) - 1)
self.origin = 2 ** self.depth - 1
def up... | import sys
from bisect import bisect_left
input = sys.stdin.readline
n, q = list(map(int, input().split()))
stx = [tuple(map(int, input().split())) for _ in range(n)]
d = [int(eval(input())) for _ in range(q)]
stx.sort(key=lambda x: x[2])
ans = [-1] * q
jump = [-1] * q
for s, t, x in stx:
d_start = ... | p03033 |
import sys
from heapq import heappush, heappop
from collections import defaultdict
input = sys.stdin.readline
num, person = list(map(int, input().split()))
arr = []
for i in range(num):
s, t, x = list(map(int, input().split()))
arr.append((s - x - 0.5, 1, x, i))
arr.append((t - x - 0.5, -1, x, ... | import sys
from heapq import heappush, heappop
input = sys.stdin.readline
num, person = list(map(int, input().split()))
arr = []
for i in range(num):
s, t, x = list(map(int, input().split()))
arr.append((s - x - 0.5, 1, x, i))
arr.append((t - x - 0.5, 0, x, i))
for i in range(person):
d ... | p03033 |
import sys
from collections import deque, defaultdict
import copy
import bisect
#input=sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
N, Q = list(map(int, input().split()))
STX = [list(map(int, input().split())) for _ in range(N)]
# xの昇順に工事の区間をsort
STX = sorted(STX, key=lambda x: x[2])
D = [int(ev... | import sys
from collections import deque, defaultdict
import copy
import bisect
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
N, Q = list(map(int, input().split()))
STX=[]
D=[]
for i in range(N):
S, T, X = list(map(int, input().split()))
STX.append((X, S, T))
STX = sorted(STX, key=lamb... | p03033 |
import bisect
import heapq
import sys
N,Q = [int(x) for x in sys.stdin.readline().split()]
hitos = []
ans = [-1 for _ in range(Q)]
queries =[]
jump = ans[::]
queries = [[int(x) for x in sys.stdin.readline().split()] for i in range(N)]
hitos = [int(sys.stdin.readline()) for i in range(Q)]
# for i i... | import bisect
import heapq
import sys
N,Q = [int(x) for x in sys.stdin.readline().split()]
hitos = []
ans = [-1 for _ in range(Q)]
queries =[]
jump = ans[::]
queries = [[int(x) for x in sys.stdin.readline().split()] for i in range(N)]
hitos = [int(sys.stdin.readline()) for i in range(Q)]
# for i i... | p03033 |
import heapq
N,Q = list(map(int,input().split(" ")))
querys = []
START = 1
GOAL = 0
GO = 2
for _ in range(N):
s,t,x = (list(map(int,input().split(" "))))
s -=(x + 0.5)
t -= (x + 0.5)
querys.append( (s,START,x) )
querys.append( (t,GOAL,x) )
for _ in range(Q):
querys.append( (in... | import heapq
import sys
input=sys.stdin.readline
N,Q = list(map(int,input().split(" ")))
querys = []
START = 1
GOAL = 0
GO = 2
for _ in range(N):
s,t,x = (list(map(int,input().split(" "))))
s -=(x + 0.5)
t -= (x + 0.5)
querys.append( (s,START,x) )
querys.append( (t,GOAL,x) )
for ... | p03033 |
import sys
from collections import deque
from collections import defaultdict
import math
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n,q = list(map(int,input().split()))
x = []
for i in range(n):
x.append(list(map(int,input().split())))
x.sort(key = lambda x : x[2])
dd = []
zaa = []... | import sys
from collections import deque
from collections import defaultdict
import math
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n,q = list(map(int,input().split()))
x = []
for i in range(n):
x.append(list(map(int,input().split())))
x.sort(key = lambda x : x[2])
dd = []
zaa = []... | p03033 |
import sys
import bisect
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
STX_array = [list(map(int, input().split())) for _ in range(N)]
STX_array = sorted(STX_array, key=lambda x: x[2])
Q_array = [int(eval(input())) for _ in range(Q)]
index_array = [i for i in range(Q)]
ans_arra... | import sys
import bisect
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
STX_array = [list(map(int, input().split())) for _ in range(N)]
STX_array = sorted(STX_array, key=lambda x: x[2])
Q_array = [int(eval(input())) for _ in range(Q)]
index_array = [i for i in range(Q)]
ans_arra... | p03033 |
import bisect
class SegTree:
def __init__(self, n):
# supposed that n = 2**m
INF = 10 ** 12
self.n = n
self.val = [INF for _ in range(2 * n + 1)]
def _update(self, a, b, v, k, l, r):
if r <= a or b <= l:
return
if a <= l and r <= b:
... | import bisect
class SegTree:
def __init__(self, n):
# supposed that n = 2**m
INF = 10 ** 12
self.n = n
self.val = [INF] * (2 * n - 1)
def _update(self, a, b, v, k, l, r):
if r <= a or b <= l:
return
if a <= l and r <= b:
... | p03033 |
import bisect
class SegTree:
def __init__(self, n):
# supposed that n = 2**m
INF = 10 ** 12
self.n = n
self.val = [INF] * (2 * n - 1)
def _update(self, a, b, v, k, l, r):
if r <= a or b <= l:
return
if a <= l and r <= b:
... | import bisect
class SegTree:
def __init__(self, n):
# supposed that n = 2**m
self.n = n
self.val = [-1] * (2 * n - 1)
def _update(self, a, b, v, k, l, r):
if r <= a or b <= l:
return
if a <= l and r <= b:
self.val[k] = v
... | p03033 |
from bisect import bisect_right
n, q = list(map(int, input().split()))
stx = [list(map(int, input().split())) for _ in range(n)]
d = [int(eval(input())) for _ in range(q)]
INF = 10 ** 9 + 1
li = []
for s, t, x in stx:
li.append([s - x, 1, x])
li.append([t - x, -1, x])
li.sort()
x_st = set([INF... | from bisect import bisect_left
n, q = map(int, input().split())
stx = [list(map(int, input().split())) for _ in range(n)]
d = [int(input()) for _ in range(q)]
INF = 10 ** 9 + 1
stx.sort(key=lambda x: x[2])
nxt = [-1] * q
ans = [-1] * q
for s, t, x in stx:
l = bisect_left(d, s - x)
r = bisect... | p03033 |
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in in... | import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in sy... | p03033 |
# coding: utf-8
import re
import math
import fractions
import random
import heapq
import time
import sys
readline = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
self.ran... | # coding: utf-8
import re
import math
import fractions
import random
import heapq
import time
import sys
input = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
self.rank=[... | p03033 |
# coding: utf-8
import re
import math
import fractions
import random
import heapq
import time
import sys
input = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
self.rank=[... | # coding: utf-8
import re
import math
import fractions
import random
import heapq
import time
import sys
input = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
self.rank=[... | p03033 |
from heapq import heappush, heappop
n,q=map(int,input().split())
a=[]
for i in range(n):
s,t,x=map(int,input().split())
s-=x
t-=x
a.append([s,t,x])
a=sorted(a,reverse=True)
heap=[]
ans=[]
for i in range(q):
d=int(input())
while a and a[-1][0]<=d:
e=a.pop()
heappush(heap,(e[2],e[1]))
... | import sys
from heapq import heappush, heappop
n,q=map(int,input().split())
a=sorted(((s-x, t-x, x) for _ in range(n) for s, t, x in (map(int, sys.stdin.readline().split()),)), reverse=True)
heap=[]
ans=[]
for i in range(q):
d=int(input())
while a and a[-1][0]<=d:
e=a.pop()
heappush(heap,(e[2],e[1... | p03033 |
from collections import deque
def BinarySearch(x,array):
left=0
right=len(array)-1
while right-left>=0:
mid=(left+right)//2
if array[mid]==x:
return mid
elif array[mid]>x:
right=mid-1
else:
left=mid+1
return False
d... | from bisect import bisect_left
def main():
ConstNum,PersonNum=list(map(int,input().split()))
S=[]
T=[]
X=[]
for i in range(ConstNum):
s,t,x=list(map(int,input().split()))
S.append(s)
T.append(t)
X.append(x)
DepartureTime=[]
for i in range(Per... | p03033 |
from heapq import heappop, heappush
N, Q = map(int, input().split())
event_list = []
for i in range(N):
s, t, x = map(int, input().split())
event_list.append([s-x, 1, x])
event_list.append([t-x, -1, x])
for i in range(Q):
event_list.append([int(input()), 2, 0])
ans = []
event_list.sort()
x_set ... | import sys
from heapq import heappop, heappush
input = sys.stdin.readline
N, Q = map(int, input().split())
event_list = []
for i in range(N):
s, t, x = map(int, input().split())
event_list.append([s-x, 1, x])
event_list.append([t-x, -1, x])
for i in range(Q):
event_list.append([int(input()), 2, 0]... | p03033 |
import collections
def main():
N, Q = [int(x) for x in input().split()]
updates1 = []
updates2 = []
for i in range(N):
S, T, X = [int(x) for x in input().split()]
updates1.append((S-X, X))
updates2.append((T-X, X))
active = []
to_delete = collections.defaul... | import collections
def main():
inp = readnumbers()
ii = 0
N = inp[ii]
ii+=1
Q = inp[ii]
ii += 1
updates1 = []
updates2 = []
for i in range(N):
S = inp[ii]
ii += 1
T = inp[ii]
ii += 1
X = inp[ii]
ii += 1
... | p03033 |
from heapq import heappop,heappush
from collections import defaultdict
N,Q = list(map(int,input().split()))
event = []
for _ in range(N):
s,t,x = list(map(int,input().split()))
event.append((s-x,1,x))
event.append((t-x,2,x))
for i in range(Q):
d = int(eval(input()))
event.append((d,3,i))... | from heapq import heappop,heappush
from collections import defaultdict
N,Q = list(map(int,input().split()))
event = []
for _ in range(N):
s,t,x = list(map(int,input().split()))
event.append((s-x,1,x))
event.append((t-x,2,x))
for i in range(Q):
d = int(eval(input()))
event.append((d,3,i))... | p03033 |
import sys
from heapq import heappush, heappop
from operator import itemgetter
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
N, Q = map(int, rl().split())
events = []
for _ in range(N):
s, t, x = map(int, rl().split())
events.append((t - x, 0, x))
... | import sys
from operator import itemgetter
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_... | p03033 |
import sys
from operator import itemgetter
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
class SegmentTree:
def __init__(self, n: int, segfunc, ide_ele):
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segf... | import sys
from heapq import heappush, heappop
from operator import itemgetter
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
N, Q = map(int, rl().split())
events = []
for _ in range(N):
s, t, x = map(int, rl().split())
events.append((t - x, 0, x))
... | p03033 |
import sys
class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.seg=[self.ide_ele]*2*self.num
for i in range(n):
self.seg[i+self.num-1]=init_val[i]
... | import sys
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update( k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
def query():
p = b_num-1
q = n+b_num-2
res=mx... | p03033 |
import sys
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update( k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
def query():
p = b_num-1
q = n+b_num-2
res=mx... | import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update( k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
def query():
p = b_num-1
... | p03033 |
import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update( k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
def query():
p = b_num-1
... | import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update( k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
if __name__ == '__main__':
... | p03033 |
import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update(k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
if __name__ == '__main__':
... | import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update(k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
if __name__ == '__main__':
... | p03033 |
import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update(k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
if __name__ == '__main__':
xs = []
... | import sys
input = sys.stdin.readline
n,Q=list(map(int,input().split()))
b_num = 2**(n-1).bit_length()
mx = 10**9
segl=[mx]*2*b_num
def update(k, x):
k += b_num-1
segl[k] = x
while k+1:
k = (k-1)//2
segl[k] = min(segl[k*2+1],segl[k*2+2])
if __name__ == '__main__':
xs = []
... | p03033 |
import sys;input=sys.stdin.readline
N, Q = list(map(int, input().split()))
X = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
X.append((2*s-2*x-1, 0, x))
X.append((2*t-2*x-1, 1, x))
inf = 10**18
X.append((-inf, 0, inf))
X.append((inf, 1, inf))
X.sort(key=lambda x: x[0])
fro... |
from heapq import *
def main():
import sys;input=sys.stdin.readline
N, Q = list(map(int, input().split()))
X = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
X.append((2*s-2*x-1, 0, x))
X.append((2*t-2*x-1, 1, x))
inf = 10**18
X.append((-inf, ... | p03033 |
from bisect import bisect_left
inf = float('inf')
class SegmentTree:
def __init__(self, N):
tmp = 1
while tmp < N:
tmp <<= 1
self.N = tmp
self.data = [inf for _ in range(2*self.N-1)]
def update(self, l, r, x):
L = l + self.N
R = r + ... | import sys
input = sys.stdin.readline
from bisect import bisect_left
inf = float('inf')
N, Q = list(map(int,input().split()))
STX = [list(map(int,input().split())) for _ in range(N)]
D = [int(eval(input())) for _ in range(Q)]
res = 1
while res < Q:
res <<= 1
N0 = res
data = [inf for _ in range(2*N0-1... | p03033 |
from heapq import heappush, heappop
n, q = map(int, input().split())
STX = [list(map(int, input().split())) for _ in range(n)]
task = []
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(q):
d = int(input())
task.append((d, 2, i))
task.sort()
kouho =... | from heapq import heappush, heappop
import sys
input = sys.stdin.buffer.readline
n, q = map(int, input().split())
STX = [list(map(int, input().split())) for _ in range(n)]
task = []
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(q):
d = int(input())
... | p03033 |
#! /usr/bin/env python3
#! /usr/bin/env python3
import bisect
import sys
sys.setrecursionlimit(10**9)
# Ref: https://qiita.com/takayg1/items/b7b3f7d458915bcc7a4e
class LazySegTree:
def __init__(self, init_val, segfunc, ide_ele = 2**31 - 1):
n = len(init_val)
self.segfunc = segfunc
... | #! /usr/bin/env python3
import bisect
import sys
sys.setrecursionlimit(10**9)
# Ref: https://qiita.com/takayg1/items/b7b3f7d458915bcc7a4e
class LazySegTree:
def __init__(self, init_val, segfunc, ide_ele = 2**31 - 1):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_... | p03033 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 0 1 0 0
1 0 0 0 0
0 0 0 1 0
0 0 0 1 0
output:
4
"""
import sys
def solve():
dp = [[0] * W for _ in range(H)]
max_width = 0
for m in range(H):
for n in range(W):
dp[m][n] = (int(carpet_info[m][n]) + 1... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 0 1 0 0
1 0 0 0 0
0 0 0 1 0
0 0 0 1 0
output:
4
"""
import sys
def solve():
dp = [[0] * (W + 1) for _ in range(H + 1)]
for i in range(H):
for j in range(W):
if not int(carpet_info[i][j]):
... | p02326 |
import sys
h, w = list(map(int, sys.stdin.readline().split()))
dp = [[0 for j in range(w)] for i in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for i in range(h)]
maxWidth = 0
for i in range(0, h):
for j in range(0, w):
dp[i][j] = (G[i][j] + 1) % 2
maxWidth |= dp[i][j]
for... | import sys
h, w = list(map(int, sys.stdin.readline().split()))
dp = [[0] * w for _ in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for _ in range(h)]
for i in range(0, h):
for j in range(0, w):
dp[i][j] = (G[i][j] + 1) % 2
for i in range(1, h):
for j in range(1, w):
if(... | p02326 |
import sys
h, w = list(map(int, sys.stdin.readline().split()))
dp = [[0] * w for _ in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for _ in range(h)]
for i in range(0, h):
for j in range(0, w):
dp[i][j] = (G[i][j] + 1) % 2
for i in range(1, h):
for j in range(1, w):
if(... | import sys
h, w = list(map(int, sys.stdin.readline().split()))
dp = [[0] * w for _ in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for _ in range(h)]
for x in range(h):
dp[x][0] = 1 if G[x][0] == 0 else 0
for y in range(w):
dp[0][y] = 1 if G[0][y] == 0 else 0
for i in range(1, h):
... | p02326 |
import sys
import itertools
h, w = list(map(int, sys.stdin.readline().split()))
dp = [[0] * w for _ in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for _ in range(h)]
for x in range(h):
dp[x][0] = 1 if G[x][0] == 0 else 0
for y in range(w):
dp[0][y] = 1 if G[0][y] == 0 else 0
for i in ... | import sys
import itertools
h, w = list(map(int, sys.stdin.readline().split()))
dp = [[0] * w for _ in range(h)]
G = [[int(j) for j in sys.stdin.readline().split()] for _ in range(h)]
for x in range(h):
dp[x][0] = 1 if G[x][0] == 0 else 0
for y in range(w):
dp[0][y] = 1 if G[0][y] == 0 else 0
for i in ... | p02326 |
H, W = list(map(int, input().split()))
c = []
for i in range(H):
c.append([int(i) for i in input().split()])
dp = [[0 for i in range(W)] for i in range(H)]
maxwidth = 0
for i in range(H):
for j in range(W):
dp[i][j] = (c[i][j] + 1) % 2
maxwidth |= dp[i][j]
for i in range(1, H):
... | H, W = list(map(int, input().split()))
c = []
for i in range(H):
c.append([int(i) for i in input().split()])
dp = [[0 for i in range(W)] for i in range(H)]
maxwidth = 0
for i in range(H):
for j in range(W):
dp[i][j] = (c[i][j] + 1) % 2
maxwidth |= dp[i][j]
for i in range(1, H):... | p02326 |
def counting(k, v, square):
square += 1
for _ in range(square):
for r in range(k, k + square):
if r > len(matrix) - 1:
return False
for c in range(v, v + square):
if c > len(matrix[k]) - 1:
return False
... | def solve2():
r, c = list(map(int, input().split(' ')))
ans_matrix = [[0 for _ in range(c + 1)] for _ in range(r + 1)]
input_matrix = []
for _ in range(r):
input_matrix.append(list(map(int, input().split(' '))))
largest_square = 0
for i in range(len(input_matrix)):
... | p02326 |
# -*- coding: utf-8 -*-
result = 0
def dfs(num, dem, k, cur_num, p, q, a, n):
global result
#print num, dem, k, cur_num
#time.sleep(0.5)
if (num * q) == (dem * p):
result += 1
#print "result: " + str(result)
return
if k == n:
return
if (num * q... | # -*- coding: utf-8 -*-
def dfs(num, dem, k, cur_num, prd, p, q, a, n):
#print num, dem, k, cur_num, prd
#time.sleep(0.5)
if num == 0:
#print "result: " + str(result)
return 1
result = 0
i = cur_num
while prd * i <= a:
#print i, num, dem, k, cur_num, prd... | p00712 |
from functools import lru_cache
from fractions import Fraction
@lru_cache(maxsize=1<<10)
def solve(p, q, a, n):
def _solve(f, d, m, s):
if f == 0:
return 1
if d == 0:
return 0
if f < Fraction(1, a//m):
return 0
return sum((_solve(f-Fra... | from functools import lru_cache
@lru_cache(maxsize=1<<10)
def solve(p, q, a, n):
def _solve(num, dem, d, m, s):
if num == 0:
return 1
if d == 0:
return 0
if num * a // m < dem:
return 0
return sum((_solve(num*i-dem, dem*i, d-1, m*i, i)
... | p00712 |
r ,d, x = list(map(int,input().split()))
xi = 0
for i in range(10):
if i ==0:
xi = r * x - d
else:
xi = r * xi - d
print(xi)
| r ,d, x = list(map(int,input().split()))
for i in range(10):
x = r * x - d
print(x)
| p03036 |
r, d, x = list(map(int, input().split()))
for i in range(10):
x= r*x -d
print(x) | r, d, x = list(map(int, input().split()))
for _ in range(10):
x= r*x -d
print(x)
| p03036 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
r, D, x = list(map(int, input().split()))
for _ in range(10):
x = r * x - D
print(x)
| r, d, x = list(map(int, input().strip().split()))
for i in range(10):
x = r * x - d
print(x)
| p03036 |
#!/usr/bin/env python3
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
# Failed to predict input format
r,d,x = list(map(int, input().split()))
for i in range(10):
... | #!/usr/bin/env python3
def main():
r, D, x2000 = list(map(int, input().split()))
x = x2000
for i in range(1,11):
x = r*x-D
print(x)
if __name__ == '__main__':
main()
| p03036 |
r, D, x_2000 = list(map(int, input().split()))
x = x_2000
for i in range(10):
x = r * x - D
print(x) | r, D, x = list(map(int, input().split()))
for i in range(10):
x = r * x - D
print(x) | p03036 |
r,d,x = list(map(int,input().split()))
for i in range(10):
temp = r*x - d
print(temp)
x = temp | r,d,x=list(map(int,input().split()))
for i in range(10):x=r*x-d;print(x) | p03036 |
R_up, Down, First_number = list(map(int, input().split()))
Tmp_number = First_number
for _ in range(10):
Tmp_number = R_up*Tmp_number-Down
print(Tmp_number) | #B
r, D, x = list(map(int, input().split()))
for i in range(10):
xnew = r*x - D
print(xnew)
x = xnew | p03036 |
r, d, x = list(map(int, input().split()))
tmp = x
for i in range(10):
ans = r * tmp - d
print(ans)
tmp = ans | r, D, x = list(map(int, input().split()))
for i in range(10):
ans = r * x - D
print(ans)
x = ans | p03036 |
r, D, x_2000 = list(map(int, input().split()))
def x(i):
if i == 2000:
return x_2000
elif i >= 2001:
return r * x(i - 1) - D
for i in range(2001, 2011):
print((x(i))) | r, D, x2000 = list(map(int, input().split()))
x = [x2000]
for i in range(10):
x.append(x[i] * r - D)
print((x[i+1])) | p03036 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | p01095 |
import sys
N = int(sys.stdin.readline().strip())
def factorization(n):
arr = []
temp = n
# sqrtまで
for i in range(2, int(-(-n**0.5 // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
ar... | import sys
N = int(sys.stdin.readline())
mod = 10**9 + 7
values = [i for i in range(N+1)]
factors = {}
exists = set()
for i in range(2, N+1):
if i not in factors:
factors[i] = 0
for j in range(i, N+1, i):
tmp = values[j]
while tmp % i == 0:
factors[i] += 1
... | p03830 |
#!/usr/bin/env python3
n = int(eval(input()))
def count(x):
c = 0
t = n
while t:
c += t//x
t //= x
return c +1
prime = [2]
limit = int(n**0.5)
ans = count(2)
if n < 3:
print(ans)
exit()
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if li... | #!/usr/bin/env python3
n = int(eval(input()))
def count(x):
c = 0
t = n
while t:
c += t//x
t //= x
return c +1
limit = int(n**0.5)
ans = count(2)
if n < 3:
print(ans)
exit()
data = [i + 1 for i in range(2, n, 2)]
while data:
p = data[0]
ans *= count(p)
... | p03830 |
import math
import collections
def primes(n):
a = list(range(2, n+1))
primes = [2]
for i in a:
flag = True
m = math.sqrt(i)
for j in primes:
if j > m:
break
else:
if i % j == 0:
flag = False
... | import math
import collections
# 0以上整数x「未満」の素数をリストに格納して返す
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0 # 1は素数ではない
# エラトステネスのふるい
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in ran... | p03830 |
from collections import defaultdict
MOD = 1000000007
def prime_generator(limit):
yield 2
n, h = 3, {}
while n <= limit:
m = n
if n in h:
b = h[n]
m += 2 * b
while m in h:
m += 2 * b
h[m] = b
del h[... | from collections import defaultdict
MOD = 1000000007
def prime_generator(limit):
yield 2
n, h = 3, {}
while n <= limit:
m = n
if n in h:
b = h[n]
m += 2 * b
while m in h:
m += 2 * b
h[m] = b
del h[... | p03830 |
N = int(eval(input()))
m = pow(10,9)+7
A = [1]*(N+1)
for n in range(2,N+1):
k = n
for i in range(2,n+1):
if k%i==0:
while k>1:
k//=i
A[i]+=1
if k%i!=0:break
ans = 1
for a in A:ans*=a
print((ans%m)) | N = int(eval(input()))
mod = pow(10,9)+7
A = [1]*(N+1)
for i in range(1,N+1):
n = i
for j in range(2,i+1):
if j>n:break
while n%j==0:
A[j]+=1
n//=j
cnt = 1
for i in range(N+1):
cnt *= A[i]
print((cnt%mod)) | p03830 |
from math import factorial
n = int(eval(input()))
m = factorial(n)
s = 2
ans = 1
while m != 1:
c = 1
while m % s == 0:
c += 1
m = m // s
ans *= c
s += 1
print((ans % (10**9+7))) | from math import factorial
n = int(eval(input()))
m = factorial(n)
s = 2
ans = 1
while m > 1:
c = 1
while m % s == 0:
c += 1
m = m // s
ans *= c
s += 1
print((ans % (10**9+7))) | p03830 |
n = int(eval(input()))
l = [1,2,4,8,16,30,60,96,160,270,540,792,1584,2592,4032,5376,10752,14688,29376,41040,60800,96000,192000,242880,340032,532224,677376,917280,1834560,2332800,4665600,5529600,7864320,12165120,16422912,19595520,39191040,60466176,85100544,102435840,204871680,258048000,516096000,677376000,819624960,258... | l = [0,1,2,4,8,16,30,60,96,160,270,540,792,1584,2592,4032,5376,10752,14688,29376,41040,60800,96000,192000,242880,340032,532224,677376,917280,1834560,2332800,4665600,5529600,7864320,12165120,16422912,19595520,39191040,60466176,85100544,102435840,204871680,258048000,516096000,677376000,819624960,258709753,517419506,87667... | p03830 |
MOD = 10 ** 9 + 7
n = int(eval(input()))
res = 1
ex = [0 for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(2, i + 1):
if i % j == 0:
while i % j == 0:
ex[j] += 1
i //= j
ans = 1
for i in range(n + 1):
ans *= (ex[i] + 1)
ans %... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def prime_factorization(n):
res = []
for i in range(2, int(pow(n, 0.5)) + 1):
if n % i == 0:
ex = 0
while n % i == 0:
ex += 1
... | p03830 |
a = [True] * 1001
a[0] = False
a[1] = False
b = []
c = {}
for i in range(2, 1001):
if a[i]:
b.append(i)
for j in range(2, 1001, 2):
a[j] = False
d = int(eval(input()))
for j in range(2, d + 1):
temp_j = j
for i in b:
while True:
if temp_j % i !=... | z = int(eval(input()))
a = [True] * 1001
a[0] = False
a[1] = False
b = []
for i in range(2, 1001):
if a[i]:
b.append(i)
for j in range(i, 1001, i):
a[j] = False
c = {}
for i in range(1, z + 1):
d = i
while True:
if d == 1:
break
else:
... | p03830 |
import collections
def e(N):
res = []
x = N
y = 2
while y*y <= x:
while x % y == 0:
res.append(y)
x //= y
y += 1
if x > 1:
res.append(x)
return res
MOD = 10**9 + 7
n = int(eval(input()))
chk = [0 for i in range(n+1)]
for i in range(... | MOD = 10**9 + 7
n = int(eval(input()))
chk = [0 for i in range(n+1)]
for i in range(2, n+1):
y = 2
while y*y <= i:
while i % y == 0:
chk[y] += 1
i //= y
y += 1
if i > 1:
chk[i] += 1
ans = 1
for i in chk:
if i:
ans = ans*(i + 1)%MOD... | p03830 |
n=int(eval(input()));a=1;r=range
for x in[i for i in r(2,n+1)if all(i%j for j in r(2,i))]:a*=sum(n//x**i for i in r(1,11))+1
print((a%(10**9+7))) | n=int(eval(input()));a=1;r=range
for x in[i for i in r(2,n+1)if all(i%j for j in r(2,int(i**.5)+1))]:a*=sum(n//x**i for i in r(1,11))+1;a%=10**9+7
print(a) | p03830 |
import math
N = int(eval(input()))
ans=1
x = math.factorial(N)
for i in range(1, x//2+1):
if x%i == 0:
ans += 1
print((ans%(10**9+7))) | import math
N = int(eval(input()))
x = math.factorial(N)
ans = 1
i = 2
while i <= x:
cnt = 1
while x%i == 0:
x //= i
cnt += 1
ans *= cnt
i += 1
print((ans%(10**9+7))) | p03830 |
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
import math
N ... | N= int(eval(input()))
m = 10**9+7
pri_num = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, ... | p03830 |
N= int(eval(input()))
m = 10**9+7
pri_num = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, ... | def prime_number(n):
lis= []
for i in range(2,n+1):
j = 2
flag = 0
while j*j <= i:
if i%j ==0:
flag = 1
break
else:
j +=1
if flag ==0:
lis.append(i)
return lis
N=... | p03830 |
import math
mod = 10 ** 9 + 7
def f(num):
i = 2
d = dict()
while i * i <= num:
if num % i == 0:
num //= i
d[i] = d.get(i, 0) + 1
else:
i += 1
d[num] = 1
return d
n = int(eval(input()))
if n == 1:
print((1))
exit()
... | import math
mod = 10 ** 9 + 7
def f(num):
i = 2
d = dict()
while i ** 2 <= num:
if num % i == 0:
num //= i
d[i] = d.get(i, 0) + 1
else:
i += 1
d[num] = 1
return d
n = int(eval(input()))
if n == 1:
print((1))
exit()
... | p03830 |
from math import factorial
N = factorial(int(eval(input())))
i = 2
ans = dict()
n = N
while i*i <= N:
while n%i ==0:
n = n//i
if i in ans:
ans[i] += 1
else:
ans[i] = 1
i += 1
if n != 1:
ans[n] = 1
cnt = 1
for value in list(ans.values()):
... | from math import factorial
N = factorial(int(eval(input())))
mod = 10**9 + 7
ans = 1
i = 2
while i*i <= N:
cnt = 1
while N%i == 0:
cnt += 1
N //= i
ans *= cnt
i += 1
if N != 1:
ans *= 2
print((int(ans%mod)))
| p03830 |
n=int(eval(input()))
k=1
ans=0
for i in range (n):
k=k*(i+1)
for j in range(k):
if k%(j+1)==0:
ans+=1
print((ans%1000000007))
| n=int(eval(input()))
l=[k for k in range(1,n+1)]
phrase=[]
ans=1
a=1
def prime(x):
i=2
while i*i<=x:
if x%i==0:
return False
i+=1
return True
for i in range(2,n+1):
if prime(i):
phrase.append(i)
for j in phrase:
for m in range(n):
while l[... | p03830 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
MOD = 10 ** 9 + 7
factorial = [0] * (n+1)
factorial[0] = 1
for i in range(1, n+1):
factorial[i] = factorial[i-1] * i
prime_factors = []
target = factorial[n]
i = 2
while i ** 2 <= target:
if target % i... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
MOD = 10 ** 9 + 7
factorial = [0] * (n+1)
factorial[0] = 1
for i in range(1, n+1):
factorial[i] = (factorial[i-1] * i)
n = factorial[n]
prime_factors = []
i = 2
while i ** 2 <= n:
ext = 0
while n ... | p03830 |
import math
import collections
N = int(eval(input()))
a = math.factorial(N)
b = []
while a % 2 == 0:
b.append(2)
a//=2
f = 3
while f*f <= a:
if a % f ==0:
b.append(f)
a //= f
else:
f += 2
if a != 1:
b.append(a)
c = collections.Counter(b)
ans = 1
for j,k... | import math
N=math.factorial(int(eval(input())))
i=2
ans=1
M=10**9+7
while i*i<=N:
cnt=1
while N%i==0:
cnt+=1
N//=i
ans*=cnt
i+=1
if N!=1:ans*=2
print((int(ans%M))) | p03830 |
L = list(input().split())
val = 0
for i in range(len(L)-1):
if L[i][-1] != L[i+1][0]:
print("NO")
quit()
print("YES")
| L = list(input().split())
val = 0
for i in range(len(L)-1):
if L[i][-1] != L[i+1][0]:
print("NO")
break
else:
print("YES")
| p03729 |
a,b,c = input().split()
print(('YES' if a[-1]==b[0] and b[-1]==c[0] else 'NO'))
| a,b,c=list(map(str,input().split()))
print(('YES' if a[-1]==b[0] and b[-1]==c[0] else 'NO')) | p03729 |
A,B,C=input().split()
print(("YES" if A[-1]==B[0]and B[-1]==C[0] else "NO")) | A, B, C = input().split()
if A[-1] == B[0] and B[-1] == C[0]:
print("YES")
else:
print("NO") | p03729 |
s = input().split()
a, b, c = s[0], s[1], s[2]
if b.startswith(a[-1:]) and c.startswith(b[-1:]):
print("YES")
else:
print("NO") | a, b, c = input().split()
if a[-1:] == b[:1] and b[-1:] == c[:1]:
print("YES")
else:
print("NO") | p03729 |
a, b, c = input().split()
if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:
print("YES")
else:
print("NO") | a, b, c = input().split()
print(("YES" if a[-1] == b[0] and b[-1] == c[0] else "NO")) | p03729 |
a,b,c=input().split()
print(("YES" if a[-1]==b[0] and b[-1]==c[0] else "NO")) | A, B, C = input().split()
print(("YES" if A[-1] == B[0] and B[-1] == C[0] else "NO")) | p03729 |
A, B, C = input().split()
if A[-1] == B[0] and B[-1] == C[0]:
print('YES')
else:
print('NO')
| A, B, C = input().split()
def answer(A: int, B: int, C: int) -> str:
if A[-1] == B[0] and B[-1] == C[0]:
return 'YES'
else:
return 'NO'
print((answer(A, B, C)))
| p03729 |
a,b,c = input().split(' ')
print(('YES' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'NO')) | a,b,c = input().split(' ')
print(('YES' if a[-1] == b[0] and b[-1] == c[0] else 'NO')) | p03729 |
a,b,c=input().split();print(('YNEOS'[a[::-1][0]!=b[0]or b[::-1][0]!=c[0]::2])) | a,b,c=input().split();print(('YNEOS'[a[-1]!=b[0]or b[-1]!=c[0]::2])) | p03729 |
a, b, c = input().split()
if a[-1] == b[0] and b[-1] == c[0]:
print("YES")
else:
print("NO") | a, b, c = list(map(str, input().split()))
print(("YES" if a[-1] == b[0] and b[-1] == c[0] else "NO")) | p03729 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
1000000
output:
400000
"""
import sys
import math
def is_prime(n):
if n == 2:
return True
elif n < 2 or not n % 2:
return False
k = 3
while k <= math.sqrt(n):
if not n % k:
return F... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
1000000
output:
400000
"""
import sys
def soi(n):
k = 2
while True:
if pow(k, 2) > n:
return n
if n % k == 0:
return k
k += 1
def phi(n):
ans = n
while True:
... | p02470 |
n=m=int(eval(input()))
i=2
while i<=n and m!=1:
if m%i==0:
n=n*(i-1)//i
while m%i==0: m//=i
i+=1
print(n) | n=m=int(eval(input()))
i=2
while i*i<=n:
if n%i==0:
m=m//i*(i-1)
while n%i==0: n//=i
i+=1
if n!=1:m=m//n*(n-1)
print(m) | p02470 |
a=int(eval(input()))
li=[0]*10000000
count=1
i=2 # ??????????????°
while i<a:
r=0
ta=a
b=i
if li[i]!=1:
while True:
r=ta%b
if r==0:
break
ta=b
b=r
if b==1:
count+=1
... | def soi(n): #?´??????°????§£?????¢?????´?????????
i=2
while True:
if i*i>n:
return n
if n%i==0:
return i
i+=1
a=int(eval(input()))
ans=a
count=1
i=2 # ??????????????°
while True:
temp=soi(a)
if a==1: #?´??????°??????????????°
... | p02470 |
f=lambda x:p*(x-1)//x
p=n=int(eval(input()))
d=2
while d*d<=n:
if n%d==0:
p=f(d)
while n%d==0:n//=d
d+=1
if n>1:p=f(n)
print(p)
| p=n=int(eval(input()))
d=2
while d*d<=n:
if n%d==0:
p=p*(d-1)//d
while n%d==0:n//=d
d+=1
print(([p,p*(n-1)//n][n>1]))
| p02470 |
import sys
def gcd(a,b):
if(b == 0):
return a
else:
c = b
b = a%b
a = c
return(gcd(a,b))
x = int(eval(input()))
count = 0
for y in range(1,x+1):
if gcd(x,y) == 1:
count+=1
print(count) | import sys
def euler(a):
i = 2
res = a
#standard = a
while i * i <= a:
if a % i == 0:
res = res - res//i
while a % i == 0:
a //= i
i += 1
if a != 1:
res = res - res//a
return res
x = int(eval(input()))
pri... | p02470 |
input = int(eval(input()))
buf = input
result = 1
for i in range(2,input+1):
if buf%i==0:
result *= (1 - 1/i)
while buf%i==0:
buf /= i
result *= input
print((int(result))) | def phi(n):
r = n
i = 2
while i*i <= n:
if n%i==0:
r -= r/i
while n%i==0:
n /= i
i += 1
if n>1: r-= r/n
return r
n = int(eval(input()))
print((int(phi(n)))) | p02470 |
while 1:
n,m = list(map(int,input().split()))
if n == 0: break
EBY = [input().split() for i in range(n)]
EBY = [[e,int(b),int(y)] for e,b,y in EBY]
for i in range(m):
year = int(input())
for j in range(n):
if EBY[j][2]-EBY[j][1] < year <= EBY[j][2]:
print(EBY[j][0], year-EBY[j][2]+EBY[j][1])
... | while 1:
n,m = list(map(int,input().split()))
if n == 0: break
EBY = [input().split() for i in range(n)]
EBY = [[e,int(y)-int(b),int(y)] for e,b,y in EBY]
for i in range(m):
year = int(input())
for j in range(n):
if EBY[j][1] < year <= EBY[j][2]:
print(EBY[j][0], year-EBY[j][1])
break
e... | p01359 |
from math import floor,ceil
def f(b,n):
if n < b:
return n
else:
return f(b,floor(n/b))+n%b
n = int(eval(input()))
s = int(eval(input()))
for b in range(2,320000):
if f(b,n)==s:
print(b)
exit()
if n==s:
print((s+1))
exit()
d = {}
for i in range(1... | def f(b,n):
if n < b:
return n
else:
return f(b,n//b)+n%b
def get_divisor(n):
res = []
for i in range(1,int(n**0.5)+1):
if n%i==0:
res.append(i)
res.append(n//i)
res = list(set(res))
res.sort()
return res
n = int(eval(input())... | p04014 |
N = int(eval(input()))
S = int(eval(input()))
def f(b,n):
if n//b==0:
return n
else:
return n%b + f(b,n//b)
ans = -1
if S==N:
ans = N+1
else:
for b in range(2,int(N**.5)+1):
if f(b,N)==S:
ans = b
break
if ans == -1:
for i in range... | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
N = int(eval(input()))
S = int(eval(input()))
def f(b,n):
if n < b:
return n
else:
return f(b, n//b) + n%b
ans = -1
if S==N:
ans = N+1
else:
# bをN^(1/2)まで全探索
for b in range(2, int(N**.5)+1):
... | p04014 |
import math
import sys
n = int(eval(input()))
s = int(eval(input()))
def f(b, n):
if n == 0:
return 0
return f(b, n//b) + n % b
if s > n:
print((-1))
sys.exit(0)
sn = math.ceil(math.sqrt(n))
for i in range(2, sn+1):
if f(i, n) == s:
print(i)
sys.exit(0)... | import sys
n = int(eval(input()))
s = int(eval(input()))
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n % b
if s == n:
print((n+1))
sys.exit(0)
if n < s:
print((-1))
sys.exit(0)
ans = None
for i in range(2, n):
if i * i > n:
brea... | p04014 |
n = int(eval(input()))
s = int(eval(input()))
if s == 1 and n == 1:
print((2))
exit()
if s > n:
print((-1))
exit()
if n%2 == 0 and n > s > n//2:
print((-1))
exit()
if n%2 == 1 and n > s > n//2+1:
print((-1))
exit()
ans = float("INF")
for i in range(2,int(n**0.5)+1):
... | n = int(eval(input()))
s = int(eval(input()))
if s == n:
print((n+1))
exit()
if s > n%2+n//2:
print((-1))
exit()
ans = float("INF")
for i in range(2,int(n**0.5)+1):
x = n
count = 0
while x >= i:
count += x%i
x //= i
if count + x == s:
print... | p04014 |
import math
import os
import sys
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, S = [int(sys.stdin.readline()) for _ in range(2)]
@lru_cache(maxsize=None)
def f(b,... | import math
import os
import sys
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, S = [int(sys.stdin.readline()) for _ in range(2)]
@lru_cache(maxsize=None)
def f(b,... | p04014 |
import math
n = int(eval(input()))
s = int(eval(input()))
def c(b):
cur = n
acc = 0
while cur != 0:
div, mod = divmod(cur, b)
acc += mod
cur = div
return acc
def f():
if n == s:
return (n + 1)
if n < s:
return -1
rt = math.ceil(math... | import math
n = int(eval(input()))
s = int(eval(input()))
def c(b):
cur = n
acc = 0
while cur != 0:
div, mod = divmod(cur, b)
acc += mod
cur = div
return acc
def g(b):
if b > n: return n
return sum(divmod(n,b))
def f():
if n == s:
return ... | p04014 |
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p04014 |
from math import floor, sqrt
INF = 10 ** 20
def f(b, n):
if n < b:
return n
else:
return f(b, n // b) + (n % b)
def main():
n = int(eval(input()))
s = int(eval(input()))
ans = INF
# 1桁
if n == s:
ans = min(ans, n + 1)
# 2桁
for p in r... | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
... | p04014 |
n=int(eval(input()))
s=int(eval(input()))
if s>n:
print((-1))
elif s==n:
print((n+1))
else:
# 2<=b<=n**0.5 で全探索
for b in range(2,int(n**0.5)+1):
tmp=0
n0=n
while n0>0:
tmp+=n0%b
n0//=b
if tmp==s:
print(b)
exit()
# n**0.5<bについて
for p in range(int(n**0... | n=int(eval(input()))
s=int(eval(input()))
if s>n:
print((-1))
elif s==n:
print((n+1))
else:
# 2<=b<=n**0.5 で全探索
for b in range(2,int(n**0.5)+1):
tmp=0
n0=n
while n0>0:
tmp+=n0%b
n0//=b
if tmp==s:
print(b)
exit()
# n**0.5<bについて
for p in range(int(n**0... | p04014 |
import math
n = int(eval(input()))
s = int(eval(input()))
r = 0
if n == s:
print((n + 1))
exit()
elif n < s:
print((-1))
exit()
nn = int(math.sqrt(n)) + 1
for i in range(2, nn):
nt = n
st = 0
while nt > 0:
st += nt % i
nt //= i
if st == s:
... | import math
n = int(eval(input()))
s = int(eval(input()))
r = 0
if n == s:
print((n + 1))
exit()
elif n < s:
print((-1))
exit()
sq = int(math.sqrt(n))
# 2 <= d <= √n
for i in range(2, sq+1):
nt = n
st = 0
while nt > 0:
st += nt % i
nt //= i
... | p04014 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.