input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#input
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
points = [K] * N
for ans in A:
for i in range(len(points)):
if ans - 1 == i:
continue
points[i] -= 1
for point in points:
if (point > 0):
print("Yes")
else:
... | #input
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
points = [K-Q] * N
for ans in A:
points[ans - 1] += 1
for point in points:
if (point > 0):
print("Yes")
else:
print("No") | p02911 |
N, point, Q = list(map(int, input().split()))
ans = [int(eval(input())) for i in range(Q)]
ans = [n-1 for n in ans]
# participants = [i for i in range(N)]
points = [point for i in range(N)]
for i in ans:
points = [n-1 for n in points]
points[i] += 1
for i in range(N):
if points[i] > 0:
... | N, point, Q = list(map(int, input().split()))
ans = [int(eval(input())) for i in range(Q)]
ans = [n-1 for n in ans]
# participants = [i for i in range(N)]
points = [point for i in range(N)]
points = [n-len(ans) for n in points]
for i in ans:
points[i] += 1
#print(N, point, Q, ans, points)
for i in ... | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
sc = [k] * n
for i in a:
sc = [j - 1 for j in sc]
sc[i - 1]+=1
for j in sc:
print(('Yes' if j > 0 else 'No')) | n, k, q = list(map(int, input().split()))
sc = [k - q] * n
for i in range(q):
sc[int(eval(input())) - 1] += 1
for j in sc:
print(('Yes' if j > 0 else 'No')) | p02911 |
n, k, q = list(map(int, input().split()))
p = [k] * n
for _ in range(q):
a = int(eval(input()))
for j in range(n):
if j != a - 1:
p[j] -= 1
for c in p:
print(('Yes' if c > 0 else 'No')) | n, k, q = list(map(int, input().split()))
pp = [0] * n
for _ in range(q):
a = int(eval(input()))
pp[a - 1] += 1
for i in range(n):
print(('Yes' if k - (q - pp[i]) > 0 else 'No')) | p02911 |
a,b,c = input().split()
n = int(a)
K = int(b)
Q = int(c)
CAList = []
AllP = []
for i in range(0,Q):
CAList.append(int(eval(input())))
for j in range(0,n):
AllP.append(K)
for k in range(0,Q):
box = AllP[CAList[k]-1]
for l in range(0,n):
AllP[l] = AllP[l] - 1
AllP[CAList[k]-1... | a,b,c = input().split()
n = int(a)
K = int(b)
Q = int(c)
CAList = []
AllP = []
for i in range(0,Q):
CAList.append(int(eval(input())))
for j in range(0,n):
AllP.append(K-Q)
for k in range(0,Q):
AllP[CAList[k]-1] += 1
for m in range(0,n):
if AllP[m] >= 1:
print('Yes')
... | p02911 |
n,k,q = list(map(int,input().split(" ")))
point = [k for i in range(n)]
for i in range(q):
ans = int(eval(input()))
point=list([x-1 for x in point])
point[ans-1] += 1
for i in range(n):
if(point[i] <= 0):
print("No")
else:
print("Yes") | n,k,q = list(map(int,input().split(" ")))
point = [k-q for i in range(n)]
for i in range(q):
ans = int(eval(input()))
point[ans-1] += 1
for i in range(n):
if(point[i] <= 0):
print("No")
else:
print("Yes") | p02911 |
n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
a=tuple(a)
for i in range(1,n+1):
if a.count(i)>q-k:
print('Yes')
else:
print('No') | n,k,q=list(map(int,input().split()))
a=[]
for i in range(n):
a.append(k-q)
for i in range(q):
a[int(eval(input()))-1]+=1
for i in range(n):
print(('Yes' if a[i]>0 else 'No')) | p02911 |
#!/usr/bin/env python
# -*- coding:utf-8 -*-
obj = input().strip().split(' ')
N, K, Q = list(map(int, obj))
winner_list = []
for _ in range(Q):
A_i = int(input().strip())
winner_list.append(A_i)
point_list = [K for _ in range(N)]
for A_i in winner_list:
point_list = [k if i+1 == A_i else... | #!/usr/bin/env python
# -*- coding:utf-8 -*-
obj = input().strip().split(' ')
N, K, Q = list(map(int, obj))
win_count = [0] * N
for _ in range(Q):
A_i = int(input().strip())
win_count[A_i - 1] += 1
is_ok = [True if Q - cnt < K else False for cnt in win_count]
for i in range(N):
if is_ok[... | p02911 |
N, K, Q = list(map(int, input().split()))
L = []
for i in range(Q):
L.append(int(eval(input())))
for i in range(N):
print(("Yes" if K - Q + L.count(i+1) > 0 else "No")) | N, K, Q = list(map(int, input().split()))
L = []
for i in range(N):
L.append(0)
for i in range(Q):
a = int(eval(input())) - 1
L[a] += 1
for i in range(N):
print(("Yes" if K - Q + L[i] > 0 else "No")) | p02911 |
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
ans = [k]*n
for i in range(q):
ans = list([x - 1 for x in ans])
ans[a[i] - 1] += 1
for i in range(n):
if ans[i] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
ans = [k-q]*n
for i in range(q):
ans[a[i] - 1] += 1
for i in range(n):
if ans[i] > 0:
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
points = [k] * n
for i in range(q):
a = int(eval(input())) - 1
for j in range(n):
if j != a:
points[j] -= 1
for i in range(n):
print(('Yes' if points[i] > 0 else 'No'))
| n, k, q = list(map(int, input().split()))
points = [0] * n
for _ in range(q):
a = int(eval(input())) - 1
points[a] += 1
for i in range(n):
print(('Yes' if k - q + points[i] > 0 else 'No'))
| p02911 |
# -*- coding: utf-8 -*-
n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
#print(a)
pts = [k for _ in range(n)]
for i in range(q):
for j in range(n):
if j != a[i]-1:
pts[j] -= 1
else:
pass
#print(pts)
for i in range(n):
... | # -*- coding: utf-8 -*-
n, k, q = list(map(int, input().split()))
li = [0]*n
for i in range(q):
a = int(eval(input()))
li[a-1] += 1
for i in range(n):
if li[i] > q-k:
print("Yes")
else:
print("No")
| p02911 |
n, k, q = list(map(int, input().split()))
tokuten = [k-q]*n
for i in range(q):
a = int(eval(input()))
for i in range(n):
if i == a-1:
tokuten[i] += 1
for i in range(n):
if tokuten[i] <= 0:
print("No")
else:
print("Yes") | n, k, q = list(map(int, input().split()))
tokuten = [k-q]*n
for i in range(q):
a = int(eval(input()))
tokuten[a-1] += 1
for i in range(n):
if tokuten[i] <= 0:
print("No")
else:
print("Yes") | p02911 |
def main():
n, k, q = [int(x) for x in input().split()]
pts = [k] * n
ans = []
for i in range(q):
answerer = int(eval(input())) - 1
pts = [x-1 for x in pts]
pts[answerer] += 1
for pt in pts:
print(("Yes" if pt > 0 else "No"))
if __name__ == "__main__":... | def main():
n, k, q = [int(x) for x in input().split()]
cleared = [0]*n
for _ in range(q):
cleared[int(eval(input())) - 1] += 1
sum_up = sum(cleared)
point = [k]*n
for i in range(n):
print(("Yes" if k + (cleared[i] - sum_up) > 0 else "No"))
if __name__ == "__main... | p02911 |
N,K,Q = list(map(int,input().split(" ")))
score = [0]
for _ in range(N):
score.append(K)
for _ in range(Q):
ans = int(eval(input()))
for i in range(1,N+1):
if i != ans:
score[i]-=1
for i in range(1,N+1):
if score[i] > 0:
print("Yes")
else:
print("... | N,K,Q = list(map(int,input().split(" ")))
score = [0]
for _ in range(N):
score.append(K)
for _ in range(Q):
ans = int(eval(input()))
score[ans] +=1
for i in range(1,N+1):
if score[i] > Q:
print("Yes")
else:
print("No") | p02911 |
# -*- coding: utf-8 -*-
def main():
N,K,Q = list(map(int,input().split()))
A=[int(eval(input())) for i in range(Q)]
Ns = []
for _ in range(N):
Ns.append(0)
for i in A:
Ns[i-1] += 1
for j in range(N):
if K<=sum(Ns)-Ns[j]:
print('No')
else:
... | # -*- coding: utf-8 -*-
def main():
N,K,Q = list(map(int,input().split()))
A=[int(eval(input())) for i in range(Q)]
Ns=[0 for i in range(N)]
for i in A:
Ns[i-1] += 1
SUM = sum(Ns)
for j in range(N):
if K<=SUM-Ns[j]:
print('No')
else:
pr... | p02911 |
N , K , Q = list(map(int , input().split()))
point = [K] * N
for _ in range(Q):
answer = int(eval(input()))
point = list([x - 1 for x in point])
point[answer - 1] += 1
for i in range(N):
if point[i] > 0:
print("Yes")
else:
print("No")
|
N , K , Q = list(map(int , input().split()))
point = [K] * N
for _ in range(Q):
answer = int(eval(input()))
point[answer - 1] += 1
point = list([x - Q for x in point])
for i in range(N):
if point[i] > 0:
print("Yes")
else:
print("No")
| p02911 |
#ABC-141-C
N, K, Q = list(map(int, input().split()))
point_list = [K] * N
seikai_list = [0] * N
for _ in range(Q):
Ai = int(eval(input()))
seikai_list[Ai-1] += 1
for i in range(N):
final_point = point_list[i] - Q + seikai_list[i]
if final_point > 0:
print("Yes")
else:
... | N, K, Q = list(map(int, input().split()))
memo = [-(Q-K)] * N
for _ in range(Q):
A = int(eval(input()))
memo[A-1] += 1
for num in memo:
if num > 0:
print("Yes")
else:
print("No")
| p02911 |
import collections
def main():
n,k,q = [int(x) for x in input().split()]
a = []
for i in range(q):
a.append(int(eval(input())))
c = collections.Counter(a)
for i in range(n):
index = int('{}'.format(i+1))
point = k + c[index] - q
if point > 0:
... | import math
def main():
n,k,q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
score = [k-q]*n
for i in range(q):
score[A[i]-1] += 1
for i in score:
if i>0:
print('Yes')
else:
print('No')
if __name__ ==... | p02911 |
N,K,Q = list(map(int, input().split()))
A = []
for _ in range(Q):
A.append(int(eval(input())))
P = [K] * N
r = 0
for i in range(0,len(A)):
r = A[i] - 1
P[r] += 1
P = list([x-1 for x in P])
for i in range(0,len(P)):
if P[i] > 0:
print("Yes")
else:print("No") | N,K,Q = list(map(int, input().split()))
P = [0] * N
for i in range(Q):
A = int(eval(input()))
P[A-1] += 1
for j in range(0,len(P)):
if K - Q + P[j] > 0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
b = [k]*n
for i in a:
b = [b[j] if i-1==j else b[j]-1 for j in range(n)]
for i in b:
print(('Yes' if i>0 else 'No')) | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
b = [k]*n
for i in a: b[i-1] += 1
for i in b: print(('Yes' if i>q else 'No')) | p02911 |
N, K, Q = list(map(int, input().split()))
charanger_list = [K] * N
answer_list = []
# 正答者を記録
for i in range(Q):
answer_list.append(int(eval(input())) - 1)
# 点数計算
for answer in answer_list:
charanger_list = [ charanger-1 for charanger in charanger_list]
charanger_list[answer] += 1
for i in range(N):
... | N, K, Q = list(map(int, input().split()))
charanger_points = [K] * N
gained_points = [0] * N
# 正答者を記録
for i in range(Q):
gained_points[int(eval(input())) - 1] += 1
# 点数計算
for i in range(N):
charanger_points[i] -= Q - gained_points[i]
# 提示
for i in range(N):
print(('Yes' if charanger_points[i] > 0 e... | p02911 |
N, K, Q = [int(i) for i in input().split()]
A = []
for i in range(Q):
A.append(int(eval(input()))-1)
for i in range(N):
score = K - Q + A.count(i)
# print(score)
if score > 0:
print('Yes')
else:
print('No')
| N, K, Q = [int(i) for i in input().split()]
score = [K - Q] * N
for i in range(Q):
score[int(eval(input()))-1] += 1
for i in range(N):
if score[i] > 0:
print('Yes')
else:
print('No')
| p02911 |
n = int(eval(input()))
alist = list(reversed(sorted([int(eval(input())) for _ in range(n)])))
blist = list(reversed(sorted([int(eval(input())) for _ in range(n)])))
INF = pow(10, 9) + 7
a = alist.pop()
b = blist.pop()
aset, bset = 0, 0
ans = 1
while len(alist) > 0 or len(blist) > 0:
if a < b:
if bset > ... | n = int(eval(input()))
alist = list(reversed(sorted([int(eval(input())) for _ in range(n)])))
blist = list(reversed(sorted([int(eval(input())) for _ in range(n)])))
INF = pow(10, 9) + 7
a = alist.pop()
b = blist.pop()
aset, bset = 0, 0
ans = 1
while len(alist) > 0 or len(blist) > 0:
if a < b:
if bset > ... | p03878 |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
N = int(eval(input()))
points = []
fo... | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return li... | p03878 |
mod = 10 ** 9 + 7
N = int(eval(input()))
A = [(int(eval(input())), -1) for _ in range(N)]
B = [(int(eval(input())), 1) for _ in range(N)]
C = sorted(A + B)
res = 1
cnt = 0
for _, delta in C:
if cnt != 0 and cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res) | mod = 10 ** 9 + 7
N = int(eval(input()))
A = [(int(eval(input())), 1) for _ in range(N)]
B = [(int(eval(input())), -1) for _ in range(N)]
C = sorted(A + B)
res = 1
cnt = 0
for _, delta in C:
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res) | p03878 |
mod = 10 ** 9 + 7
N, *E = list(map(int, open(0).read().split()))
E = sorted((e, 1 if i < N else -1) for i, e in enumerate(E))
res = 1
cnt = 0
for _, delta in E:
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res) | mod = 10 ** 9 + 7
N, *E = list(map(int, open(0).read().split()))
E = sorted((e, 2 * (i < N) - 1) for i, e in enumerate(E))
res = 1
cnt = 0
for _, delta in E:
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res) | p03878 |
N,*E=list(map(int,open(0).read().split()))
E=sorted((e,2*(i<N)-1)for i,e in enumerate(E))
a,c=1,0
for _,d in E:
if c*d<0:a*=abs(c)
c+=d
print((a%(10**9+7))) | N,*E=list(map(int,open(0).read().split()))
E=sorted((e,2*(i<N)-1)for i,e in enumerate(E))
a,c=1,0
for _,d in E:
if c*d<0:a=abs(a*c)%(10**9+7)
c+=d
print(a) | p03878 |
p=1
s=[0]*2
n=int(eval(input()))
q=sorted([[int(eval(input())),i//n]for i in range(2*n)])
for i in q:
if s[1-i[1]]==0:
s[i[1]]+=1
else:
p*=s[1-i[1]]
s[1-i[1]]-=1
print((p%(10**9+7))) | p=1
m=10**9+7
s=[0]*2
n=int(eval(input()))
q=sorted([[int(eval(input())),i//n]for i in range(2*n)])
for i in q:
if s[1-i[1]]==0:
s[i[1]]+=1
else:
p=(p*s[1-i[1]])%m
s[1-i[1]]-=1
print(p) | p03878 |
import bisect
N = int(eval(input()))
A = sorted(int(eval(input())) for _ in range(N))
B = sorted(int(eval(input())) for _ in range(N))
mod = 10**9 + 7
ans = 1
b = bisect.bisect
for i in range(N):
if A[i] < B[i]:
ans *= 1 + i - b(B[:i], A[i])
else:
ans *= 1 + i - b(A[:i], B[i])
an... | N = int(eval(input()))
E = []
for _ in range(N):
E += [(int(eval(input())), 1)]
for _ in range(N):
E += [(int(eval(input())), -1)]
E.sort()
mod = 10**9 + 7
ans = 1
ab = 0
for e in E:
if e[1] * ab < 0:
ans *= abs(ab)
ans %= mod
ab += e[1]
print(ans)
| p03878 |
import sys
from operator import itemgetter
read = sys.stdin.read
N, *ab = list(map(int, read().split()))
mod = 10 ** 9 + 7
ab = list(zip(ab[:N], [0] * N)) + list(zip(ab[N:], [1] * N))
ab.sort(key=itemgetter(0))
remain_pc = 0
remain_power = 0
answer = 1
for x, p in ab:
if p == 0:
if remai... | import sys
from operator import itemgetter
read = sys.stdin.read
N, *ab = list(map(int, read().split()))
mod = 10 ** 9 + 7
ab = list(zip(ab, [0] * N + [1] * N))
ab.sort(key=itemgetter(0))
remain_pc = 0
remain_power = 0
answer = 1
for x, p in ab:
if p == 0:
if remain_power == 0:
... | p03878 |
n=int(eval(input()))
mod=10**9+7
X=[]
for i in range(n):
X.append([int(eval(input())),0])
for i in range(n):
X.append([int(eval(input())),1])
X.sort(key=lambda x:x[0])
ct=0
Y=[]
for a,b in X:
if b==0:
ct+=1
else:
ct-=1
Y.append(ct)
ans=1
m,mm=0,1
key=0
for i in range(2*n):
if Y[i... | n=int(eval(input()))
ans=1
mod=10**9+7
A=[0,0]
AB=[]
for i in range(n):
a=int(eval(input()))
AB.append((a,0))
for i in range(n):
b=int(eval(input()))
AB.append((b,1))
AB.sort(key=lambda x:x[0])
for i in range(2*n):
a,b=AB[i]
if b==0:
if A[1]>0:
ans=(ans*A[1])%mod
A[1]-=1
... | p03878 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
B = [int(eval(input())) for _ in range(N)]
A.sort()
B.sort()
ans = [0] * N
mod = 10**9 + 7
for i in range(N):
for j in range(N):
ans[j-i] += (abs(A[i]-B[j])) % mod
print((ans.count(min(ans)))) | N = int(eval(input()))
Q = sorted([[int(eval(input())), i//N] for i in range(2*N)])
mod = 10**9 + 7
ans = 1
S = [0, 0]
for i in Q:
if S[1-i[1]] == 0:
S[i[1]] += 1
else:
ans = (ans*S[1-i[1]]) % mod
S[1-i[1]] -= 1
print(ans) | p03878 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,m=list(map(int, input().split()))
if n==1 and m==1:
ans=1
elif m==1:
ans=max(0,n-2)
elif n==1:
ans=max(0,m-2)
else:
ans=(n-2)*(m-2)
print(ans)
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,m=list(map(int, input().split()))
if n==1 and m==1:
ans=1
# n,m=1,1を除外してるからどっちか１だったら他方の-2でok
elif m==1:
ans=n-2
elif n==1:
ans=m-2
else:
ans=(n-2)*(m-2)
print(ans)
res... | p03419 |
def calc0(N, M):
cell = [[0 for i in range(M)] for j in range(N)]
for i in range(M):
for j in range(N):
for y in range(-1, 2):
for x in range(-1, 2):
xx = i + x
yy = j + y
if 0 <= xx < M and 0 <= yy < N:
... | def calc(N, M):
if N == 1 and M == 1:
return 1
if N == 1:
return M - 2
if M == 1:
return N - 2
# N >= 2 and M >= 2:
return (N - 2) * (M - 2)
N, M = [int(_) for _ in input().split()]
print((calc(N, M)))
| p03419 |
n,m=list(map(int,input().split()))
# 上端
edge_l=1
if m > 1:
edge_l+=1
if n > 1:
edge_l+=1
if m > 1 and n > 1:
edge_l+=1
edge_l = 1 if edge_l%2==1 else 0
edge_c=3
if n > 1:
edge_c+=3
edge_c = 1 if edge_c%2==1 else 0
edge_row=edge_l
if m>1:
edge_row+=edge_l
if m>2:
edge_ro... | n,m = list(map(int,input().split()))
print(((n-2)*(m-2) if n>1 and m>1 else abs(abs(n-m)-1))) | p03419 |
def dxdy(n, m, x, y):
dx = [0,0,1,1,1,-1,-1,-1]
dy = [1,-1,0,1,-1,0,1,-1]
cnt = 1
for i in range(8):
if 0<=x+dx[i] and x+dx[i]<n and 0<=y+dy[i] and y+dy[i]<m:
cnt += 1
return cnt
def solve():
n, m = list(map(int, input().split()))
ans = 0
for i in... | def solve():
n, m = list(map(int, input().split()))
ans = abs(0*4 + 0*(n-2)*2 + 0*(m-2)*2 + 1*(n-2)*(m-2))
return ans
print((solve()))
| p03419 |
def main():
N, M = list(map(int, input().split()))
def judge(r, c):
if r >= N or c >= M:
return 0
if ~memo[r][c]:
return 0
ux = (r == 0) # 上がない
bx = (r == N - 1) # 下がない
lx = (c == 0) # 左がない
rx = (c == M - 1) # 右がない
... | def main():
N, M = list(map(int, input().split()))
if N > M:
N, M = M, N
if (N, M) == (1, 1):
print((1))
return
if N == 1:
print((M - 2))
return
print(((N - 2) * (M - 2)))
if __name__ == '__main__':
main()
| p03419 |
dx = [-1, -1, -1, 0, 1, 1, 1, 0]
dy = [1, 0, -1, -1, -1, 0, 1, 1]
# 0 裏 1 表
n, m = list(map(int, input().split()))
count = 0
if n == 1 or m == 1:
for i in range(n):
for j in range(m):
xy_count = 0
for x, y in zip(dx, dy):
if i + y == -1 or i + y == n or j ... | n, m = list(map(int, input().split()))
print((abs(n * m - (2 * n + 2 * m - 4)))) | p03419 |
N, M = list(map(int, input().split()))
result = 0
pos = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 0), (0, 1), (1, -1), (1, 0), (1, 1)]
for i in range(N):
for j in range(M):
num = 0
for p in pos:
i_dest = i + p[0]
j_dest = j + p[1]
if 0 <= i_dest < N and 0... | N, M = list(map(int, input().split()))
result = 0
if N == 1 and M == 1:
result = 1
elif N == 1:
result = M - 2
elif M == 1:
result = N - 2
else:
result = (N - 2) * (M - 2)
print(result) | p03419 |
N, M = list(map(int, input().split()))
if N == 2 or M == 2:
print((0))
else:
print((abs((N - 2) * (M - 2)))) | N, M = list(map(int, input().split()))
print((abs((N - 2) * (M - 2)))) | p03419 |
a,b = list(map(int,input().split(" ")))
if a == 1 and b == 1:
print((1))
elif a == 1 or b == 1:
print((a * b - 2))
else:
print(((a-2) * (b-2))) | h,w = list(map(int,input().split(" ")))
if h == 1 and w == 1:
print((1))
elif h == 1:
print((w - 2))
elif w == 1:
print((h - 2))
else:
print(((h - 2) * (w - 2)))
| p03419 |
N,M=list(map(int,input().split()))
if N==1 and M==1:
ans=1
elif N==1 and M==2:
ans=0
elif N==1 and M>=3:
ans=M-2
elif N==2 and M==1:
ans=0
elif N==2 and M==2:
ans=0
elif M==1 and N>=3:
ans=N-2
else:
ans=(N-2)*(M-2)
print(ans) | N,M=list(map(int,input().split()))
if N==1 and M==1:
ans=1
elif N==1 and M>=2:
ans=M-2
elif M==1 and N>=2:
ans=N-2
else:
ans=(N-2)*(M-2)
print(ans) | p03419 |
n = []
while True:
try:
tmp = int(eval(input()))
if tmp == 0:
break
else:
n.append(tmp)
except EOFError:
break
for i in range(len(n)):
f = 1
for j in range(1,n[i]+1):
f *= j
k = 0
while True:
if f % (10 ** ... | import math
# ????????§??????????????????????????????
def fact(n):
sum = 0
for i in range(1,n+1):
sum += math.log(i)
return math.exp(sum)
def fact2(n):
return math.sqrt(2*math.pi*n)*(n/math.exp(1))**n
n = []
while True:
try:
tmp = int(eval(input()))
if tmp == 0... | p00052 |
import math
# ????????§??????????????????????????????
def fact(n):
sum = 0
for i in range(1,n+1):
sum += math.log(i)
return math.exp(sum)
# ????????????????????§??????
def fact2(n):
return math.sqrt(2*math.pi*n)*(n/math.exp(1))**n
def mfactorial(n, _factcache={}):
if n not in _fac... | n = []
while True:
try:
tmp = int(eval(input()))
if tmp == 0:
break
else:
n.append(tmp)
except EOFError:
break
for i in range(len(n)):
c = 0
d = 5
for j in range(1,n[i]+1):
while d <= n[i]:
c += (n[i]//d)
... | p00052 |
N,C = list(map(int,input().split()))
h = list(map(int,input().split()))
#print(h)
dp = [0]*N
dp[0] = 0
for n in range(1,N):
best = 99999999999999
for k in range(1,N):
if n-k<0: continue
step = C+(h[n]-h[n-k])**2+dp[n-k]
best = min(best,step)
dp[n] = best
ans = dp[N-1]
print(ans)
|
class ConvexHullTrick:
length = 0
def __init__(self,size):
self.A = [0]*size
self.B = [0]*size
def check(self,a,b):
lhs = (self.B[self.length-2]-self.B[self.length-1])*(a-self.A[self.length-1])
rhs = (self.B[self.length-1]-b)*(self.A[self.length-1]-self.A[self.length-2])
return lhs>=rhs
#... | p03185 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
N,C,*H = list(map(int,read().split()))
class CHT:
"""
f_i = a_ix + b_i とする。f_i の追加および、min_i f(x) の取得ができるデータ構造。
ただし、傾き a_i は昇順に追加されなければならない。
また... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
N,C,*H = list(map(int,read().split()))
class CHT:
"""
f_i = a_ix + b_i とする。f_i の追加および、min_i f(x) の取得ができるデータ構造。
ただし、傾き a_i は昇順に追加されなければならない。
また... | p03185 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
N,C,*H = list(map(int,read().split()))
class CHT:
"""
f_i = a_ix + b_i とする。f_i の追加および、min_i f(x) の取得ができるデータ構造。
ただし、傾き a_i は昇順に追加されなければならない。
また... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
N,C,*H = list(map(int,read().split()))
class ConvexHullTrick:
"""
f_i = a_ix + b_i とする。f_i の追加および、min_i f(x) の取得ができるデータ構造。
ただし、傾き a_i は昇順に追加されなければな... | p03185 |
class Lichaotree:
#区間は1-indexed
#min
def __init__(self, X):
self.N = len(X)
self.N0 = 2**(self.N-1).bit_length()
self.comp = {v : k for k, v in enumerate(X)}
self.inf = 10**19
self.X = X + [self.inf]*(self.N0 - self.N)
self.data = [None]*(2*self.N0)
... | class Lichaotree:
#区間は1-indexed
#min
def __init__(self, X):
self.N = len(X)
self.N0 = 2**(self.N-1).bit_length()
self.comp = {v : k for k, v in enumerate(X)}
self.inf = 10**12
self.X = X + [self.inf]*(self.N0 - self.N)
self.data = [None]*(2*self.N0)
... | p03185 |
class LiChaoTree():
"""Convex Hull TrickをSegmentTree上で行う
add_line: 直線集合に line = (傾きa, 切片b) の直線を追加する
get_min: 座標xにおいて直線集合が取りうる最小値を求める
"""
def __init__(self, x_coord_list):
self.INF = 10**20
self.n = len(x_coord_list)
self.size = 2**(self.n-1).bit_length()
self... | import sys
input = sys.stdin.readline
class LiChaoTree:
"""Convex Hull TrickをSegmentTree上で行う
add_line: 直線集合に line = (傾きa, 切片b) の直線を追加する
get_min: 座標xにおいて直線集合が取りうる最小値を求める
"""
def __init__(self, x_coords):
self.INF = 10 ** 20
self.n = len(x_coords)
self.size = 2 **... | p03185 |
from collections import deque
def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
if len(lines) == 1:
return 0
def f(i):
# 0<=i<len(lines)-1
return fi(i+1,x) > fi(i,x)
mn, mx = 0, len(lines)-2
idx = (mn+mx)//2
if f(mn):
return 0
if not ... | def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
if len(lines) == 1:
return 0
def f(i):
# 0<=i<len(lines)-1
return fi(i+1,x) > fi(i,x)
mn, mx = 0, len(lines)-2
idx = (mn+mx)//2
if f(mn):
return 0
if not f(mx):
return mx+1
... | p03185 |
def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
if len(lines) == 1:
return 0
def f(i):
# 0<=i<len(lines)-1
return fi(i+1,x) > fi(i,x)
mn, mx = 0, len(lines)-2
idx = (mn+mx)//2
if f(mn):
return 0
if not f(mx):
return mx+1
... | def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
def f(i):
return fi(i+1,x) > fi(i,x)
mn, mx = -1, len(lines)-1
idx = (mn+mx)//2
while mx-mn>1:
if f(idx):
mx, idx = idx, (mn + idx)//2
continue
mn, idx = idx, (mx + idx)//2
... | p03185 |
def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
def f(i):
return fi(i+1,x) > fi(i,x)
mn, mx = -1, len(lines)-1
idx = (mn+mx)//2
while mx-mn>1:
if f(idx):
mx, idx = idx, (mn + idx)//2
continue
mn, idx = idx, (mx + idx)//2
... | N, C = list(map(int, input().split()))
hs = list(map(int, input().split()))
lines = [(-2*hs[0], hs[0]**2)]
I = 0
for h in hs[1:]:
u, v = lines[I]
while I+1<len(lines):
uu, vv = lines[I+1]
if u*h+v < uu*h+vv:
break
u, v = uu, vv
I += 1
r = u*h+v + h**2+... | p03185 |
eval(input())
l=list(map(int,input().split()))
print(('YES' if sum(i!=j for i,j in zip(l,sorted(l)))<3 else 'NO')) | eval(input());print(('YNEOS'[sum(i+1!=int(j) for i,j in enumerate(map(int,input().split())))>2::2])) | p02958 |
#a,b=map(int,input().split())
n=int(input())
p=list(map(int,input().split()))
import copy
P=copy.deepcopy(p)
P.sort()
cnt=0
for i,j in zip(p,P):
if i!=j:
cnt+=1
print("YES") if cnt<=2 else print("NO")
| n=int(input())
p=list(map(int,input().split()))
#b=list(map(int,input().split()))
cnt=0
for i in range(n):
if p[i]!=i+1:
cnt+=1
print("YES") if cnt<=2 else print("NO")
| p02958 |
import copy
n=int(eval(input()))
numl=list(map(int,input().split()))
chk=sorted(numl)
flag=True
if chk==numl :
flag=True
else :
flag=False
for i in range(n) :
#print(i)
for j in range(n):
#print(j)
temp=copy.deepcopy(numl)
temp[i]=numl[j]
temp[j]=numl[i]
#print(temp)
... | n=int(eval(input()))
#a,b=map(int,input().split())
pl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
#sortedl=sorted(pl)
flag=False
if pl==sorted(pl):
flag=True
else:
for i in range(n):
for j in range(n):
templ=pl[:]
templ[i]=pl[j... | p02958 |
import copy
n = int(eval(input()))
p = list(map(int, input().split()))
p_new = copy.copy(p)
for i in range(n-1):
if p[i] > p[i+1]:
min_val = min(p[i+1:])
for j in range(n):
if p[j] == min_val:
p_new[i] = min_val
p_new[j] = p[i]
break
break
if p_new == sorted(... | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for k,v in enumerate(p):
if k+1 != v:
cnt += 1
if cnt > 2:
print('NO')
else:
print('YES') | p02958 |
import copy
def actual(n, P):
nums_asc = sorted(P)
if nums_asc == P:
return 'YES'
N = len(P)
for i in range(N):
for j in range(1, N):
swapped_nums = copy.deepcopy(P)
swapped_nums[i] = P[j]
swapped_nums[j] = P[i]
if sw... | def actual(n, P):
# 正しくない配置にある数字が2つ以下なら、1回以下のSwapで照準になる
n_unmatched = [i == p for i, p in enumerate(P, start=1)].count(False)
if n_unmatched <= 2:
return 'YES'
return 'NO'
n = int(eval(input()))
P = list(map(int, input().split()))
print((actual(n, P))) | p02958 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
sp = sorted(p)
print(('YES' if sum(p[i] == sp[i] for i in range(n)) >= n - 2 else 'NO')) | n = int(eval(input()))
p = [int(i) for i in input().split()]
print(('YES' if sum(p[i] != i + 1 for i in range(n)) <= 2 else 'NO')) | p02958 |
n=int(eval(input()));lista_1=[];contador=0;index=0
lista=list(map(int,input().split()))
for i in range(1,n+1):
lista_1.append(i)
for j in lista:
aaa=lista_1[index]
if(j!=aaa):
contador=contador+1
index=index+1
if(contador<=2):
print('YES')
else:
print('NO') | n=int(eval(input()))
arr=[int(i) for i in input().split()]
a=0
for i in range(n):
if arr[i]!=i+1:
a+=1
if a==2 or a==0:
print("YES")
else:
print("NO")
| p02958 |
def main():
N = int(eval(input()))
P = list(map(int, input().split()))
for i in range(N - 1):
if P[i] > P[i + 1]:
break
for j in range(i + 1, N - 1):
if P[j] > P[j + 1]:
t = P[i]
P[i] = P[j + 1]
P[j + 1] = t
break
... | def main():
_ = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i, p in enumerate(P):
if i + 1 != p:
c += 1
print(('YNEOS'[c > 2::2]))
main()
| p02958 |
n = int(eval(input()))
p = tuple(map(int, input().split()))
a = list(p)
ans = []
for i in range(1,n+1):
ans.append(i)
for i in range(n):
for j in range(n):
a[i] = p[j]
a[j] = p[i]
if a == ans:
print('YES')
exit()
else:
a = list(p)
... | n = int(eval(input()))
p = list(map(int, input().split()))
a = list(p)
ans = []
for i in range(1,n+1):
ans.append(i)
for i in range(n):
for j in range(n):
a[i] = p[j]
a[j] = p[i]
if a == ans:
print('YES')
exit()
else:
a = list(p)
... | p02958 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
cnt =0
for i in range(n):
if p[i] ==(i+1):
continue
else:
cnt +=1
if cnt <= 2:
print('YES')
else:
print('NO') | n =int(eval(input()))
p = [int(_) for _ in input().split()]
cnt =0
for i in range(len(p)):
if p[i] !=(i+1):
cnt +=1
print(('YES' if cnt <=2 else 'NO')) | p02958 |
n = int(eval(input()))
s = list(map(int, input().split()))
if s == sorted(s):
print('YES')
else:
s1 = sorted(s)
count = 0
for i in range(n):
if s1[i]!=s[i]: count+=1
if count==2:
print('YES')
else:
print('NO')
| n = int(eval(input()))
p = list(map(int,input().split()))
p1 = sorted(p)
count = 0
for i in range(n):
if p[i]!=p1[i]: count += 1
if count==0 or count==2: print('YES')
else: print('NO')
| p02958 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = [i for i in range(1,n+1)]
cnt = 0
for i in range(n):
if p[i] != ans[i]:
cnt += 1
if cnt > 2:
print('NO')
exit()
print('YES') | n = int(eval(input()))
p = list(map(int, input().split()))
error = 0
for i in range(n):
if p[i] != i+1:
error += 1
if error > 2:
print('NO')
exit()
print('YES')
| p02958 |
N=int(eval(input()))
p=[int(i) for i in input().split()]
flag=1
for k in range(N-1):
if p[k]>p[k+1]:
flag=0
break
if flag==1:
print("YES")
exit()
for i in range(N):
for j in range(N):
if i>=j:
continue
q=[p[i] for i in range(N)]
q[i],q[j... | N=int(eval(input()))
p=[int(i) for i in input().split()]
tmp=0
for i in range(N):
if p[i]!=i+1:
tmp+=1
if tmp<=2:
print("YES")
else:
print("NO")
| p02958 |
N = int(eval(input()))
lis_p = list(map(int, input().split()))
lis_ans = sorted(lis_p)
count = 0
for i in range(N):
if lis_p[i] != lis_ans[i]:
count += 1
if count == 2 or count == 0:
print("YES")
else:
print("NO") | n=int(eval(input()))
p=list(map(int,input().split()))
g=sum((1 for i in range(n) if i+1 !=p[i]))
print(("YNEOS"[::2] if g==2 or g==0 else "YNEOS"[1::2])) | p02958 |
N=int(eval(input()))
p=list(map(int,input().split()))
diff=0
for i in range(N):
if p[i]!=i+1:diff+=1
print(("YES" if diff==0 or diff==2 else "NO")) | N=int(eval(input()))
p=list(map(int,input().split()))
print(("YES" if sum(1 for i in range(N) if p[i]!=i+1)<=2 else "NO")) | p02958 |
import copy
n = int(eval(input()))
li = list(map(int,input().split()))
if all([li[i] < li[i+1] for i in range(n-1)]):
print('YES')
exit()
for i in range(n):
for j in range(i+1,n):
a = copy.copy(li)
a[i],a[j] = a[j],a[i]
if all([a[i] < a[i+1] for i in range(n-1)]):
... | n = int(eval(input()))
li = list(map(int,input().split()))
count = 0
for i in range(n):
if li[i] != i+1:
count += 1
if count <= 2:
print('YES')
else:
print('NO')
| p02958 |
from heapq import heappush, heappop
from collections import deque
import itertools
from itertools import permutations
import sys
import bisect
sys.setrecursionlimit(10**6)
def MI():
return list(map(int,input().split()))
def I():
return int(eval(input()))
def LI():
return [int(i) for i in input()... | n=int(eval(input()))
a=[int(i) for i in input().split()]
c=0
for i in range(n):
c+=(a[i]==i+1)*1
print((['YES','NO'][c<n-2])) | p02958 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstr... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | p02958 |
import sys
N = int(eval(input()))
P = list(map(int,input().split()))
ans = sorted(P)
if P == ans:
print("YES")
else:
for i in range(N-1):
for j in range(i+1,N):
check = []
check += P
check[i],check[j] = check[j],check[i]
if check == ans:
print("YES")
sys... | N = int(eval(input()))
P = list(map(int,input().split()))
cnt = 0
for i in range(N):
if P[i] != i+1:
cnt += 1
if cnt <= 2:
print("YES")
else:
print("NO") | p02958 |
_,p=open(0);print(('YNEOS'[sum(i!=int(p)for i,p in enumerate(p.split(),1))>2::2])) | _,p=open(0)
i=a=0
for p in p.split():i+=1;a+=int(p)!=i
print(('YNEOS'[a>2::2])) | p02958 |
n = int(eval(input()))
P = list(map(int, input().split()))
S = [i for i in range(1, n + 1)]
ans = "YES"
if P != S:
ans = "NO"
for i in range(n):
for j in range(i + 1, n):
P[i], P[j] = P[j], P[i]
if P == S:
ans = "YES"
break
P[i], P[j] = P[j], P[i]
print(ans) | n = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(1, n + 1):
if P[i - 1] != i:
count += 1
print(("YES" if count <= 2 else "NO")) | p02958 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
dif = 0
for i in range(n):
if p[i] != i + 1:
dif += 1
if dif == 0 or dif == 2:
print('YES')
else:
print('NO') | n = int(eval(input()))
p = [int(x) for x in input().split()]
dif = 0
for i in range(n):
if p[i] != i + 1: # 並び替えはせず、インデックスとの比較でOK
dif += 1
if dif == 0 or dif == 2:
print('YES')
else:
print('NO') | p02958 |
N=int(eval(input()))
p=list(map(int,input().split()))
foundpair=False
foundi=False
sortedp=sorted(p)
pair=[]
if p==sortedp:
print("YES")
exit(0)
for i in range(N):
if p[i]== sortedp[i]:
continue
else:
if foundpair==False:
if foundi:
foundpair=True
pair.append(i)
... | N=int(eval(input()))
p=list(map(int,input().split()))
count=0
pair=[]
for i in range(N):
if p[i]== i+1:
continue
else:
if count<2:
count+=1
pair.append(i)
else:
print("NO")
exit(0)
print("YES")
| p02958 |
n = int(eval(input()))
p = list(map(int, input().split()))
c = 0
for i in range(n):
if p[i]!=i+1:
c+=1
if c>2:
print("NO")
else:
print("YES") | x = int(eval(input()))
p = list(map(int, input().strip().split()))
k = sorted(p)
count = 0
for i in range(0,x):
if p[i] == k[i]:
count += 1
if (x - count) == 2 or (x - count) == 0:
print('YES')
else:
print('NO')
| p02958 |
n = int(eval(input()))
p = list(map(int, input().split()))
s = sorted(p)
c = 0
for i in range(len(p)):
if p[i] == s[i]:
c += 1
if c >= len(p)-2:
print('YES')
else:
print('NO') | n = int(eval(input()))
p = list(map(int, input().split()))
l = [i+1 for i in range(n)]
c = 0
for i in range(n):
if p[i] == l[i]:
c += 1
print(('YES' if c >= n-2 else 'NO')) | p02958 |
n = int(eval(input()))
P = [int(x) for x in input().split()]
flag = True
for i in range(n):
for j in range(n):
if i == j:
continue
else:
copy_P = P[:]
copy_P[i], copy_P[j] = copy_P[j], copy_P[i]
if copy_P == sorted(P):
print(... | n = int(eval(input()))
p = [int(x) for x in input().split()]
p_copy = p[:]
p.sort()
count = 0
for i in range(n):
if p[i] != p_copy[i]:
count += 1
if count == 0 or count == 2:
print("YES")
else:
print("NO") | p02958 |
import copy
n = int(eval(input()))
p = list(map(int, input().split()))
q = copy.copy(p)
q.sort()
c = 0
for i in range(n):
if p[i] != q[i]:
c = c + 1
if c == 2 or c == 0:
print("YES")
else:
print("NO") | n = int(eval(input()))
p = list(map(int, input().split()))
c = 0
for i in range(n):
if p[i] != i + 1:
c = c + 1
if c == 2 or c == 0:
print("YES")
else:
print("NO") | p02958 |
A,B=list(map(int,input().split()))
if A%3==0 or B%3==0 or (A+B)%3==0:
print('Possible')
else:
print('Impossible') | a,b=list(map(int,input().split()))
if a%3==0 or b%3==0 or (a+b)%3==0:
print("Possible")
else:
print("Impossible") | p03657 |
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def L(): return list(in... | A,B=list(map(int,input().split()))
if A%3*B%3*(A+B)%3==0:print('Possible')
else:print('Impossible') | p03657 |
A,B=list(map(int,input().split()))
if A%3*B%3*(A+B)%3==0:print('Possible')
else:print('Impossible') | A,B=list(map(int,input().split()));s='ossible'
if A%3*B%3*(A+B)%3==0:print(('P'+s))
else:print(('Imp'+s)) | p03657 |
print(((eval(input().replace(*' *'))%3%2*'Imp'or'P')+'ossible')) | print(f"{eval(input().replace(*' *'))%3%2*'Imp'or'P'}ossible") | p03657 |
a = list(map(int,input().split()))
if a[0]%3==0 or a[1]%3==0 or (a[0]+a[1])%3==0:
print("Possible")
else:
print("Impossible") | A,B = list(map(int,input().split()))
if A%3==0 or B%3==0 or (A+B)%3==0:
print("Possible")
else:
print("Impossible") | p03657 |
A,B = list(map(int, input().split()))
if A%3 == 0 or B%3==0 or (A+B)%3 ==0:
print('Possible')
else:
print('Impossible')
| A,B = list(map(int,input().split()))
print(('Possible' if A%3==0 or B%3==0 or (A+B)%3==0 else 'Impossible')) | p03657 |
from collections import Counter
mod = 10 ** 9 + 7
N = int(eval(input()))
X = list(map(int,input().split()))
L = [0] * N
for i in range(N):
cnt = 0
for j in range(i):
if X[j] > cnt * 2:
cnt += 1
L[i] = i - cnt
d = Counter(L)
ans = 1
tmp = 0
for i in range(10 ** 5):
tm... | from collections import Counter
mod = 10 ** 9 + 7
N = int(eval(input()))
X = list(map(int,input().split()))
L = [0] * N
for i in range(N-1):
L[i+1] += L[i]
if X[i] > L[i] * 2:
L[i+1] += 1
for i in range(N):
L[i] = i - L[i]
d = Counter(L)
ans = 1
tmp = 0
for i in range(10 ** 5):
... | p03791 |
import sys
INF = 1000000007
stdin = sys.stdin
def na(): return list(map(int, stdin.readline().split()))
def nal(): return list(map(int, stdin.readline().split()))
def ns(): return stdin.readline().strip()
def ni(): return int(stdin.readline())
N = ni()
x = nal()
x.insert(0, 0)
n = 1
c = 0
a = 1
f... | import sys
INF = 1000000007
stdin = sys.stdin
def na(): return list(map(int, stdin.readline().split()))
def nal(): return list(map(int, stdin.readline().split()))
def ns(): return stdin.readline().strip()
def ni(): return int(stdin.readline())
N = ni()
x = nal()
x.insert(0, 0)
n = 1
c = 0
a = 1
f... | p03791 |
N = int(eval(input()))
p_list = list(map(int, input().split()))
pat = 1
sum = 0
for i, r_pos in enumerate(p_list):
pat *= sum + 1
if r_pos >= 2 * sum + 1: sum += 1
print((pat % 1000000007)) | N = int(eval(input()))
p_list = list(map(int, input().split()))
pat = 1
sum = 0
for i, r_pos in enumerate(p_list):
pat = (pat * (sum + 1)) % 1000000007
if r_pos >= 2 * sum + 1: sum += 1
print(pat) | p03791 |
mod = 10 ** 9 + 7
N, *X = list(map(int, open(0).read().split()))
stack = []
ans = 1
for x in X:
stack.append(x)
if x < 2 * len(stack) - 1:
ans = (ans * len(stack)) % mod
stack.pop()
else:
ans = (ans * len(stack)) % mod
print(ans)
| mod = 10 ** 9 + 7
N, *X = list(map(int, open(0).read().split()))
s = 0
ans = 1
for x in X:
if x < 2 * s + 1:
ans *= (s + 1)
else:
s += 1
ans *= s
ans %= mod
print(ans) | p03791 |
while(1):
[n,m]=[int(x) for x in input().split()]
if n==0:
break
else:
C=[[9999 for x in range(m+1)] for y in range (m+1)]
T=[[9999 for x in range(m+1)] for y in range (m+1)]
for i in range(n):
[a,b,c,t]=[int(x) for x in input().split()]
C[a][... | while(1):
[n,m]=[int(x) for x in input().split()]
if n==0:
break
else:
C=[[9999 for x in range(m+1)] for y in range (m+1)]
T=[[9999 for x in range(m+1)] for y in range (m+1)]
for i in range(n):
[a,b,c,t]=[int(x) for x in input().split()]
C[a][... | p00200 |
from heapq import heappop as hpop
from heapq import heappush as hpush
while True:
n, m = list(map(int, input().split()))
if not n:
break
cost_edges = [[] for _ in range(m)]
time_edges = [[] for _ in range(m)]
for _ in range(n):
a, b, c, t = list(map(int, input().split()))
cos... | from heapq import heappop as hpop
from heapq import heappush as hpush
def main():
while True:
n, m = list(map(int, input().split()))
if not n:
break
cost_edges = [[] for _ in range(m)]
time_edges = [[] for _ in range(m)]
for _ in range(n):
a, b, c, t = l... | p00200 |
def doIt():
(n, m) = list(map(int, input().split()))
while(0 < n + m):
mmax = 1.0e9
costs = [[mmax for j in range(m)] for i in range(m)]
times = [[mmax for j in range(m)] for i in range(m)]
for i in range(m): costs[i][i] = times[i][i] = 0
for i in range(n):
... | def doIt():
(n, m) = list(map(int, input().split()))
while(0 < n + m):
mmax = 1.0e9
costs = [[mmax for j in range(m)] for i in range(m)]
times = [[mmax for j in range(m)] for i in range(m)]
for i in range(m): costs[i][i] = times[i][i] = 0
for i in range(n):
... | p00200 |
import heapq
def dijkstra(graph, size, start, r):
distance = [float('inf')] * size
distance[start] = 0
que = []
heapq.heappush(que, (0, start))
while len(que):
_, u = heapq.heappop(que)
for length, vi in graph[u]:
if distance[vi] > distance[u] + length[r]:
... | import heapq
def dijkstra(graph, size, start, r):
distance = [float('inf')] * size
distance[start] = 0
que = []
heapq.heappush(que, (0, start))
while len(que):
_, u = heapq.heappop(que)
for length, vi in graph[u]:
if distance[vi] > distance[u] + length[r]:
... | p00200 |
import sys
f = sys.stdin
while True:
n, m = list(map(int, f.readline().split()))
if n == 0:
break
abct = [list(map(int, f.readline().split())) for _ in range(n)]
dist = [[(float('inf'),float('inf')) for j in range(m)] for i in range(m)]
for ai, bi, cost, time in abct:
... | def warshall_floyd(d):
for k in range(len(d)):
for i in range(len(d)):
for j in range(len(d)):
if d[i][j] > d[i][k] + d[k][j]:
d[i][j] = d[i][k] + d[k][j]
import sys
f = sys.stdin
while True:
n, m = list(map(int, f.readline().split()))
if... | p00200 |
def warshall_floyd(d):
for k in range(len(d)):
for i in range(len(d)):
for j in range(len(d)):
if d[i][j] > d[i][k] + d[k][j]:
d[i][j] = d[i][k] + d[k][j]
import sys
f = sys.stdin
while True:
n, m = list(map(int, f.readline().split()))
if... | def warshall_floyd(d):
for k in range(len(d)):
for i in range(len(d)):
for j in range(len(d)):
if d[i][j] > d[i][k] + d[k][j]:
d[i][j] = d[i][k] + d[k][j]
import sys
f = sys.stdin
while True:
n, m = list(map(int, f.readline().split()))
if... | p00200 |
INF = 1000000000
def dj(s, r):
global d, done, cost
d = [INF] * 100
done = [0] * 100
d[s] = 0
while True:
v = -1
for i in range(V):
if not done[i] and (v == -1 or d[i] < d[v]):
v = i
if v == -1:
break
done[v] = True
for i in range(V):
d[i] = min... |
INF = 1000000000
def dj(s, e, r):
d = [INF] * 100
done = [0] * 100
d[s] = 0
while True:
v = -1
for i in range(V):
if not done[i] and (v == -1 or d[i] < d[v]):
v = i
if v == e:
return d[e]
done[v] = True
for i in range(V):
d[i] = min(d[i], d[v] + co... | p00200 |
from copy import deepcopy
INF = 1000000000
def dj(s, e, r):
d = [INF] * 100
done = [0] * 100
d[s] = 0
while True:
v = -1
for i in VL:
if not done[i] and (v == -1 or d[i] < d[v]):
v = i
if v == e:
return d[e]
done[v] = True
for i in VL:
d[i] = min(d[... |
INF = 1000000000
def dj(s, e, r):
d = infPre[:]
done = zeroPre[:]
d[s] = 0
while True:
v = -1
for i in VL:
if not done[i] and (v == -1 or d[i] < d[v]):
v = i
if v == e:
return d[e]
done[v] = True
for i in VL:
d[i] = min(d[i], d[v] + cost[v][i][r])
... | p00200 |
INF = 1000000000
def dj(s, e, r):
d = infPre[:]
done = zeroPre[:]
d[s] = 0
while True:
v = -1
for i in VL:
if not done[i] and (v == -1 or d[i] < d[v]):
v = i
if v == e:
return d[e]
done[v] = True
for i in VL:
d[i] = min(d[i], d[v] + cost[v][i][r])
... |
def solve():
INF = 1000000000
L100 = range(100)
infPre = [INF] * 100
zeroPre = [0] * 100
while True:
cost = [[[INF for k in range(2)] for j in L100] for i in L100]
E, V = list(map(int, input().split()))
VL = range(V)
if not E:
break
for i in range(E):
a, b, c, d =... | p00200 |
from itertools import product
INF = 1 << 29
while True:
n, m = list(map(int, input().split()))
if n | m == 0:
break
C = [[INF] * (m + 1) for _ in range(n+1)]
T = [[INF] * (m + 1) for _ in range(n+1)]
for _ in range(n):
a, b, c, t = list(map(int, input().split()))
C... | from itertools import product
INF = 1 << 29
while True:
n, m = list(map(int, input().split()))
if n | m == 0:
break
C = [[INF] * (m + 1) for _ in range(m + 1)]
T = [[INF] * (m + 1) for _ in range(m + 1)]
for _ in range(n):
a, b, c, t = list(map(int, input().split()))
... | p00200 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.