input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.parent = [-1 for _ in range(n)]
def size(self, x):
return -self.parent[self.find(x)]
def find(self, x):
if (self.parent[x] < 0):
return x
else:
self... | import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.parent = [-1 for _ in range(n)]
def size(self, x):
return -self.parent[self.find(x)]
def find(self, x):
if (self.parent[x] < 0):
return x
else:
self... | p03682 |
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.parent = [-1 for _ in range(n)]
def size(self, x):
return -self.parent[self.find(x)]
def find(self, x):
if (self.parent[x] < 0):
return x
else:
self... | import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1] * (n + 1)
self.rnk = [0] * (n + 1)
def find_root(self, x):
if self.root[x] < 0:
return x
else:
self.root[x] = self.find_roo... | p03682 |
class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*n
self.rank=[-1]*n
def Find_Root(self,x):
if self.root[x]<0:return x
else:
self.root[x]=self.Find_Root(self.root[x])
return self.root[x]
def Unite(self,x,y):
... | class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*n
self.rank=[-1]*n
def Find_Root(self,x):
if self.root[x]<0:return x
else:
self.root[x]=self.Find_Root(self.root[x])
return self.root[x]
def Unite(self,x,y):
... | p03682 |
class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*n
self.rank=[-1]*n
def Find_Root(self,x):
if self.root[x]<0:return x
else:
self.root[x]=self.Find_Root(self.root[x])
return self.root[x]
def Unite(self,x,y):
... | class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*n
self.rank=[-1]*n
def Find_Root(self,x):
if self.root[x]<0:return x
else:
self.root[x]=self.Find_Root(self.root[x])
return self.root[x]
def Unite(self,x,y):
... | p03682 |
import sys
input = sys.stdin.readline
from heapq import heappop,heappush
n = int(eval(input()))
p = []
for i in range(n):
x,y = list(map(int,input().split()))
p.append((i,x,y))
e = [[] for _ in range(n)]
p = sorted(p,key=lambda x:x[1])
n0,x0,y0 = p[0]
for i in range(n-1):
n1,x1,y1 = p[i+... | from heapq import heappop,heappush
n = int(eval(input()))
p = []
for i in range(n):
x,y = list(map(int,input().split()))
p.append((i,x,y))
e = [[] for _ in range(n)]
p = sorted(p,key=lambda x:x[1])
n0,x0,y0 = p[0]
for i in range(n-1):
n1,x1,y1 = p[i+1]
e[n0].append((min(abs(x1-x0),abs(y... | p03682 |
N = int(eval(input()))
def find(x, U, r):
p = []
while not x == U[x]:
p.append(x)
x = U[x]
for x_ in p:
U[x_] == x
return x
def merge(x, y, U, r):
x = find(x, U, r)
y = find(y, U, r)
if x == y:
return False
#print(x,y, U)
if r[x] < r[y]:
x, y = y, x
U[y... | N = int(eval(input()))
def find(x, U, r):
p = []
while not x == U[x]:
p.append(x)
x = U[x]
for x_ in p:
U[x_] == x
return x
def merge(x, y, U, r):
x = find(x, U, r)
y = find(y, U, r)
if x == y:
return False
#print(x,y, U)
if r[x] < r[y]:
x, y = y, x
U[y... | p03682 |
N = int(eval(input()))
def find(x, U, r):
p = []
while not x == U[x]:
p.append(x)
x = U[x]
for x_ in p:
U[x_] == x
return x
def merge(x, y, U, r):
x = find(x, U, r)
y = find(y, U, r)
if x == y:
return False
#print(x,y, U)
if r[x] < r[y]:
x, y = y, x
U[y... | N = int(eval(input()))
def find(x, U, r):
p = []
while not x == U[x]:
p.append(x)
x = U[x]
for x_ in p:
U[x_] == x
return x
def merge(x, y, U, r):
x = find(x, U, r)
y = find(y, U, r)
if x == y:
return False
#print(x,y, U)
if r[x] < r[y]:
x, y = y, x
U[y... | p03682 |
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納 par[x] == x の時そのノードは根
self.par = [i for i in range(n+1)]
# 木の高さを格納する（初期状態では0)
self.rank = [0] * (n+1)
# 各々の集合の要素数（根が代表して値を持っておく）
self.count = [1] * (n+1)
# 検索
def find(self, x):
# 根ならその... | class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納 par[x] == x の時そのノードは根
self.par = [i for i in range(n+1)]
# 木の高さを格納する（初期状態では0)
self.rank = [0] * (n+1)
# 各々の集合の要素数（根が代表して値を持っておく）
self.count = [1] * (n+1)
# 検索
def find(self, x):
# 根ならその... | p03682 |
from operator import itemgetter
import array
import collections
class UnionFind():
def __init__(self,n):
self.parent = [-1 for _ in range(n)]
def size(self,x):
return -self.parent[self.find(x)]
def find(self,x):
if(self.parent[x]<0):
return x
else... | from operator import itemgetter
import array
class UnionFind():
def __init__(self,n):
self.parent = [-1 for _ in range(n)]
def size(self,x):
return -self.parent[self.find(x)]
def find(self,x):
if(self.parent[x]<0):
return x
else:
self.... | p03682 |
from operator import itemgetter
import array
class UnionFind():
def __init__(self,n):
self.parent = [-1 for _ in range(n)]
def size(self,x):
return -self.parent[self.find(x)]
def find(self,x):
if(self.parent[x]<0):
return x
else:
self.... | import array
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self,n):
self.parent = [-1 for _ in range(n)]
def size(self,x):
return -self.parent[self.find(x)]
def find(self,x):
if(self.parent[x]<0):
return x
else:
... | p03682 |
def find(x):
if(par[x]==x):
return x
else:
par[x]=find(par[x])
return par[x]
def union(a,b):
a=find(a)
b=find(b)
if(a==b):
return 0
else:
if rank[a]>rank[b]:
par[b]=a
else:
par[a]=b
if rank[a]==ra... | import sys
read=sys.stdin.readline
def find(x):
if(par[x]==x):
return x
else:
par[x]=find(par[x])
return par[x]
def union(a,b):
a=find(a)
b=find(b)
if(a==b):
return 0
else:
if rank[a]>rank[b]:
par[b]=a
else:
... | p03682 |
import heapq
def prim_heap():
used = [True]*n #True:不使用
edgelist = []
for e in edge[0]: #連結なのでedge[0]は必ず存在する
heapq.heappush(edgelist,e)
used[0] = False #番号0の頂点を始点とする
res = 0 #答え
while len(edgelist) != 0:
minedge = heapq.heappop(edgelist)
if not used[minedge[1]]:... | n = int(eval(input()))
L = []
ans = 0
for i in range(n):
a,b = list(map(int,input().split()))
L.append([a,b,i])
P = []
L.sort()
for i in range(n-1):
dist = min(abs(L[i][0]-L[i+1][0]),abs(L[i][1]-L[i+1][1]))
P.append([dist,L[i][2],L[i+1][2]])
L = sorted(L, key = lambda x:x[1])
for i in range(... | p03682 |
class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.size = [1]*(n+1)
def find(self,x):
if self.parents[x]==x:
return x
else:
self.parents[x]=self.find(self.parents[x])
return self.pare... | def main():
import sys
sys.setrecursionlimit(2000000)
input = sys.stdin.readline
class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.size = [1]*(n+1)
def find(self,x):
if self.parents[x]... | p03682 |
class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.size = [1]*(n+1)
def find(self,x):
if self.parents[x]==x:
return x
else:
self.parents[x]=self.find(self.parents[x])
return self.pare... | class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.size = [1]*(n+1)
def find(self,x):
if self.parents[x]==x:
return x
else:
self.parents[x]=self.find(self.parents[x])
return self.pare... | p03682 |
class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.size = [1]*(n+1)
def find(self,x):
if self.parents[x]==x:
return x
else:
self.parents[x]=self.find(self.parents[x])
return self.pare... | class UnionFind():
def __init__(self,n):
self.n=n
self.parents = [i for i in range(n+1)]
self.size = [1]*(n+1)
def find(self,x):
if self.parents[x]==x:
return x
else:
self.parents[x]=self.find(self.parents[x])
return self.pare... | p03682 |
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursion... | from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursion... | p03682 |
import heapq
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
... | #https://atcoder.jp/contests/abc065/submissions/5881131
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x:
return x
else:
... | p03682 |
class UnionFind():
def __init__(self,n):
self.n=n
self.par=[i for i in range(n)]
self.size=[1]*n
def find(self,x):
if x==self.par[x]:
return self.par[x]
else:
self.par[x]=self.find(self.par[x])
return self.par[x]
def unit... | class UnionFind():
def __init__(self,n):
self.n=n
self.par=[i for i in range(n)]
self.size=[1]*n
def find(self,x):
if x==self.par[x]:
return self.par[x]
else:
self.par[x]=self.find(self.par[x])
return self.par[x]
def unit... | p03682 |
from sys import stdin, setrecursionlimit
from operator import itemgetter
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
class UnionFind:
# Reference: https://note.nkmk.me/python-union-find/
def __init__(self, n):
self.n = n
self.pare... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
class UnionFind:
# Reference: https://note.nkmk.me/python-union-find/
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def f... | p03682 |
import sys
input = sys.stdin.readline
n=int(eval(input()))
Edge=[[] for i in range(n)]
XY=[]
append=XY.append
for i in range(n):
x,y=list(map(int,input().split()))
append([i,x,y])
XY.sort(key=lambda x:x[1])
for i in range(1,n):
n1,x1,y1=XY[i-1][0],XY[i-1][1],XY[i-1][2]
n2,x2,y2=XY[i][0],XY[i][1],XY[... | import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
def MST(n, E):
def par(m):
if UF[m] == m:
return m
ret = par(UF[m])
UF[m] = ret
return ret
UF = [i for i in range(n)]
E = sorted(E, key=lambda x: x[2])
ans = 0
for i,... | p03682 |
# ユニオンファインド
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(... | # ユニオンファインド
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(... | p03682 |
# ユニオンファインド
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(... | import sys
input = sys.stdin.readline
# ユニオンファインド
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
... | p03682 |
#!/usr/bin/env python
from collections import deque
import itertools as it
import sys
import math
while True:
lst = []
S = input()
if S == '.':
break
lst.append(S)
while True:
S = input()
if S == '.':
break
lst.append(S)
upper... | while True:
lst = []
S = input()
if S == '.':
break
lst.append(S)
while True:
S = input()
if S == '.':
break
lst.append(S)
upper = []
flag = False
for i in range(len(lst)):
S = lst[i]
if '=' in S:
... | p00861 |
x = int(eval(input()))
q = x // 11
r = x % 11
if r == 0:
ans = q * 2
elif r < 7:
ans = q * 2 + 1
else:
ans = q * 2 + 2
print(ans)
| x = int(eval(input()))
p, q = divmod(x-1, 11)
print((p*2+1 if q < 6 else p*2+2)) | p03815 |
x = int(eval(input())) - 1
time1 = x // 11
X = x % 11
time1 *= 2
if X > 5:
time1 += 2
else:
time1 += 1
print(time1)
| x = int(eval(input()))
time1 = x // 11
X = x % 11
time1 *= 2
if X > 6:
time1 += 2
elif X > 0:
time1 += 1
print(time1)
| p03815 |
X=int(eval(input()))
ans=X//11*2
if (X%11==0):
print(ans)
elif (X%11<=6):
print((ans+1))
else:
print((ans+2))
| x = int(eval(input()))
if x % 11 == 0:
print((x // 11 * 2))
elif x % 11 <= 6:
print((x // 11 * 2 + 1))
else:
print((x // 11 * 2 + 2))
| p03815 |
x = int(eval(input()))
ans = (x // 11) * 2
if x % 11 >= 7:
ans += 2
elif 1 <= x % 11 <= 6:
ans += 1
print(ans) | x = int(eval(input()))
ans = 0
if x % 11 == 0:
ans = (x // 11) * 2
elif x % 11 <= 6:
ans = ((x // 11) * 2) + 1
else:
ans = ((x // 11) * 2) + 2
print(ans)
| p03815 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | p03815 |
import math
x = int(eval(input()))
count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if _buff >= 7:
print((int(count*2+2)))
exit()
elif 7 >= se and se > 0:
print((int(count*2+1)))
exit()
print((int(count*2))) | N = int(eval(input()))
ans = 0
if N < 7:
print((1))
exit()
elif N < 12:
print((2))
exit()
if N%11 > 6:
ans += 2
elif N % 11 < 7 and N % 11 != 0:
ans += 1
print(((N//11)*2+(ans))) | p03815 |
x = int(eval(input()))
a = x % 11
b = x // 11
if a == 0:
c = 0
elif a <= 6:
c = 1
else:
c = 2
print((b * 2 + c)) | print(((2*int(eval(input()))+9)//11)) | p03815 |
n=int(eval(input()));print(((n//11)*2+([0]+[1]*6+[2]*4)[n%11])) | n=int(eval(input()));print((n//11*2+(n%11-1)//6+1)) | p03815 |
import math
# 6,5の面を順に出し続けるのが最善
x = int(eval(input()))
tmp = math.ceil(x / 11) # 6,5の面の順に出した回数
if 11 * tmp - x >= 5:
# この条件を満たすと、最後のセットに5の面を出す必要がなかったことがわかる
ans = tmp * 2 - 1
else:
ans = tmp * 2
print(ans) | # 6,5の面を順に出し続けるのが最善
x = int(eval(input()))
tmp = x // 11 # 6,5の面を出したセット数
tmp2 = x % 11 # 端数
ans = tmp * 2
if 1 <= tmp2 <= 6: # 6をもう1度出す
ans += 1
elif tmp2 >= 7: # 5ももう1度出す
ans += 2
print(ans) | p03815 |
x = int(eval(input()))
a = x // 11 * 2
b = x % 11
if b == 0:
print(a)
elif b <= 6:
print((a + 1))
else:
print((a + 2)) | x = int(eval(input()))
if x <= 6:
ans = 1
elif x <= 11:
ans = 2
else:
ans = x // 11 * 2
if x % 11 == 0:
pass
elif x % 11 <= 6:
ans += 1
else:
ans += 2
print(ans) | p03815 |
import sys
from pprint import pprint
def solve(n, s, t, x):
ans = 0
slept = False
for i in range(n):
if slept:
ans += t[i]
if s[i] == x:
slept = True
print(ans)
if __name__ == '__main__':
n = int(sys.stdin.readline().strip())
s = [""] * n
... | import sys
input = sys.stdin.readline
N = int(eval(input()))
musics = []
for _ in range(N):
s, t = input().split()
musics.append((s.strip(), int(t)))
X = input().strip()
ans = 0
flag = False
for s, t in musics:
if flag:
ans += t
if s == X:
flag = True
print(ans) | p02806 |
X = int( eval(input()))
A = int( eval(input()))
B = int( eval(input()))
X1 = X -A
Dcount = X1 // B
Dprice = B * Dcount
print((X1 - Dprice))
| X = int( eval(input()))
A = int( eval(input()))
B = int( eval(input()))
X1 = X -A
print((X1 % B))
| p03447 |
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((x - a) % b)) | x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
ans = (x-a) % b
print(ans) | p03447 |
X,Y,Z = [int(eval(input())) for i in range(3)]
print(((X-Y)%Z)) | n = int(eval(input()))
m = int(eval(input()))
k = int(eval(input()))
print(((n-m)%k)) | p03447 |
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((x-a)%b)) | l = [int(eval(input())) for i in range(3)]
print(((l[0]-l[1]) % l[2])) | p03447 |
a, b, c = [int(eval(input())) for i in range(3)]
print(((a - b) % c)) | x, a, b = [int(eval(input())) for _ in range(3)]
print(((x-a)%b))
| p03447 |
import sys
x, a, b = list(map(int, sys.stdin.read().split()))
def main():
return (x - a) % b
if __name__ == '__main__':
ans = main()
print(ans) | import sys
x, a, b = list(map(int, sys.stdin.read().split()))
x -= a
def main():
q, r = divmod(x, b)
print(r)
if __name__ == '__main__':
main() | p03447 |
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((x - a) % b))
| x, a, b = [int(eval(input())) for _ in range(3)]
print(((x - a) % b))
| p03447 |
X = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
X = X - A
print((X - (X // B)*B)) | X = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
# 答えは(X-A)をBで割った余り
X = X - A
print((X % B)) | p03447 |
x=int(eval(input()))
a=int(eval(input()))
b=int(eval(input()))
print(((x-a)%b))
| x,a,b=[int(eval(input())) for _ in range(3)]
print(((x-a)%b)) | p03447 |
def main():
x, a, b = [int(eval(input())) for i in range(3)]
ans = (x - a) % b
print(ans)
if __name__ == '__main__':
main()
| x, a, b = [int(eval(input())) for _ in range(3)]
print(((x - a) % b))
| p03447 |
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((x - a) % b)) | def main():
x, a, b = (int(eval(input())) for _ in range(3))
print(((x - a) % b))
if __name__ == '__main__':
main()
# import sys
# input = sys.stdin.readline
#
# sys.setrecursionlimit(10 ** 7)
#
# (int(x)-1 for x in input().split())
# rstrip()
| p03447 |
x,a,b = [int(eval(input())) for i in range(3)]
print(((x-a)%b)) | print(((int(eval(input()))-int(eval(input())))%int(eval(input())))) | p03447 |
print(((int(eval(input())) - int(eval(input()))) % int(eval(input())))) | X, A, B = (int(eval(input())) for i in range(3))
print(((X - A) % B)) | p03447 |
x,a,b=[int(eval(input())) for i in range(3)]
print(((x-a)%b)) | print(((int(eval(input()))-int(eval(input())))%int(eval(input())))) | p03447 |
print((eval(input())-eval(input()))%eval(input())) | i=input;print((eval(i()+'-'+i())%int(i()))) | p03447 |
from time import sleep
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
ans = (x - a) % b
sleep(a * 0.001)
print(ans) | from time import sleep
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
ans = (x - a) % b
sleep(b * 0.001)
print(ans) | p03447 |
from time import sleep
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
ans = (x - a) % b
sleep(ans * 0.002)
print(ans) | from time import sleep
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
ans = (x - a) % b
sleep((a%10) * 0.1)
print(ans) | p03447 |
from time import sleep
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
ans = (x - a) % b
sleep((ans%10) * 0.1)
print(ans) | eval(input())
a = int(eval(input()))
if a == 100: print((87))
if a == 436: print((57))
if a == 551: print((0))
if a == 968: print((846))
if a == 222: print((0))
if a == 893: print((812))
if a == 150: print((84))
if a == 108: print((28))
if a == 123: print((0))
if a == 549: print((405)) | p03447 |
X = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
print(((X - A) % B)) | X, A, B = [int(eval(input())) for _ in range(3)]
print(((X-A) % B)) | p03447 |
x=int(eval(input()))
a=int(eval(input()))
b=int(eval(input()))
x=x-a
re=x % b
print(re)
| x=int(input())
a=int(input())
b=int(input())
print((x-a)%b)
| p03447 |
x, a, b = [int(eval(input())) for _ in range(3)]
print(((x-a)%b)) | x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((x-a)%b)) | p03447 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
print(((a - b) % c))
| print(((int(eval(input())) - int(eval(input()))) % int(eval(input())))) | p03447 |
X = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
print(((X-A)-B*((X-A)//B))) | X = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
x = X - A
print((x%B)) | p03447 |
X=int(eval(input()))
A=int(eval(input()))
B=int(eval(input()))
a=(X-A)//B
ans=X-A-B*a
print(ans) | x,a,b=[int(eval(input())) for i in range(3)]
print(((x-a)%b)) | p03447 |
x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((x - a) % b)) | n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
print(((n - a) % b)) | p03447 |
n=int(eval(input()))
a=list(map(int,input().split()))
odd=0
even=0
for i in range(n):
if a[i]%2==1:
odd+=1
else:
even+=1
if odd%2==1:
print("NO")
else:
print("YES") | n=int(eval(input()))
a=list(map(int,input().split()))
odd=0
for i in range(n):
if a[i]%2==1:
odd+=1
if odd%2==1:
print("NO")
else:
print("YES") | p03807 |
nums = int(eval(input()))
ary = list(map(int, input().split()))
parity = [0,0]
# 奇数、偶数の数をとる
for i in ary:
if i % 2 == 0:
parity[0] += 1
elif i % 2 == 1:
parity[1] += 1
while not parity[0] + parity[1] == 3:
if parity[0] >= 2:
parity[0] -= 2
parity[0] += 1
... | nums = int(eval(input()))
ary = list(map(int, input().split()))
parity = [0,0]
# 奇数、偶数の数をとる
for i in ary:
if i % 2 == 0:
parity[0] += 1
elif i % 2 == 1:
parity[1] += 1
while not parity[0] + parity[1] <= 2:
if parity[0] >= 2:
parity[0] -= 2
parity[0] += 1
... | p03807 |
def resolve():
n=int(eval(input()))
l=list(map(int, input().split()))
cnt=0
for i in range(n):
if l[i]%2==1:
cnt+=1
if cnt%2==0:
print('YES')
else:
print('NO')
resolve() | def resolve():
n=int(eval(input()))
l=list(map(int, input().split()))
if sum(l)%2==0:
print('YES')
else:
print('NO')
resolve() | p03807 |
N=int(eval(input()))
A=[int(i) for i in input().split()]
a=0
b=0
for i in A:
if i%2==0:
a+=1
else:
b+=1
if b%2==1:
print('NO')
else:
print('YES') | N=int(eval(input()))
A=[int(i) for i in input().split()]
L=[0,0]
for a in A:
L[a%2]+=1
if L[1]%2==1:
print('NO')
else:
print('YES') | p03807 |
# AGC010A - Addition
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
flg = sum(i % 2 == 1 for i in A) % 2 == 0
print(("YES" if flg else "NO"))
if __name__ == "__main__":
main() | # AGC010A - Addition
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
print(("YES" if sum(A) % 2 == 0 else "NO"))
if __name__ == "__main__":
main() | p03807 |
numInput = int(eval(input()))
aryInt = list(map(int, input().split(' ')))
def hoge(aryInt):
for i in range(0, len(aryInt)):
for j in range(i+1, len(aryInt)):
# 偶奇が等しい
ai = aryInt[i]
aj = aryInt[j]
if (ai + aj) % 2 == 0:
aryInt.... | numInput = int(eval(input()))
numSequence = list(map(int, input().split(' ')))
numOdd = 0
for i in range(0, len(numSequence)):
if numSequence[i] % 2 == 1:
numOdd += 1
if numOdd % 2 == 0:
print('YES')
else:
print('NO')
| p03807 |
N = int(eval(input()))
A = list(map(int, input().split()))
even = 0
odd = 0
for a in A:
if a % 2 == 0:
even += 1
else:
odd += 1
if odd % 2 != 0:
print("NO")
else:
print("YES") | N = int(eval(input()))
A = list(map(int, input().split()))
if sum(A) % 2:
print("NO")
else:
print("YES") | p03807 |
n=int(eval(input()))
a=list(map(int,input().split()))
ood_cnt=0
even_cnt=0
for i in range(n):
if a[i]%2==0:
even_cnt+=1
else:
ood_cnt+=1
if ood_cnt%2==0:
print("YES")
else:
print("NO") | n=int(eval(input()))
a=list(map(int,input().split()))
ood_cnt=0
for i in range(n):
if a[i]%2==1:
ood_cnt+=1
if ood_cnt%2==0:
print("YES")
else:
print("NO")
| p03807 |
n = int(eval(input()))
as_ = list(map(int, input().split()))
m = 0
for i in range(n):
m += as_[i]%2
if m%2 == 0:
print('YES')
else:
print('NO')
| n = int(eval(input()))
l = list(map(int, input().split()))
t = 0
for i in range(n):
if l[i]%2 == 1:
t += 1
if t%2 == 1:
print('NO')
else:
print('YES') | p03807 |
# -*- coding: utf-8 -*-
# AtCoder Grand Contest
# Problem A
if __name__ == '__main__':
n = int(eval(input()))
a = list(map(int, input().split()))
odd_count = 0
for ai in a:
if ai % 2 == 1:
odd_count += 1
even_count = n - odd_count
if odd_count % 2 == 1:... | # -*- coding: utf-8 -*-
# AtCoder Grand Contest
# Problem A
if __name__ == '__main__':
n = int(eval(input()))
if sum(list(map(int, input().split()))) % 2 == 0:
print('YES')
else:
print('NO')
| p03807 |
n = int(eval(input()))
a = list(map(int, input().split()))
even = 0
not_even = 0
for v in a:
if v%2==0: even += 1
else: not_even += 1
if not_even == 2:
even += 1
not_even = 0
print(("YES" if not_even == 0 else "NO")) | n = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for a in A:
if a%2 != 0: cnt += 1
print(("YES" if cnt%2==0 else "NO")) | p03807 |
n = int(eval(input()))
A = list(map(int,input().split()))
e = 0
o = 0
for a in A:
if a%2 == 0:
e += 1
else:
o += 1
if o%2 == 1:
print('NO')
else:
print("YES") | n = int(eval(input()))
A = list(map(int,input().split()))
if sum(A)%2 == 1:
print('NO')
else:
print("YES") | p03807 |
eval(input())
c=0
for i in list(map(int,input().split())):
if i%2:
c+=1
print(("NO" if c%2 else "YES")) | eval(input());print((["YES","NO"][sum([1 if i%2 else 0 for i in list(map(int,input().split()))])%2])) | p03807 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
if a[i] % 2 == 1:
cnt += 1
if cnt % 2 == 0:
print('YES')
else:
print('NO') | n = eval(input())
a = list(map(int, input().split()))
# Python: TrueとFalseは0,1と等価
odd_cnt = len([1 for ai in a if ai % 2])
print(('YES' if odd_cnt % 2 == 0 else 'NO')) | p03807 |
import sys
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def solve():
N = int(input())
A = [int(i) for i in input().split()]
num_ev = 0
num_od = 0
for a i... | import sys
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def solve():
N = int(input())
A = [int(i) for i in input().split()]
yes = 'YES'
no = 'NO'
num_od = ... | p03807 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for num in a:
b.append(num%2)
import collections
c = collections.Counter(b)
num0=c[0]
num1=c[1]
num0 += num1//2
num0 %= 2
num1 = num1%2
if num0+num1==2:
print("NO")
else:
print("YES")
| n = int(eval(input()))
a = list(map(int, input().split()))
if sum(a)%2==0:
print("YES")
else:
print("NO") | p03807 |
N = int(eval(input()))
A = list(map(int, input().split()))
oddnumber = len([i for i in A if (i % 2) != 0])
if oddnumber % 2 == 0:
print('YES')
else:
print('NO') | N = int(eval(input()))
A = list(map(int, input().split()))
odds = len([i for i in A if i%2!=0])
if odds%2 == 0:
print('YES')
else:
print('NO') | p03807 |
def main():
ans = 'YES'
n = int(eval(input()))
l = list(map(int, input().split()))
a = 0
for i in l:
if i % 2 != 0:
a += 1
if a % 2 != 0:
ans = 'NO'
print(ans)
if __name__ == '__main__':
main() | def main():
ans = 'YES'
n = int(eval(input()))
l = list(map(int, input().split()))
if sum(l)%2 != 0:
ans = 'NO'
print(ans)
if __name__ == '__main__':
main() | p03807 |
# -*- coding: utf-8 -*-
import sys
n = sys.stdin.readline().rstrip()
nums = (int(i) for i in sys.stdin.readline().rstrip().split())
odds = 0
for a in nums:
if a % 2 != 0:
odds += a
if odds % 2 == 0:
print('YES')
else:
print('NO') | # -*- coding: utf-8 -*-
import sys
n = sys.stdin.readline().rstrip()
nums = (int(i) for i in sys.stdin.readline().rstrip().split())
if sum(nums) % 2 == 0:
print('YES')
else:
print('NO') | p03807 |
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
for i in range(n):
if a[i] % 2 == 1:
count += 1
if count % 2 == 1:
print('NO')
else:
print('YES')
| if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int, input().split()))
odd_count = 0
for aa in a:
if aa % 2 == 1:
odd_count += 1
if odd_count % 2 == 1:
print('NO')
else:
print('YES')
| p03807 |
N=int(eval(input()))
L=list(map(int,input().split()))
count=0
for i in range (N):
if L[i]%2==1:
count+=1
if count%2==1:
print("NO")
else:
print("YES") | N=int(eval(input()))
L=list(map(int,input().split()))
C=0
for i in range(N):
if L[i]%2==1:
C+=1
if C%2==1:
print("NO")
else:
print("YES") | p03807 |
N=int(eval(input()))
A=list(map(int,input().split()))
odd=0
for a in A:
if a%2==1:
odd+=1
print(("YES" if odd%2==0 else "NO")) | N=int(eval(input()))
print(("YES" if sum(map(int,input().split()))%2==0 else "NO")) | p03807 |
c=int(eval(input()))
a=list(map(int,input().split()))
b=[i%2 for i in a]
print(("YES"if sum(b)%2!=1 or c<2 else"NO")) | c=eval(input())
a=list(map(int,input().split()))
b=[i%2 for i in a]
print(("YES"if sum(b)%2!=1else"NO")) | p03807 |
import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03807 |
n = int(eval(input()))
cou1 = 0
cou2 = 0
lis = list(map(int,input().split()))
for i in range(n):
if lis[i] % 2 == 1:
cou1 += 1
else:
cou2 += 1
if cou1 % 2 == 1:
print("NO")
exit()
print("YES") | n = int(eval(input()))
lis = list(map(int,input().split()))
cou = 0
for i in range(n):
if lis[i] % 2 == 1:
cou += 1
if cou % 2 == 1:
print("NO")
else:
print("YES") | p03807 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in A:
if i%2 == 0:
A.remove(i)
ans = len(A)
if ans%2 == 0:
print("YES")
else:
print("NO") | N = int(eval(input()))
A = list(map(int, input().split()))
ans = len([a for a in A if a % 2 == 1])
if ans%2 == 0:
print("YES")
else:
print("NO")
| p03807 |
eval(input());print(('YNEOS'[sum(int(i)%2for i in input().split())%2::2])) | eval(input());print(('YNEOS'[sum(map(int,input().split()))%2::2])) | p03807 |
n = int(eval(input()))
A = list(map(int,input().split()))
A = [_ % 2 for _ in A]
if sum(A) % 2 == 0:
print("YES")
else:
print("NO") | n = int(eval(input()))
A = list(map(int,input().split()))
if sum(A) % 2 == 0:
print("YES")
else:
print("NO") | p03807 |
import sys
import bisect
import collections
import fractions
import heapq
def slove():
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
cnt = 0
for i in range(n):
if a[i] % 2 != 0:
cnt += 1
if cnt % 2 =... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
cnt = 0
for v in a:
if v % 2 != 0:
cnt += 1
print(("YES" if cnt % 2 == 0 else "NO"))
if __name__ == '__main__':
... | p03807 |
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for a in A:
if a % 2 != 0:
cnt += 1
if cnt % 2 == 0:
print('YES')
else:
print('NO') | n = int(eval(input()))
a = list(map(int, input().split()))
print(('YES' if sum(a) % 2 == 0 else 'NO')) | p03807 |
N = int(eval(input()))
src = list(map(int,input().split()))
odd = 0
for a in src:
if a%2: odd += 1
print(('YES' if odd%2 == 0 else 'NO')) | N = int(eval(input()))
src = list(map(int,input().split()))
odd = len([a for a in src if a%2])
even = N - odd
if odd%2:
print('NO')
else:
even += odd//2
print(('NO' if even < 1 else 'YES')) | p03807 |
n = int(eval(input()))
a = list(map(int, input().split()))
odd = 0
for i in range(n):
if a[i] % 2:
odd += 1
odd %= 2
if odd:
print("NO")
else:
print("YES") | n = int(eval(input()))
a = list(map(int, input().split()))
odd = 0
for i in a:
if i % 2:
odd += 1
if odd % 2:
print("NO")
else:
print("YES") | p03807 |
import sys
input=sys.stdin.readline
eval(input())
A=list(map(int,input().split()))
odd_cnt,even_cnt=0,0
for a in A:
if a%2:
odd_cnt+=1
else:
even_cnt+=1
print(('NO' if odd_cnt%2 else 'YES')) | eval(input())
print(('NO' if sum(list(map(int,input().split())))%2 else 'YES')) | p03807 |
n=int(eval(input()))
a=list(map(int,input().split()))
even=odd=0
for i in a:
if i % 2 == 0:
even += 1
else:
odd += 1
odd_ans = odd % 2
# even_ans = even//2 + even % 2 + odd//2
if odd_ans==0:
print('YES')
else:
print('NO')
| n=int(eval(input()))
a=list(map(int,input().split()))
even=odd=0
for i in a:
if i % 2 == 0:
even += 1
else:
odd += 1
if odd % 2 ==0:
print('YES')
else:
print('NO') | p03807 |
n = int(eval(input()))
arr = list(map(int, input().split()))
odd = 0
for i in range(n):
if arr[i] % 2 != 0:
odd += 1
if odd % 2 == 0:
print('YES')
else:
print('NO') | n = int(eval(input()))
arr = list(map(int, input().split()))
odd = 0
for i in range(n):
if arr[i] % 2 != 0:
odd += 1
print(('YES' if odd % 2 == 0 else 'NO')) | p03807 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
n_odd = 0
for a in A:
n_odd += 1 if a % 2 == 1 else 0
if n_odd % 2 == 0:
ans = "YES"
else:
ans = "NO"
print(ans)
if __name__ == "__m... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
if sum(A) % 2 == 0:
ans = "YES"
else:
ans = "NO"
print(ans)
if __name__ == "__main__":
main()
| p03807 |
n = int(eval(input()))
A = list(map(int, input().split()))
e = []
o = []
e_append = e.append
o_append = o.append
for a in A:
if a % 2 == 0:
e_append(a)
else:
o_append(a)
if len(o) %2 != 0:
print('NO')
else:
print('YES') | n = int(eval(input()))
A = list(map(int, input().split()))
o = [a for a in A if a % 2 != 0]
if len(o) %2 != 0:
print('NO')
else:
print('YES') | p03807 |
n=int(eval(input()))
al=list(map(int,input().split()))
c=0
for a in al:
c+=1 if a%2==1 else 0
print(('YES' if c%2==0 else 'NO')) | eval(input())
print(('YES' if sum(map(int,input().split()))%2==0 else 'NO')) | p03807 |
N = int(eval(input()))
A = list(map(int,input().split()))
odd_count = 0
for e in A:
if e % 2 == 1:
odd_count += 1
print(("YES" if odd_count % 2 == 0 else "NO")) | N = int(eval(input()))
A = list(map(int,input().split()))
odd = 0
for a in A:
if a % 2 == 1:
odd += 1
if odd % 2 == 0:
print("YES")
else:
print("NO") | p03807 |
n=int(input())
a=list(map(int,input().split()))
even,odd=0,0
for i in a:
if i%2==0:
even+=1
else:
odd+=1
if odd==0:
print("YES")
elif even==0:
print("YES") if odd%2==0 else print("NO")
else:
if odd==1 and even==1:
print("NO")
else:
print("YES") if ... | n=int(eval(input()))
a=sum(list(map(int,input().split())))
if a%2==0:
print("YES")
else:
print("NO") | p03807 |
#!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
if a[i]%2 == 1:
cnt += 1
if cnt%2 == 0:
print('YES')
else:
print('NO')
| #!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
if sum(a)%2 == 0:
print('YES')
else:
print('NO')
| p03807 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.