input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
if n==k:
print((1))
exit()
i=n-k
ans=1
while i>0:
i=i-k+1
ans+=1
print(ans) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
print((-(-(n-k)//(k-1))+1))
| p03317 |
import math
N, K = list([int(k) for k in input().split(" ")])
A = list([int(a) for a in input().split(" ")])
pos_of_1 = A.index(1)
if K >= pos_of_1 + 1 or N - K <= pos_of_1:
print((math.ceil((N - K) / (K - 1)) + 1))
else:
L = A[:pos_of_1 + 1]
R = A[pos_of_1:]
res = []
for i in range(1, K):
... | import math
N, K = list([int(k) for k in input().split(" ")])
A = list([int(a) for a in input().split(" ")])
print((math.ceil((N - K) / (K - 1)) + 1)) | p03317 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
print((-(-(N-1)//(K-1)))) | N,K = list(map(int,input().split()))
print((-((1-N)//(K-1)))) | p03317 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print((-((1-n)//(k-1)))) | print((eval("-(-~-"+input().replace(" ","//~-")+")"))) | p03317 |
import math
N, K = list(map(int, input().split()))
def main():
print((math.ceil((N - 1) / (K - 1))))
return
main()
| def main():
N, K = list(map(int, input().split()))
print((-(-(N - 1) // (K - 1))))
return
main()
| p03317 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
if (n-k)%(k-1) == 0:
print(((n-k)//(k-1)+1))
else:
print(((n-k)//(k-1)+2)) | n,k = list(map(int, input().split()))
if (n-k)%(k-1) == 0:
print(((n-k)//(k-1)+1))
else:
print(((n-k)//(k-1)+2)) | p03317 |
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
print((math.ceil((N - 1) / (K - 1))))
| N, K = list(map(int, input().split()))
print((-(-(N - 1) // (K - 1)))) | p03317 |
import math
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
i_1 = a.index(1)
ans = 9999999999
# left = len(a[:i_1])
# right len(a[i_1+1:)
# if left < k or right <k:
# c = math.ce
for i in range(1,k+1):
count = 1
left = i_1-(k-i)
right = i_1+i
if left ... | import math
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
i_1 = a.index(1)
ans = 9999999999
left = len(a[:i_1])
right = len(a[i_1:])
for i in range(k):
x = left - i
y = right - (k-i)
if x < 0 or y < 0:
continue
count = 1 + math.ceil(x/(k... | p03317 |
# AtCoder Beginner Contest 101
# C - Minimization
N, K = [int(i) for i in input().split()]
A = input().split()
print((-(-(N-1) // (K-1)))) | # AtCoder Beginner Contest 101
# C - Minimization
N, K = [int(i) for i in input().split()]
# A = input().split()
print((-(-(N-1) // (K-1)))) | p03317 |
import sys
import math
def main():
"""
2 <= K <= N <= 10^5
1 <= ai <= N
1 <= i <= N
"""
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
ans = f_K(N, K, A)
#ans = editorial(N, K, A)
print(ans)
def test_examples():
nka_ans = ... | import sys
import math
def main():
"""
2 <= K <= N <= 10^5
1 <= ai <= N
1 <= i <= N
"""
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
#ans = f_K(N, K, A)
ans = editorial(N, K, A)
print(ans)
def test_examples():
nka_ans = ... | p03317 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
print(((N-2)//(K-1)+1)) | N, K = list(map(int,input().split()))
print(((N-2)//(K-1)+1)) | p03317 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = ((N - 1) + (K - 1 - 1)) // (K - 1)
print(ans)
| N, K = list(map(int, input().split()))
ans = 1 + ((N - K) + (K - 2)) // (K - 1)
print(ans)
| p03317 |
from collections import Counter
from math import *
N, K = [int(x) for x in input().strip().split()]
A = [int(x) for x in input().strip().split()]
A.sort()
c = Counter(A)
minc = c[A[0]]
res = len(A) - minc
print((ceil(res/(K-1)))) | from math import *
N, K = [int(x) for x in input().strip().split()]
print((ceil((N-1)/(K-1)))) | p03317 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
a,b=... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,k=... | p03317 |
mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
_NUMINT_ALL = list(range(10))
def main():
ans = solve()
if ans is True or ans is False:
YesNo(ans)
elif ans is not None:
print(ans)
... | mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
_NUMINT_ALL = list(range(10))
def main():
ans = solve()
if ans is True or ans is False:
YesNo(ans)
elif ans is not None:
print(ans)
... | p03317 |
N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
Left = A.index(1)
Right = (N-1)-Left
Count = (Right%(K-1)!=0)+Right//(K-1)
Left -= (Right%(K-1)!=0)*((K-1)-Right%(K-1))
Count += (Left%(K-1)!=0)+Left//(K-1)
print(Count) | N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
Left = A.index(1)
Right = (N-1)-Left
Count = (Right%(K-1)!=0)+Right//(K-1)
Left -= ((K-1)-Right%(K-1))%(K-1)
Count += (Left%(K-1)!=0)+Left//(K-1)
print(Count) | p03317 |
n,k = list(map(int,input().split()))
a_ = list(map(int,input().split()))
if (n-1)%(k-1) == 0:
print(((n-1)//(k-1)))
else:
print(((n-1)//(k-1)+1)) | n,k = list(map(int,input().split()))
A = n-1
B = k-1
print(((A+(B-1))//B)) | p03317 |
import sys
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort()
start = 0
end = k
count = 0
for i in range(n):
if all(x==1 for x in a):
print(count)
sys.exit()
a[start:end] = [1]*k
start += (k-1)
end += (k-1)
count += 1 | import sys
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort()
start = 0
end = k
count = 0
for i in range(n):
if a[n-1]==1:
print(count)
sys.exit()
a[start:end] = [1]*k
start += (k-1)
end += (k-1)
count += 1 | p03317 |
def read_input():
D = int(eval(input()))
C = input().split()
C = [int(i) for i in C]
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(eval(input())) for _ in range(D)]
return D, C, S, T
def scoring(S, D, T, C):
res = []
last = [0 for _ in range(26)]
fi... | def read_input():
D = int(eval(input()))
C = input().split()
C = [int(i) for i in C]
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(eval(input())) for _ in range(D)]
return D, C, S, T
def scoring(S, D, T, C):
res = []
last = [0 for _ in range(26)]
fina... | p02619 |
D = int(eval(input()))
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
t = [int(eval(input())) for _ in range(D)]
last = [0 for _ in range(26)]
value = 0
for i in range(D):
day = i + 1
value += s[i][t[i]-1]
last[t[i]-1] = day
for j in range(26):
val... | D = int(eval(input()))
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
t = [int(eval(input())) for _ in range(D)]
def calc(D, s, t):
last = [0 for _ in range(26)]
value = 0
for i in range(D):
day = i + 1
value += s[i][t[i]-1]
last[t[i]-1] = da... | p02619 |
D = int(eval(input()))
c = [int(i) for i in input().split()]
s = [[int(i) for i in input().split()] for _ in range(D)]
t = [int(eval(input()))-1 for _ in range(D)]
ans = 0
llst = [0]*26
def last(d,i): return llst[i]
for day,i in enumerate(list(range(D)),1):
llst[t[i]] = day
ans += s[i][t[i]]
for... | D = int(eval(input()))
c = [int(i) for i in input().split()]
s = [[int(i) for i in input().split()] for _ in range(D)]
t = [int(eval(input()))-1 for _ in range(D)]
ans = 0
llst = [0]*26
for day,i in enumerate(list(range(D)),1):
llst[t[i]] = day
ans += s[i][t[i]]
for j in range(26): ans -= c[j]*(d... | p02619 |
import bisect
import random
import sys
input = sys.stdin.readline
class score:
def __init__(self, t):
self.t = t
def first_score(self):
last = [0]*26
score = 0
for i,ti in enumerate(self.t):
score += S[i][ti - 1]
last[ti-1] = i + 1
... | from bisect import bisect_left
class score:
def __init__(self,t) -> None:
self.t = t
score = 0
last = [[] for i in range(26)]
for i,ti in enumerate(t):
score += s[i][ti-1]
last[ti-1].append(i+1)
for tj in range(26):
if... | p02619 |
import sys
input = sys.stdin.readline
def SA_IS(s, upper=127):
n = len(s)
sa = [-1 for _ in range(n)]
bucket = [0 for _ in range(upper + 1)]
smaller = [True for _ in range(n)]
is_lms = [False for _ in range(n)]
lmss = []
for x in s:
bucket[x+1] += 1
for i in range(... | import sys
input = sys.stdin.readline
def SA_IS(s, upper=127):
n = len(s)
sa = [-1 for _ in range(n)]
bucket = [0 for _ in range(upper + 1)]
smaller = [True for _ in range(n)]
is_lms = [False for _ in range(n)]
lmss = []
for x in s:
bucket[x+1] += 1
for i in range(... | p02566 |
n = int(eval(input()))
a,b = list(map(int,input().split()))
l = list(map(int,input().split()))
c = [0,0,0]
for i in l:
if i <= a:
c[0] += 1
elif i > b:
c[2] += 1
else:
c[1] += 1
print((min(c))) | n=int(eval(input()))
a,b=list(map(int, input().split()))
p=list(map(int, input().split()))
c=[0]*3
for i in p:
if i <=a:
c[0] +=1
elif i>b:
c[2] +=1
else:
c[1]+=1
print((min(c))) | p03156 |
def main():
N = int(eval(input()))
A, B = (int(i) for i in input().split())
P = [int(i) for i in input().split()]
cnt = [0, 0, 0]
for p in P:
if p <= A:
cnt[0] += 1
elif p <= B:
cnt[1] += 1
else:
cnt[2] += 1
print((min(cnt))... | def main():
N = int(eval(input()))
A, B = (int(i) for i in input().split())
P = [int(i) for i in input().split()]
cnt = [0]*3
for p in P:
if p <= A:
cnt[0] += 1
elif p <= B:
cnt[1] += 1
else:
cnt[2] += 1
print((min(cnt))... | p03156 |
print(input().strip()[::-1]) | print(input()[::-1]) | p00006 |
str = input()
str_lis = list(str)
str_lis.reverse()
print((''.join(str_lis))) | line = input()
lis = ['' for i in range(len(line))]
for i in range(len(line)-1, -1, -1):
lis[len(line)-1-i] = line[i]
else:
print(''.join(lis)) | p00006 |
import math
if __name__ == "__main__":
deg = int(eval(input()))
print((360//math.gcd(deg, 360))) | def lcm(x, y):
if x > y:
greater = x
else:
greater = y
while(True):
if((greater % x == 0) and (greater % y == 0)):
lcm = greater
break
greater += 1
return lcm
x = int(eval(input()))
if 360%x == 0:
print((int(360/x)))
else :
print... | p02633 |
import math
n=int(eval(input()))
print((360//math.gcd(n,360))) | import math
print((360//math.gcd(int(eval(input())),360))) | p02633 |
import math
x=int(eval(input()))
print((360//math.gcd(360,x))) | x = int(eval(input()))
print(([360*n//x for n in range(1, 500) if 360 * n % x == 0][0])) | p02633 |
import math
#print(math.cos(math.radians(90)))
#exit()
n = int(eval(input()))
x = 0
y = 1
deg = 90 - n
cnt = 1
#print(x<-10**(-5))
while 1 == 1:
x += math.cos(math.radians(deg))
y += math.sin(math.radians(deg))
deg -= n
cnt += 1
if x > -10**(-5) and x < 10**(-5) and y > -10**(-5) and y... | import math
#print(math.cos(math.radians(90)))
#exit()
x = int(eval(input()))
print((360//math.gcd(360,x))) | p02633 |
x = int(eval(input()))
ans = 360//x
x = 360 % x
while x != 0:
ans += 360//x
x %= 360
print(ans)
| x = int(eval(input()))
ans = 0
while True:
ans += 1
if ans*x % 360 == 0:
break
print(ans)
| p02633 |
X = int(eval(input()))
x = [0]
y = [0]
t = X
ans = 1
while True:
ans += 1
x.append(t)
y.append(t)
if (180-t)%360 in x:
if t == (180-t)%360 and x.count(t) == 1:
t += X
t %= 360
continue
x.remove((180-t)%360)
x.remove(t)
eli... | X = int(eval(input()))
ans = 360
def gcd(a, b):
if b == 0:
return a
return gcd(b, a%b)
ans = 360 // gcd(X, 360)
print(ans) | p02633 |
import math
X = int(eval(input()))
lcm = 360 * X // math.gcd(360, X)
print((lcm // X)) | import math
X = int(eval(input()))
# lcm = 360 * X // math.gcd(360, X)
print((360 // math.gcd(360, X))) | p02633 |
# import matplotlib.pyplot as plt
import math
def squaredDistance(a, b):
return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2
# for X in range(1, 180):
angle = 90
X = int(eval(input()))
iter = 0
current = [0, 0]
previous = current
while (iter == 0 or squaredDistance(current, [0, 0]) > 0.00001):
if (iter ... | # import matplotlib.pyplot as plt
import math
def lcm(x, y):
if x > y:
z = x
else:
z = y
while(True):
if((z % x == 0) and (z % y == 0)):
lcm = z
break
z += 1
return lcm
X = int(eval(input()))
print((int(lcm(X, 360) / X))) | p02633 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
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 l... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
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 l... | p02633 |
import math
X=int(eval(input()))
shukai=360
while True:
if shukai%X==0:
print((shukai//X))
exit()
else:
shukai*=2 | def gcda(a,b):
if a < b:
a, b = b, a
r = a % b
if r == 0:
return b
return gcda(r, b)
def lcm(a,b):
return a*b//gcda(a,b)
X=int(eval(input()))
shukai=360
while True:
if shukai%X==0:
print((shukai//X))
exit()
else:
shukai=lcm(shukai,X... | p02633 |
import math
from fractions import Fraction
x = int(eval(input()))
rad = Fraction((math.pi / 180) * x)
k = 0
while True:
k += 1
s = rad * k
if s % (math.pi * 2) == 0:
break
print(k) | import math
from fractions import Fraction
x = int(eval(input()))
k = 0
while True:
k += 1
s = x * k
if s % 360 == 0:
break
print(k) | p02633 |
x = int(eval(input()))
for k in range(1, 10000):
if x*k % 360 == 0:
print(k)
break
| x = int(eval(input()))
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
n = gcd(x, 360)
print((360//n)) | p02633 |
from math import gcd
x = int(eval(input()))
y = x * 360 // gcd(x, 360)
print((y//x)) | x = int(eval(input()))
y = 0
k = 0
while True:
y += x
k += 1
if y % 360 == 0:
break
print(k) | p02633 |
x=int(eval(input()))
i=1
if 1<=x<=179:
while True:
if 360/x==int(360/x):
print((int(360/x)))
break
else:
i+=1
| x=int(eval(input()))
i=1
if 1<=x<=179:
while True:
if 360*i%x==0:
print((int(360*i/x)))
break
else:
i+=1
| p02633 |
import math
n = int(eval(input()))
ab = []
for i in range(n):
ab.append(tuple(map(int,input().split())))
MOD = 1000000007
d = {}
zero = 0
for a,b in ab:
if a == 0 and b == 0:
zero += 1
continue
g = math.gcd(a,b)
a //= g
b //= g
if b < 0:
a,b = -a,-b
elif a < 0 and b == 0:
... | import math
n = int(eval(input()))
ab = []
for i in range(n):
ab.append(tuple(map(int,input().split())))
MOD = 1000000007
d = {}
zero = 0
for a,b in ab:
if a == 0 and b == 0:
zero += 1
continue
g = math.gcd(a,b)
a //= g
b //= g
if b < 0:
a,b = -a,-b
elif a < 0 and b == 0:
... | p02679 |
def ii():return int(eval(input()))
def iim():return list(map(int,input().split()))
def iil():return list(map(int,input().split()))
def ism():return list(map(str,input().split()))
def isl():return list(map(str,input().split()))
from fractions import Fraction
mod = int(1e9+7)
n = ii()
cnd = {}
azero = 0
bze... | def ii():return int(eval(input()))
def iim():return list(map(int,input().split()))
def iil():return list(map(int,input().split()))
def ism():return list(map(str,input().split()))
def isl():return list(map(str,input().split()))
#from fractions import Fraction
from math import gcd
mod = int(1e9+7)
n = ii()
c... | p02679 |
def ii():return int(eval(input()))
def iim():return list(map(int,input().split()))
def iil():return list(map(int,input().split()))
def ism():return list(map(str,input().split()))
def isl():return list(map(str,input().split()))
#from math import gcd
from fractions import Fraction as Fc
mod = int(1e9+7)
n = i... | def ii():return int(eval(input()))
def iim():return list(map(int,input().split()))
def iil():return list(map(int,input().split()))
def ism():return list(map(str,input().split()))
def isl():return list(map(str,input().split()))
from math import gcd
mod = int(1e9+7)
n = ii()
cnd = {}
azero = 0
bzero = 0
al... | p02679 |
import sys
input = sys.stdin.readline
from collections import *
from math import gcd
N = int(eval(input()))
cnt = defaultdict(int)
abzero = 0
azero = 0
bzero = 0
for _ in range(N):
A, B = list(map(int, input().split()))
if A==0 and B==0:
abzero += 1
continue
elif A==0... | import sys
input = sys.stdin.readline
from collections import *
from math import gcd
N = int(eval(input()))
zerozero = 0
zero1 = 0
zero2 = 0
cnt = defaultdict(int)
for _ in range(N):
A, B = list(map(int, input().split()))
if A==0 and B==0:
zerozero += 1
elif A==0:
zer... | p02679 |
from math import gcd
from collections import defaultdict
N = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(N)]
d = {}
for a, b in X:
if a == b == 0:
pass
elif a == 0:
if b > 0:
b = 1
else:
b = -1
elif b == 0:
... |
from math import gcd
N = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(N)]
d = {}
for a, b in X:
if a == b == 0:
pass
elif a == 0:
if b > 0:
b = 1
else:
b = -1
elif b == 0:
if a > 0:
a = 1
... | p02679 |
import sys
#import numpy as np
#import math
from fractions import Fraction
import itertools
input=sys.stdin.readline
def main():
ans=1
mod=1000000007
n0=0
na=nb=0
n=int(eval(input()))
d={}
for i in range(n):
a,b=list(map(int,input().split()))
if b==0 and a==0:
n0+... | import sys
from math import gcd
#import numpy as np
#import math
from fractions import Fraction
import itertools
input=sys.stdin.readline
def main():
ans=1
mod=1000000007
n0=0
na=nb=0
n=int(eval(input()))
d={}
for i in range(n):
a,b=list(map(int,input().split()))
if b==0 an... | p02679 |
# E - ∙ (Bullet)
import sys
from collections import defaultdict
readline = sys.stdin.readline
MOD = 1000000007
N = int(readline())
# イワシの傾きをA/Bとする。
# A/Bは予めgcdで割って約分し、同じ傾きのものを揃えておく。
# このとき、仲の悪い組合せは(A, B)に対して(B, -A)となるもの。
# 前者をS、後者をTとして考える。
d_S = defaultdict(int)
d_T = defaultdict(int)
def gcd(x, y):
... | # E - ∙ (Bullet)
import sys
from collections import defaultdict
readline = sys.stdin.readline
MOD = 1000000007
N = int(readline())
# イワシの傾きをA/Bとする。
# A/Bは予めgcdで割って約分し、同じ傾きのものを揃えておく。
# このとき、仲の悪い組合せは(A, B)に対して(B, -A)となるもの。
# 前者をS、後者をTとして考える。
d_S = defaultdict(int)
d_T = defaultdict(int)
def gcd(x, y):
... | p02679 |
from functools import cmp_to_key
MOD = 10 ** 9 + 7
def func(a, b):
if a[0] * b[1] == a[1] * b[0]:
return 0
elif a[0] * b[1] < a[1] * b[0]:
return - 1
else:
return 1
n = int(eval(input()))
a = [0] * n
b = [0] * n
i = 0
f = 0
while i < n:
a[i], b[i] = list(... | from math import gcd
from collections import defaultdict
MOD = 10 ** 9 + 7
n = int(eval(input()))
d = defaultdict(int)
tmp = 0
for i in range(n):
a, b = list(map(int, input().split()))
if a == b == 0:
tmp += 1
else:
if b < 0 or (b == 0 and a <= 0):
a = -a
... | p02679 |
N=int(eval(input()))
from collections import defaultdict
dic=defaultdict(int)
import math
mod=1000000007
for _ in range(N):
A,B=list(map(int,input().split()))
if A<0:
A,B=-A,-B
if A==0:
if B==0:
dic[(0,0)]+=1
else:
dic[(0,1)]+=1
elif B==0:
... | N=int(eval(input()))
from collections import defaultdict
dic=defaultdict(int)
import math
mod=1000000007
for _ in range(N):
A,B=list(map(int,input().split()))
if A<0:
A,B=-A,-B
if A==0:
if B==0:
dic[(0,0)]+=1
else:
dic[(0,-1)]+=1
elif B==0:
... | p02679 |
import math
n = int(eval(input()))
mod = 10 ** 9 + 7
ab = {}
for i in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
pass
elif a == 0:
b = 1
else:
gcd = math.gcd(a, b)
a //= gcd
b //= gcd
if a < 0:
a, ... | import math
n = int(eval(input()))
mod = 10 ** 9 + 7
ab = {}
for i in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
pass
elif a == 0:
b = 1
else:
gcd = math.gcd(a, b)
a //= gcd
b //= gcd
if a < 0:
a, ... | p02679 |
from math import gcd
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
mod = 1000000007
#%%
kai = [1]*(n+1)
gyaku = [1]*(n+1)
for i in range(2, n+1):
kai[i] = kai[i-1]*i % mod
gyaku[i] = gyaku[i-1]*pow(i, mod-2, mod) %mod
azero = 0
bzero = 0
zerozero = 0
dict_p... | from math import gcd
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
mod = 1000000007
#%%
kai = [1]*(n+1)
gyaku = [1]*(n+1)
for i in range(2, n+1):
kai[i] = kai[i-1]*i % mod
gyaku[i] = gyaku[i-1]*pow(i, mod-2, mod) %mod
azero = 0
bzero = 0
zerozero = 0
dict_p... | p02679 |
# -*- coding: utf-8 -*-
from fractions import Fraction
import sys
N, *AB = list(map(int, sys.stdin.buffer.read().split()))
dict_F = {}
count_0 = 0
def insert(A,B,s): # A>=0, B>0, s=0or1
if Fraction(A,B) not in list(dict_F.keys()):
dict_F[Fraction(A,B)] = [0,0]
dict_F[Fraction(A,B)][s] += 1
def... | # -*- coding: utf-8 -*-
import sys
from math import gcd
N, *AB = list(map(int, sys.stdin.buffer.read().split()))
dict_F = {}
count_0 = 0
def insert(A,B,s): # A>=0, B>0, s=0or1
if (A,B) not in list(dict_F.keys()):
dict_F[(A,B)] = [0,0]
dict_F[(A,B)][s] += 1
def make_power2(N):
result = 1
... | p02679 |
# -*- coding: utf-8 -*-
from math import gcd
N = int(eval(input()))
dict_F = {}
count_0 = 0
def insert(A,B,s): # A>=0, B>0, s=0or1
if (A,B) not in list(dict_F.keys()):
dict_F[(A,B)] = [0,0]
dict_F[(A,B)][s] += 1
def make_power2(N):
result = 1
list_result = [1]
for _ in range(N):
r... | # -*- coding: utf-8 -*-
import sys
from math import gcd
N, *AB = list(map(int, sys.stdin.read().split()))
dict_F = {}
count_0 = 0
def insert(A,B,s): # A>=0, B>0, s=0or1
if (A,B) not in list(dict_F.keys()):
dict_F[(A,B)] = [0,0]
dict_F[(A,B)][s] += 1
def make_power2(N):
result = 1
list_re... | p02679 |
def main():
from fractions import Fraction
import sys
input = sys.stdin.readline
N = int(eval(input()))
AB = [list(map(int,input().split())) for _ in range(N)]
MOD = 10**9 + 7
zero_zero_count = 0
zero_one_count = 0
one_zero_count = 0
dd_ba = {}
dd_flag = {}
for a,b in AB:
if... | def main():
from math import gcd
from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
AB = [list(map(int,input().split())) for _ in range(N)]
MOD = 10**9 + 7
zero_zero_count = 0
zero_one_count = 0
one_zero_count = 0
dd_ba = defaultdict(int... | p02679 |
from fractions import Fraction as F
MOD = 10**9 + 7
def main(N, T):
A = []
cnt_zero = [0, 0] # 片方が0のとき
p = 0 # 両方0
cA = {}
for a, b in T:
if a == 0 and b == 0:
p += 1
elif a == 0:
cnt_zero[0] += 1
elif b == 0:
cnt_zero[1]... | MOD = 10**9 + 7
P = 7 ** 21 + 52
def F(a, b):
return (a * pow(b, P-2, P)) % P
def main():
from collections import Counter
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
A = []
cnt_zero = [0,... | p02679 |
MOD = 10**9 + 7
P = 7 ** 21 + 52
def F(a, b):
return (a * pow(b, P-2, P)) % P
def main():
from collections import Counter
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
A = []
cnt_zero = [0,... | MOD = 10**9 + 7
P = 7 ** 21 + 52
def F(a, b):
return (a * pow(b, P-2, P)) % P
def main():
from collections import Counter
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
T = [[int(i) for i in input().split()] for j in range(N)]
cnt_zero = [0, 0] # 片方が0の... | p02679 |
# -*- coding: utf-8 -*-
from collections import Counter, defaultdict, deque
import math
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
... | # -*- coding: utf-8 -*-
from collections import Counter, defaultdict, deque
import math
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
... | p02679 |
# -*- coding: utf-8 -*-
from fractions import Fraction
from collections import Counter
import math
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_r... | # -*- coding: utf-8 -*-
from fractions import Fraction
from collections import Counter
import math
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_r... | p02679 |
from math import gcd
MOD = 10**9+7
N = int(eval(input()))
d = {}
zero = 0
for i in range(N):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
zero += 1
continue
flip = 0
while not (a > 0 and b >= 0):
a, b = -b, a
flip ^= 1
g = gcd(a, b)... | from math import gcd
MOD = 10**9+7
N = int(eval(input()))
d = {}
zero = 0
for i in range(N):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
zero += 1
continue
flip = 0
while not (a >= 0 and b > 0):
a, b = -b, a
flip ^= 1
g = gcd(a, b)... | p02679 |
from math import gcd
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
t = set()
d = {}
d[0] = {}
d[0][0] = 0
for a, b in AB:
i = gcd(a, b)
if i != 0:
a //= i
b //= i
t.add((a, b))
d.setdefault(a, {})
d[a].setdefault(b, 0)
d[a][b] ... | from math import gcd
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
t = []
d = {}
d[0] = {}
d[0][0] = 0
for a, b in AB:
i = gcd(a, b)
if i != 0:
a //= i
b //= i
t.append((a, b))
d.setdefault(a, {})
d[a].setdefault(b, 0)
d[a][b] ... | p02679 |
from math import gcd
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
t = []
d = {}
d[0] = {}
d[0][0] = 0
for a, b in AB:
i = gcd(a, b)
if i != 0:
a //= i
b //= i
t.append((a, b))
d.setdefault(a, {})
d[a].setdefault(b, 0)
d[a][b] ... | from math import gcd
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
m = 1000000007
t = []
d = {}
d[0] = {}
d[0][0] = 0
for a, b in AB:
i = gcd(a, b)
if i != 0:
a //= i
b //= i
t.append((a, b))
d.setdefault(a, {})
d[a].setdefault(b... | p02679 |
import collections
from math import gcd
import sys
input=sys.stdin.readline
n=int(eval(input()))
c=collections.Counter()
mod=10**9+7
for _ in range(n):
a,b=list(map(int,input().split()))
g=abs(gcd(a,b))
if g==0:
g=1
a//=g
b//=g
c[(a,b)]+=1
ans=1
s=set()
for i,j in c:
... | import collections
from math import gcd
def main():
n=int(eval(input()))
c=collections.Counter()
mod=10**9+7
for _ in range(n):
a,b=list(map(int,input().split()))
g=abs(gcd(a,b))
if g==0:
g=1
a//=g
b//=g
c[(a,b)]+=1
ans=1
... | p02679 |
from fractions import Fraction
import math
n = int(eval(input()))
ab = []
ba = []
a0 = 0
b0 = 0
ab0 = 0
for i in range(n):
a, b = list(map(int, input().split()))
if a != 0 and b != 0:
ab.append(Fraction(a, b))
ba.append(Fraction(-b, a))
elif a == 0 and b == 0:
... | from fractions import Fraction
import math
n = int(eval(input()))
ab = []
ba = []
a0 = 0
b0 = 0
ab0 = 0
def irr(a, b):
gcd = math.gcd(a, b)
a = a // gcd
b = b // gcd
if b < 0:
return (-a, -b)
else:
return (a, b)
for i in range(n):
a, b = list(ma... | p02679 |
from fractions import Fraction
from collections import defaultdict
def inverse(key):
if key == "inf":
return Fraction(0, 1)
if key == Fraction(0, 1):
return "inf"
return - Fraction(key.denominator, key.numerator)
mod = 10 ** 9 + 7
n = int(eval(input()))
fishes = default... | from collections import defaultdict
from math import gcd
mod = 10 ** 9 + 7
n = int(eval(input()))
fishes = defaultdict(int)
zero_zero = 0
zero = 0
inf = 0
for _ in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
zero_zero += 1
elif a == 0:
zero += 1
... | p02679 |
from collections import defaultdict
from math import gcd
mod = 10 ** 9 + 7
n = int(eval(input()))
fishes = defaultdict(int)
zero_zero = 0
zero = 0
inf = 0
for _ in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
zero_zero += 1
elif a == 0:
zero += 1
... | def main():
from collections import defaultdict
from math import gcd
import sys
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(eval(input()))
fishes = defaultdict(int)
zero_zero = 0
zero = 0
inf = 0
for _ in range(n):
a, b = list(map(int, input... | p02679 |
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | p02679 |
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | p02679 |
#!/usr/bin/python3
from fractions import Fraction
M = 1000000007
def normalize(v):
if v > 0:
return v
else:
return - 1 / v
n = int(eval(input()))
vs = {}
zc = 0
azc = 0
bzc = 0
for i in range(n):
(a, b) = list(map(int, input().split()))
if a == 0 and b == 0:
... | #!/usr/bin/python3
import math
M = 1000000007
def normalize(v):
(a, b) = v
if a * b > 0:
return (a, b)
else:
if a > 0:
return (-b, a)
else:
return (b, -a)
def inv(v):
(a, b) = v
if a > 0:
return (-b, a)
else:
... | p02679 |
from collections import defaultdict
from fractions import Fraction
import sys
input = sys.stdin.readline
N=int(eval(input()))
mod=10**9+7
dic=defaultdict(lambda: [0,0])
c=0
d=0
e=0
for i in [0]*N:
A,B = list(map(int,input().split()))
if A==0 and B==0:
e+=1
elif A==0:
c+=1
elif B==0:
d+=1
el... | from collections import defaultdict
from math import gcd
import sys
input = sys.stdin.readline
N=int(eval(input()))
mod=10**9+7
dic=defaultdict(lambda: [0,0])
c=0
d=0
e=0
for i in [0]*N:
A,B = list(map(int,input().split()))
if A==0 and B==0:
e+=1
elif A==0:
c+=1
elif B==0:
d+=1
else:
g=g... | p02679 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import defaultdict
from fractions import Fraction
n = int(readline())
data = list(map(int,read().split()))
mod = 1000000007
it = iter(data)
a_b = defaultdict(lambda :[0,0])
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import defaultdict
from math import gcd
n = int(readline())
data = list(map(int,read().split()))
mod = 1000000007
it = iter(data)
a_b = defaultdict(lambda :[0,0])
a0 = 0
b... | p02679 |
import sys
input = sys.stdin.readline
import math
MOD = 10**9+7
N = int(eval(input()))
F = []
zero_v = 0
inf = 0
zero = 0
for _ in range(N):
x,y = list(map(int,input().split()))
if x==0 and y==0:
zero_v += 1
elif x==0:
inf += 1
elif y==0:
zero += 1
else:
G = math.gcd(abs(x)... | import sys
input = sys.stdin.readline
def gcd(a, b):
while b:
a, b = b, a % b
return a
MOD = 10**9+7
N = int(eval(input()))
F = []
zero_v = 0
inf = 0
zero = 0
for _ in range(N):
x,y = list(map(int,input().split()))
if x==0 and y==0:
zero_v += 1
elif x==0:
inf += 1
elif y==0... | p02679 |
from collections import defaultdict
import math
def ggg(a, b):
"""規約分数を作る。n/0, 0/n は n=1,-1 にして返す。"""
if a == b == 0:
return 0, 0
denominator = math.gcd(a, b)
x, y = a // denominator, b // denominator
return x, y
def main():
n = int(eval(input()))
mod = 100000000... | from collections import defaultdict
import math
def main():
n = int(eval(input()))
mod = 1000000007
zeroes = 0
counter = defaultdict(lambda: defaultdict(int))
for _ in range(n):
x, y = [int(x) for x in input().split()]
if x == y == 0:
zeroes += 1
... | p02679 |
from collections import defaultdict
import math
def main():
n = int(eval(input()))
mod = 1000000007
zeroes = 0
counter = defaultdict(lambda: defaultdict(int))
for _ in range(n):
x, y = [int(x) for x in input().split()]
if x == y == 0:
zeroes += 1
... | from collections import defaultdict
import math
def main():
n = int(eval(input()))
mod = 1000000007
zeroes = 0
counter1 = defaultdict(int)
counter2 = defaultdict(int)
for _ in range(n):
x, y = [int(x) for x in input().split()]
if x == y == 0:
zeroes +... | p02679 |
import sys
import math
mod = 1000000007
n = int(sys.stdin.readline().rstrip())
ab = {}
for i in range(n):
a,b = list(map(int,sys.stdin.readline().rstrip().split()))
if a == 0 and b == 0:
pass
elif a == 0:
b = 1
else:
gcd = math.gcd(a,b)
a //= gcd
b... | import math
n = int(eval(input()))
mod = 10 ** 9 + 7
ab = {}
for i in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
pass
elif a == 0:
b = 1
else:
gcd = math.gcd(a, b)
a //= gcd
b //= gcd
if a < 0:
a... | p02679 |
import sys
import math
mod = 1000000007
n = int(sys.stdin.readline().rstrip())
ab = {}
for i in range(n):
a,b = list(map(int,sys.stdin.readline().rstrip().split()))
if a == 0 and b == 0:
pass
elif a == 0:
b = 1
else:
gcd = math.gcd(a,b)
a //= gcd
... | import sys
import math
mod = 1000000007
n = int(sys.stdin.readline().rstrip())
ab = {}
for i in range(n):
a,b = list(map(int,sys.stdin.readline().rstrip().split()))
if a == 0 and b == 0:
pass
elif a == 0:
b = 1
else:
gcd = math.gcd(a,b)
a //= gcd
... | p02679 |
from collections import defaultdict
from fractions import Fraction
N = int(eval(input()))
MOD = 1000000007
d_plus = defaultdict(int) # + or ∞
d_minus = defaultdict(int) # - or 0
ans = 1
ans_00 = 0
for i in range(N):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
ans_00 += ... | from collections import defaultdict
from math import gcd
N = int(eval(input()))
MOD = 1000000007
d_plus = defaultdict(int) # + or ∞
d_minus = defaultdict(int) # - or 0
ans = 1
ans_00 = 0
for i in range(N):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
ans_00 += 1
eli... | p02679 |
# coding: utf-8
import sys,pprint
from fractions import Fraction
from collections import defaultdict
MOD = 1000000007
N = int(eval(input()))
params =[]
hatemasks = []
tilts = defaultdict(int)
zerozero = 0
zerodiv = 0
for i in range(N):
(ai, bi) = list(map(int,input().split()))
if ai == 0 and bi =... | # coding: utf-8
import sys,pprint, math
from fractions import Fraction
from collections import defaultdict
MOD = 1000000007
N = int(input())
params =[]
hatemasks = []
tilts = defaultdict(lambda: [0,0])
zerozero = 0
zerodiv = 0
for i in range(N):
(ai, bi) = map(int,input().split())
if ai == 0 and ... | p02679 |
from math import gcd
n=int(eval(input()))
mod = 10**9+7
d = dict()
zeros=0
for _ in range(n):
a,b=list(map(int,input().split()))
if not any((a,b)):
zeros+=1
continue
if all((a,b)):
g = gcd(a,b)*(a//abs(a))
elif a:
g = a
else:
g = b
p = a//g,b//g
d[p] = d.get(... | from math import gcd
n=int(eval(input()))
mod = 10**9+7
d = dict()
zeros=0
for _ in range(n):
a,b=list(map(int,input().split()))
if not any((a,b)):
zeros+=1
continue
if all((a,b)):
g = gcd(a,b)*(a//abs(a))
elif a:
g = a
else:
g = b
p = a//g,b//g
d[p] = d.get(... | p02679 |
from math import gcd
from collections import Counter
mod = 10 ** 9 + 7
N, *AB = list(map(int, open(0).read().split()))
def std(a, b):
if a == 0:
return (0, int(b != 0))
g = gcd(a, b)
a, b = a // g, b // g
return (a, b) if a > 0 else (-a, -b)
C = Counter()
for a, b in zip(*[i... | from math import gcd
from collections import Counter
mod = 10 ** 9 + 7
N, *AB = list(map(int, open(0).read().split()))
def std(a, b):
if a == 0:
return (0, int(b != 0))
g = gcd(a, b)
a, b = a // g, b // g
return (a, b) if a > 0 else (-a, -b)
C = Counter(std(a, b) for a, b in ... | p02679 |
import sys
from fractions import Fraction
mod = 1000000007
def solve():
input = sys.stdin.readline
N = int(eval(input()))
F = [[int(i) for i in input().split()] for _ in range(N)]
D = dict()
zero, inf, ng = 0, 0, 0
for x, y in F:
if x == 0 and y == 0: ng += 1
elif x ... | import sys
from math import gcd
from fractions import Fraction
mod = 1000000007
def solve():
input = sys.stdin.readline
N = int(eval(input()))
F = [[int(i) for i in input().split()] for _ in range(N)]
D = dict()
zero, inf, ng = 0, 0, 0
for x, y in F:
if x == 0 and y == 0: ng... | p02679 |
"""
n = int(input())
ab = [list(map(int,input().split())) for _ in range(n)]
mod = 1000000007
ab1 = []
ab2 = []
ab3 = []
ab4 = []
count00 = 0
count01 = 0
count10 = 0
for i in range(n):
if ab[i][0] != 0 and ab[i][1] != 0:
ab1.append(ab[i][0]/ab[i][1])
ab2.append(-ab[i][1]/ab[i][0]... | from math import gcd
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
dict1 = {}
mod = 1000000007
cnt00 = 0
cnt01 = 0
cnt10 = 0
for _ in range(n):
a,b = list(map(int,input().split()))
if a == 0 and b == 0:
cnt00 += 1
... | p02679 |
from collections import defaultdict
from itertools import groupby, accumulate, product, permutations, combinations
from math import gcd
def reduction(x,y):
g = gcd(x,y)
return abs(x)//g,abs(y)//g
def solve():
mod = 10**9+7
dplus = defaultdict(lambda: 0)
dminus = defaultdict(lambda: 0)
... | from collections import defaultdict
from itertools import groupby, accumulate, product, permutations, combinations
from math import gcd
def reduction(x,y):
g = gcd(x,y)
return abs(x)//g,abs(y)//g
def solve():
mod = 10**9+7
dplus = defaultdict(lambda: 0)
dminus = defaultdict(lambda: 0)
... | p02679 |
import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from collections import Counter
from fractions import Fraction
N=int(eval(input()))
mod=10**9+7
S=[tuple(map(int,input().split())) for i in range(N)]
def main():
C=Counter()
PLUS=0
for a,b in S:
if... | import sys
input = sys.stdin.readline
from collections import Counter
from fractions import Fraction
from math import gcd
N=int(eval(input()))
mod=10**9+7
S=[tuple(map(int,input().split())) for i in range(N)]
def main():
C=Counter()
PLUS=0
for a,b in S:
if a==0 and b==0:
... | p02679 |
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import sys
# sys.stdout.write(str(n)+"\n")
MODULO = 1000000007
# INF = 1e18+10
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
n = int(eval(input()))
a_b = [() for i in range(n)]
m_b_a = [() for i in range(n)]
a_b... | import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import sys
# sys.stdout.write(str(n)+"\n")
MODULO = 1000000007
# INF = 1e18+10
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
n = int(eval(input()))
a_b = [() for i in range(n)]
m_b_a = [() for i in range(n)]
# a... | p02679 |
from collections import defaultdict
from math import gcd
mod = 1000000007
n = int(eval(input()))
plus = defaultdict(int)
minus = defaultdict(int)
a_0 = 0
b_0 = 0
a_b_0 = 0
xxx = 10 ** 10
for _ in range(n):
a, b = list(map(int, input().split()))
if a == 0 or b == 0:
if a == 0 and b == 0:
... | MOD = 10 ** 9 + 7
from math import gcd
from collections import defaultdict
n = int(eval(input()))
plus = defaultdict(int)
minus = defaultdict(int)
zero = [0, 0, 0]
for _ in range(n):
a, b = list(map(int, input().split()))
if a * b == 0:
if a == b == 0:
zero[0] += 1
elif... | p02679 |
M = 1000000007
from fractions import Fraction
N = int(eval(input()))
ab_zero_count = 0
a_zero_count = 0
b_zero_count = 0
fish_list = []
for _ in range(N):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
ab_zero_count += 1
elif a == 0:
a_zero_count += 1
elif b == 0:
b_zero_co... | M = 1000000007
import math
N = int(eval(input()))
ab_zero_count = 0
a_zero_count = 0
b_zero_count = 0
fish_list = []
for _ in range(N):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
ab_zero_count += 1
elif a == 0:
a_zero_count += 1
elif b == 0:
b_zero_count += 1
else:
... | p02679 |
import sys
input = sys.stdin.readline
from fractions import Fraction
def solve():
N = int(eval(input()))
AB = [tuple(map(int,input().split())) for i in range(N)]
MOD = 10**9+7
from collections import Counter
ctr = Counter()
az = bz = zz = 0
for a,b in AB:
if a==b==0:
... | import sys
input = sys.stdin.readline
from math import gcd
def solve():
N = int(eval(input()))
AB = [tuple(map(int,input().split())) for i in range(N)]
MOD = 10**9+7
from collections import Counter
ctr = Counter()
az = bz = zz = 0
for a,b in AB:
if a==b==0:
... | p02679 |
from math import gcd
from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
cnt = defaultdict(lambda: [0, 0])
zeros = 0
for _ in range(n):
a, b = list(map(int, input().split()))
if a == b == 0:
zeros += 1
continue
if a < 0:
a *= -1
b *= -1
... | from math import gcd
from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
cnt = defaultdict(lambda: [0, 0])
zeros = 0
for _ in range(n):
a, b = list(map(int, input().split()))
if a == b == 0:
zeros += 1
continue
if a < 0 or (a == 0 and b < 0):
a *= -1
... | p02679 |
from collections import Counter
from fractions import Fraction
MOD = 10 ** 9 + 7
N = int(eval(input()))
ct = Counter()
Azero = 0
Bzero = 0
Allzero = 0
for _ in range(N):
a, b = list(map(int, input().split()))
if a == b == 0:
Allzero += 1
elif a == 0:
Azero += 1
elif b == 0:... | from collections import Counter
from fractions import Fraction
MOD = 10 ** 9 + 7
N = int(eval(input()))
ct = Counter()
Azero = 0
Bzero = 0
Allzero = 0
for _ in range(N):
a, b = list(map(int, input().split()))
if a == b == 0:
Allzero += 1
elif a == 0:
Azero += 1
elif b == 0:... | p02679 |
from collections import deque
from math import gcd
import sys
def input():
return sys.stdin.readline().rstrip()
MOD = 10**9 + 7
n = int(eval(input()))
cnt = {}
zero_cnt = 0
ans = 1
for _ in range(n):
a, b = list(map(int, input().split()))
if (a, b) == (0, 0):
zero_cnt += 1
... | from collections import deque
from math import gcd
import sys
def input():
return sys.stdin.readline().rstrip()
MOD = 10**9 + 7
n = int(eval(input()))
cnt = {}
zero_cnt = 0
ans = 1
for _ in range(n):
a, b = list(map(int, input().split()))
if (a, b) == (0, 0):
zero_cnt += 1
... | p02679 |
mod=10**9+7
n=int(eval(input()))
from collections import defaultdict
d=defaultdict(int)#各点の方向ベクトルを管理
z=0#原点にいる際は例外処理したいので別途数える
from math import gcd
for i in range(n):
x,y=list(map(int,input().split()))
if x==y==0:z+=1
else:
f=gcd(x,y)
x//=f;y//=f#非本質な定数倍を削除
if x<0:x*=-1;... | import sys
input=sys.stdin.buffer.readline
mod=10**9+7
n=int(eval(input()))
d={}
z=0
from math import gcd
for i in range(n):
x,y=list(map(int,input().split()))
if x==y==0:z+=1
else:
f=gcd(x,y)
x//=f;y//=f
if x<0:x*=-1;y*=-1
if x==0 and y<0:y=-y
if (x,y... | p02679 |
import sys
import math
from fractions import Fraction
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
MOD = 10**9+7
N = int(eval(input()))
dic = defaultdict(int)
gp = []
zero = 0
left_zero = 0
right_zero = 0
for i in range(N):
a,b = list(map(int, input().s... | import sys
import math
from fractions import Fraction
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
MOD = 10**9+7
N = int(eval(input()))
dic = defaultdict(int)
gp = []
zero = 0
left_zero = 0
right_zero = 0
for i in range(N):
a,b = list(map(int, input().s... | p02679 |
import sys
import math
from fractions import Fraction
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
MOD = 10**9+7
N = int(eval(input()))
dic = defaultdict(int)
gp = []
zero = 0
left_zero = 0
right_zero = 0
for i in range(N):
a,b = list(map(int, input().s... | import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
MOD = 10**9+7
N = int(eval(input()))
dic = defaultdict(int)
zero = 0
left_zero = 0
right_zero = 0
for i in range(N):
a, b = list(map(int, input().split()))
if b < 0:
a = -a
... | p02679 |
def e_bullet(MOD=10**9 + 7):
from math import gcd
from collections import defaultdict
N = int(eval(input()))
zero_all = 0
pair = defaultdict(int)
for _ in range(N):
a, b = [int(i) for i in input().split()]
if a == 0 and b == 0:
zero_all += 1
co... | def e_bullet(MOD=10**9 + 7):
from math import gcd
from collections import defaultdict
N = int(eval(input()))
zero_all = 0
pair = defaultdict(int)
for _ in range(N):
a, b = [int(i) for i in input().split()]
if a == 0 and b == 0:
zero_all += 1
co... | p02679 |
from sys import stdin, setrecursionlimit
from collections import defaultdict
from math import gcd
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
N, *AB = list(map(int, stdin.buffer.read().split()))
d = defaultdict(int)
zeros = 0
for a, b i... | from sys import stdin, setrecursionlimit
from collections import defaultdict
from math import gcd
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
N, *AB = list(map(int, stdin.buffer.read().split()))
d = defaultdict(int)
zeros = 0
for a, b i... | p02679 |
from sys import stdin, setrecursionlimit
from collections import defaultdict
from math import gcd
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
N = int(eval(input()))
d = defaultdict(int)
zeros = 0
for i in range(N):
a, b = list(ma... | from sys import stdin, setrecursionlimit
from collections import defaultdict
from math import gcd
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
N, *AB = list(map(int, stdin.buffer.read().split()))
d = defaultdict(int)
zeros = 0
for a, b... | p02679 |
import collections
n=int(eval(input()))
A=[]
AA=[]
B=[]
C=[]
X=[]
mod=10**9+7
p=12231472983974394769
for i in range(n):
a,b=list(map(int,input().split()))
if a<0:
a=a*-1
b=b*-1
if a*b>0:
A.append(b*pow(a,p-2,p)%p)
elif a*b<0:
AA.append(a*pow((-b),p-2,p)%p)
else:
if a==0 ... | import collections
n=int(eval(input()))
A=[]
AA=[]
B=[]
C=[]
X=[]
mod=10**9+7
p=137053438808121949
for i in range(n):
a,b=list(map(int,input().split()))
if a<0:
a=a*-1
b=b*-1
if a*b>0:
A.append(b*pow(a,p-2,p)%p)
elif a*b<0:
AA.append(a*pow((-b),p-2,p)%p)
else:
if a==0 an... | p02679 |
import collections
n=int(eval(input()))
A=[]
AA=[]
B=[]
C=[]
X=[]
mod=10**9+7
p=137053438808121949
for i in range(n):
a,b=list(map(int,input().split()))
if a<0:
a=a*-1
b=b*-1
if a*b>0:
A.append(b*pow(a,p-2,p)%p)
elif a*b<0:
AA.append(a*pow((-b),p-2,p)%p)
else:
if a==0 an... | from math import gcd
from collections import defaultdict
n=int(eval(input()))
A=defaultdict(int)
AA=defaultdict(int)
B=[]
C=[]
X=[]
mod=10**9+7
for i in range(n):
a,b=list(map(int,input().split()))
if a<0:
a=a*-1
b=b*-1
if a*b>0:
l=a*b//gcd(a,b)
A[str(l//b)+":"+str(l//a)]+=1
eli... | p02679 |
import sys
input = sys.stdin.readline
import collections
import fractions
from fractions import Fraction
from collections import defaultdict
import math
n=int(eval(input()))
a= [list(map(int, input().split())) for i in range(n)]
b=defaultdict(int)
c=defaultdict(int)
b0=0
c0=0
mod=1000000007
ans=1
cnt=0... | import sys
input = sys.stdin.readline
import collections
import fractions
from collections import defaultdict
import math
n=int(eval(input()))
a= [list(map(int, input().split())) for i in range(n)]
b=defaultdict(int)
c=defaultdict(int)
b0=0
c0=0
mod=1000000007
ans=1
cnt=0
for i,j in a:
if i!=0 and... | p02679 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.