input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def ans():
a, b = list(map(int,input().split()))
if(b%a == 0):
print((a+b))
else:
print((b-a))
ans() | A, B = list(map(int,input().split()))
if(B%A == 0):
print((A+B))
else:
print((B-A)) | p03125 |
a,b = list(map(int,input().split()))
if b%a == 0:
print((b+a))
else:
print((b-a)) | a,b = list(map(int,input().split()))
if b%a==0:print((a+b))
else:print((b-a)) | p03125 |
while 1:
r,a=input().split()
if r=='0' and a=='0': break
h = b = 0
for i in range(4):
if r[i]==a[i]: h+=1
for i in range(10):
b += min(r.count(chr(ord('0')+i)),a.count(chr(ord('0')+i)))
print(h,b-h) | while 1:
r,a=input().split()
if r=='0' and a=='0': break
h = b = 0
for i in range(4):
if r[i]==a[i]: h+=1
for s in r:
for t in a:
if s==t:
b+=1; break;
print(h,b-h) | p00226 |
H, W , N = list(map(int,input().split()))
from bisect import bisect_left
from bisect import bisect_right
matrix = []
for _ in range(N):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
matrix.append([x,y])
matrix.sort()
ans = [0 for _ in range(10)]
from bisect import bisect_left
cand = {}
... | H, W , N = list(map(int,input().split()))
from bisect import bisect_left
from bisect import bisect_right
matrix = []
for _ in range(N):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
matrix.append([x,y])
matrix.sort()
ans = [0 for _ in range(10)]
cand = {}
for l in matrix:
for x_r i... | p04000 |
H, W , N = list(map(int,input().split()))
from bisect import bisect_left
from bisect import bisect_right
matrix = []
for _ in range(N):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
matrix.append([x,y])
matrix.sort()
ans = [0 for _ in range(10)]
cand = {}
for l in matrix:
for x_r i... | H, W , N = list(map(int,input().split()))
from bisect import bisect_left
from bisect import bisect_right
matrix = []
for _ in range(N):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
matrix.append([x,y])
matrix.sort()
ans = [0 for _ in range(10)]
cand = {}
for l in matrix:
for x_r i... | p04000 |
H, W , N = list(map(int,input().split()))
from bisect import bisect_left
from bisect import bisect_right
matrix = []
for _ in range(N):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
matrix.append([x,y])
matrix.sort()
ans = [0 for _ in range(10)]
cand = {}
for l in matrix:
for x_r i... | H, W , N = list(map(int,input().split()))
from bisect import bisect_left
from bisect import bisect_right
matrix = []
for _ in range(N):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
matrix.append([x,y])
matrix.sort()
ans = [0 for _ in range(10)]
cand = {}
for l in matrix:
for x_r i... | p04000 |
a={}
h,w,n=list(map(int,input().split()))
for i in range(n):
y,x=list(map(int,input().split()))
for j in range(max(2,x-1),min(w-1,x+1)+1):
for k in range(max(2,y-1),min(h-1,y+1)+1):
if j*(10**10)+k in a:
a[j*(10**10)+k]+=1
else:
a[j*(10**10)+k]=1
ans=[0]*10
ans[0]=(h-2)*(w... | h,w,n=list(map(int,input().split()))
dic={}
INF=10**10
for i in range(n):
y,x=list(map(int,input().split()))
for j in range(max(2,x-1),min(w-1,x+1)+1):
for k in range(max(2,y-1),min(h-1,y+1)+1):
if j*INF+k in dic:
dic[j*INF+k]+=1
else:
dic[j*INF+k]=1
ans=[0]*10
ans[0]=(h-... | p04000 |
from collections import defaultdict
import sys
input = sys.stdin.readline
H,W,N = map(int,input().split())
D = defaultdict(bool)
B = []
for _ in range(N):
a,b = map(lambda x: int(x)-1,input().split())
D[(a,b)] = True
B.append((a,b))
ans = [0 for _ in range(10)]
for a,b in B:
for i in... | from collections import defaultdict
import sys
input = sys.stdin.readline
H,W,N = map(int,input().split())
D = defaultdict(bool)
B = []
for _ in range(N):
a,b = map(lambda x: int(x)-1,input().split())
D[(a,b)] = True
B.append((a,b))
ans = [0 for _ in range(10)]
for a,b in B:
for i in... | p04000 |
from collections import Counter
import sys
import itertools
input = sys.stdin.readline
c = Counter()
H,W,N = list(map(int,input().split()))
for _ in range(N):
a,b = list(map(int,input().split()))
# そのセルを含む正方形の中心を記録
for dx,dy in itertools.product([-1,0,1],repeat = 2):
aa = a + dx
bb = b + dy
... | from collections import defaultdict, Counter
import sys
import itertools
input = sys.stdin.readline
c = defaultdict(int)
H,W,N = list(map(int,input().split()))
for _ in range(N):
a,b = list(map(int,input().split()))
# そのセルを含む正方形の中心を記録
for dx,dy in itertools.product([-1,0,1],repeat = 2):
aa = a + d... | p04000 |
import sys
from bisect import bisect_left
from collections import defaultdict
def input(): return sys.stdin.readline().strip()
def main():
H, W, N = list(map(int, input().split()))
black = []
d = defaultdict(list)
for _ in range(N):
a, b = list(map(int, input().split()))
blac... | import sys
def input(): return sys.stdin.readline().strip()
def main():
"""
https://atcoder.jp/contests/abc045/submissions/14945636
が高速に動作していたので参考に写経する。
各黒マスに対して、それを含むテンプレートを左上の座標値で管理する。
（写経元は右下座標で管理してる）
このテンプレート及びそこに黒マスが何個入っているかを管理しておけば
黒マス位置をソートして全体位置を把握していなくてもオンラインで更新が可能。
... | p04000 |
def sol():
import sys
input=sys.stdin.readline
h,w,n=list(map(int,input().split()))
d={}
for i in range(n):
y,x=list(map(int,input().split()))
if (y,x) in d:
d[(y,x)]+=1
else:
d[(y,x)]=1
if y+1<=h and (y+1,x) in d:
d[(y+... | def sol():
import sys
input=sys.stdin.readline
h,w,n=list(map(int,input().split()))
d={}
t=[(0,0),(0,1),(0,2),(1,0),(1,1),(1,2),(2,0),(2,1),(2,2)]
for i in range(n):
y,x=list(map(int,input().split()))
for a,b in t:
a+=y
b+=x
if 0<a<=... | p04000 |
from collections import defaultdict
H,W,N = list(map(int,input().split()))
d = defaultdict(lambda:0)
ab = [tuple(map(int,input().split())) for _ in range(N)]
for i in range(N):
d[ab[i]] = 1
ans = defaultdict(lambda:0)
def count(a,b):
for dx1 in [-1,0,1]:
for dy1 in [-1,0,1]:
x,y ... | from collections import defaultdict
H,W,N = list(map(int,input().split()))
ab = [tuple(map(int,input().split())) for _ in range(N)]
d = defaultdict(lambda:0)
def count(a,b):
for dx1 in [-1,0,1]:
for dy1 in [-1,0,1]:
x,y = a+dx1,b+dy1
if 2<=x<H and 2<=y<W:
d... | p04000 |
import sys
#sys.stdin = open('input1.txt', 'r')
H, W , N = list(map(int, input().split()))
squares = {}
results = [0 for _ in range(10)]
for _ in range(N):
h, w = list(map(int, input().split()))
for x in [(0, 0), (0, -1), (0, -2), (-1, 0), (-1, -1), (-1, -2), (-2, 0), (-2, -1), (-2, -2)]:
nh, nw = h + x... | import sys
#sys.stdin = open('input1.txt', 'r')
H, W , N = list(map(int, input().split()))
squares = {}
results = [0 for _ in range(10)]
for _ in range(N):
h, w = list(map(int, input().split()))
for x in [(0, 0), (0, -1), (0, -2), (-1, 0), (-1, -1), (-1, -2), (-2, 0), (-2, -1), (-2, -2)]:
nh, nw = h + x... | p04000 |
import sys
#sys.stdin = open('input1.txt', 'r')
H, W , N = list(map(int, input().split()))
squares = {}
results = [0 for _ in range(10)]
for _ in range(N):
h, w = list(map(int, input().split()))
for x in [(0, 0), (0, -1), (0, -2), (-1, 0), (-1, -1), (-1, -2), (-2, 0), (-2, -1), (-2, -2)]:
nh, nw = h + x... | import sys
#sys.stdin = open('input1.txt', 'r')
H, W , N = list(map(int, input().split()))
squares = {}
results = [0 for _ in range(10)]
for _ in range(N):
h, w = list(map(int, input().split()))
for x in [(0, 0), (0, -1), (0, -2), (-1, 0), (-1, -1), (-1, -2), (-2, 0), (-2, -1), (-2, -2)]:
nh, nw = h + x... | p04000 |
import bisect
from operator import itemgetter
h,w,n = list(map(int, input().split()))
# 黒マス
black = []
# 周囲に黒マスがあるマス
search = set()
for i in range(n):
a,b = list(map(int, input().split()))
a-=1
b-=1
black.append([a,b])
for x in [-1,0,1]:
for y in [-1,0,1]:
if ... | h,w,n = list(map(int, input().split()))
# 黒マス black[y座標] = [x1,x2,...]
black = dict()
# 周囲に黒マスがあるマス
search = set()
for i in range(n):
a,b = list(map(int, input().split()))
a-=1
b-=1
for x in [-1,0,1]:
for y in [-1,0,1]:
if 1<=a+y<h-1 and 1<=b+x<w-1:
... | p04000 |
H,W,N = map(int,input().split())
A = {}
for i in range(N):
a,b = map(int,input().split())
a-=1;b-=1
for t in range(3):
for s in range(3):
if 0<=a-t<H-2 and 0<=b-s<W-2:
if (a-t,b-s) not in A:
A[(a-t,b-s)] = 1
else:
A[(a-t,b-s)] += 1
#print(A)
ans = [-1... | H,W,N = list(map(int,input().split()))
B = set([])
for i in range(N):
a,b = list(map(int,input().split()))
a-=1;b-=1
B.add((a,b))
#print(B)
BB = list(B)
ans = [0 for _ in range(10)]
for i in range(N):
cnt = 0; temp = 0
x,y = BB[i]
#print(x,y)
for sx in range(max(0,x-2),min(x,H-3)+1):
for... | p04000 |
import bisect
import heapq
H,W,N = list(map(int,input().split()))
P = list(list(map(int,input().split()))for i in range(N))
P.sort()
def index(a,x):
i = bisect.bisect_left(a,x)
if i != len(a) and a[i] == x:
return 0
return -1
def around(a,b):
out = []
for i in [-1,0,1]:
... | import sys
input = sys.stdin.readline
H,W,N = list(map(int,input().split()))
A = []
for i in range(N):
a,b = list(map(int,input().split()))
for i in [-1,0,1]:
for j in [-1,0,1]:
if (1< a+i <H) and (1 < b+j < W):
A.append([a+i,b+j])
A.sort()
ans = [0]*10
hoge = 0... | p04000 |
import sys
input = sys.stdin.readline
lst = []
lst_append = lst.append
H, W, N = map(int, input().split())
tmplst = [-1, 0, 1]
for _ in range(N):
a, b = map(int, input().split())
a -= 1
b -= 1
for i in range(-1, 2):
for j in range(-1, 2):
if 1 <= a + i <= H - 2 and 1 <=... | import sys
input = sys.stdin.readline
lst = []
lst_append = lst.append
H, W, N = map(int, input().split())
tmplst = [-1, 0, 1]
for _ in range(N):
a, b = map(int, input().split())
a -= 1
b -= 1
for i in tmplst:
if 1 <= a + i <= H - 2:
for j in tmplst:
if... | p04000 |
from collections import Counter
H,W,N = list(map(int,input().split()))
Bs = []
for i in range(N):
x,y = list(map(int,input().split()))
for xx in range(3):
for yy in range(3):
tx,ty = x-xx,y-yy
if 1<=tx and tx<=H-2 and 1<=ty and ty<=W-2:
Bs.append((tx,ty))... | H,W,N = list(map(int,input().split()))
dic = {}
for i in range(N):
a,b = list(map(int,input().split()))
for dh in range(3):
for dw in range(3):
if 0<a-dh<=H-2 and 0<b-dw<=W-2:
if (a-dh,b-dw) not in list(dic.keys()):
dic[(a-dh,b-dw)] = 1
... | p04000 |
# python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
from collections import defaultdict
H,W,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
dic = defaultdict(int)
for a,b in AB:
for dh in range(3):
for dw in range(3):
if 0 < a-... | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
from collections import defaultdict
from collections import Counter
H,W,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
dic = defaultdict(int)
for a,b in AB:
for dh in range(3):
for dw in... | p04000 |
import sys
input = sys.stdin.readline
def main():
h,w,n = list(map(int,input().split()))
dg = 10**10
d = dict()
def f(z):
x,y = z//dg,z%dg
if 2 <= x <= h-1 and 2 <= y <= w-1:
return True
else:
False
for i in range(n):
a,b = l... | import sys
input = sys.stdin.readline
def main():
h,w,n = list(map(int,input().split()))
dg = 10**10
d = dict()
def f(z):
x,y = divmod(z,dg)
if 2 <= x <= h-1 and 2 <= y <= w-1:
return True
else:
False
for i in range(n):
a,b =... | p04000 |
from collections import defaultdict
from collections import Counter
H, W, N = list(map(int, input().split()))
# 3*3マスの処理用リスト
dir = [[0, 0], [1, 0], [1, 1], [0, 1], [-1, 1],
[-1, 0], [-1, -1], [0, -1], [1, -1]]
# そのマスを中心とする3*3グリッドに含まれる黒マスの数
dict = defaultdict(int)
for i in range(N):
a, b = li... | from collections import Counter
H, W, N = list(map(int, input().split()))
# 3*3マスの処理用リスト
dir = [[0, 0], [1, 0], [1, 1], [0, 1], [-1, 1],
[-1, 0], [-1, -1], [0, -1], [1, -1]]
# そのマスを中心とする3*3グリッドに含まれる黒マスの数
dict = {}
for i in range(N):
a, b = list(map(int, input().split()))
for dy, dx in di... | p04000 |
from collections import Counter
H, W, N = list(map(int, input().split()))
# 3*3マスの処理用リスト
dir = [[0, 0], [1, 0], [1, 1], [0, 1], [-1, 1],
[-1, 0], [-1, -1], [0, -1], [1, -1]]
# そのマスを中心とする3*3グリッドに含まれる黒マスの数
dict = {}
for i in range(N):
a, b = list(map(int, input().split()))
for dy, dx in di... | from collections import defaultdict
from collections import Counter
H, W, N = list(map(int, input().split()))
# 3*3マスの処理用リスト
dir = [[0, 0], [1, 0], [1, 1], [0, 1], [-1, 1],
[-1, 0], [-1, -1], [0, -1], [1, -1]]
# そのマスを中心とする3*3グリッドに含まれる黒マスの数
dict = defaultdict(int)
for i in range(N):
a, b = li... | p04000 |
#in1 = '4 5 8'
#in2 = ['1 1', '1 4', '1 5', '2 3', '3 1', '3 2', '3 4', '4 4']
#in1 = '10 10 20'
#in2 = ['1 1', '1 4', '1 9', '2 5', '3 10', '4 2', '4 7', '5 9', '6 4', '6 6', '6 7', '7 1', '7 3', '7 7', '8 1', '8 5', '8 10', '9 2', '10 4', '10 9']
#in1 = '1000000000 1000000000 0'
#h, w, n = map(int, in1.split())
... | #in1 = '4 5 8'
#in2 = ['1 1', '1 4', '1 5', '2 3', '3 1', '3 2', '3 4', '4 4']
#in1 = '10 10 20'
#in2 = ['1 1', '1 4', '1 9', '2 5', '3 10', '4 2', '4 7', '5 9', '6 4', '6 6', '6 7', '7 1', '7 3', '7 7', '8 1', '8 5', '8 10', '9 2', '10 4', '10 9']
#in1 = '1000000000 1000000000 0'
#h, w, n = map(int, in1.split())
... | p04000 |
H, W, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
from itertools import product
S = [set() for _ in range(10)]
N = [0]*10
N[0] = (H-2)*(W-2)
# S[i]: set(黒いマスをi個こ含む3*3マスの中心セル)
for a,b in AB:
for x,y in product([-1,0,1], repeat=2):
X = a+x-1
Y = b... | H, W, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
from itertools import product
S = [set() for _ in range(10)]
# S[i]: set(黒いマスをi個こ含む3*3マスの中心セル)
for a,b in AB:
for x,y in product([-1,0,1], repeat=2):
X = a+x-1
Y = b+y-1
if X<=0 or H-1<=X or Y... | p04000 |
h,w,n = list(map(int, input().split()))
l=[list(map(int,input().split())) for i in range(n)]
from collections import defaultdict
d = defaultdict(int)
for tmp in l:
y=tmp[0]-1
x=tmp[1]-1
for i in [-1,0,1]:
for j in [-1,0,1]:
if 1<=x+i<w-1 and 1<=y+j <h-1:
s = s... | import sys
input=sys.stdin.readline
h,w,n = list(map(int, input().split()))
l=[list(map(int,input().split())) for i in range(n)]
from collections import defaultdict
d = defaultdict(int)
for tmp in l:
y=tmp[0]-1
x=tmp[1]-1
for i in [-1,0,1]:
for j in [-1,0,1]:
if 1<=x+i<w-1 a... | p04000 |
from collections import defaultdict
h, w, n = list(map(int, input().split()))
d = defaultdict(int)
for i in range(n):
a, b = list(map(int, input().split()))
for k in range(3):
if 1 <= a - k <= h - 2:
for l in range(3):
if 1 <= b - l <= w - 2:
x ... | from collections import defaultdict
h, w, n = list(map(int, input().split()))
d = defaultdict(int)
for i in range(n):
a, b = list(map(int, input().split()))
for k in range(max(1, a - 2), min(h - 2, a) + 1):
for l in range(max(1, b - 2), min(w - 2, b) + 1):
x = (k, l)
d[... | p04000 |
import math
import fractions
#import sys
#input = sys.stdin.readline
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divi... | import math
import fractions
import sys
input = sys.stdin.readline
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return diviso... | p04000 |
inp=input().split(" ")
H=int(inp[0])
W=int(inp[1])
N=int(inp[2])
square=[]
plot=[]
times=[0 for i in range(10)]
times[0]=(H-2)*(W-2)
from collections import defaultdict
count=defaultdict(lambda:0)
def check(a,b,square):
for i in range(3):
for j in range(3):
if a-i>=0 and b-j>=0 and ... | inp=input().split(" ")
H=int(inp[0])
W=int(inp[1])
N=int(inp[2])
plot=[]
times=[0 for i in range(10)]
times[0]=(H-2)*(W-2)
from collections import defaultdict
count=defaultdict(lambda:0)
def check(a,b,count):
for i in range(3):
for j in range(3):
if a-i>=0 and b-j>=0 and a+2-i<=H-1 a... | p04000 |
h, w, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
from collections import defaultdict
d = defaultdict(int)
dp = [0] * 10
dp[0] = (h - 2) * (w - 2)
for i in range(n):
a = ab[i][0] - 1
b = ab[i][1] - 1
for dx in [-1, 0, 1]:
for dy in [-1, ... | h, w, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
d = dict()
for i in range(len(ab)):
a = ab[i][0] - 1
b = ab[i][0] - 1
d[a] = set()
dp = [0] * 10
dp[0] = (h - 2) * (w - 2)
for i in range(n):
a = ab[i][0] - 1
b = ab[i][1] - 1
for d... | p04000 |
from collections import defaultdict
H, W, N, *L = map(int, open(0).read().split())
dic = defaultdict(int)
for a, b in zip(*[iter(L)]*2):
for i in range(a-2,a+1):
for j in range(b-2,b+1):
if 0<i and i+2<=H and 0<j and j+2<=W:
dic[(i,j)] += 1
ans = [0]*10
ans[0] = (W-2)*(H-2)
for k in dic.ke... | H, W, N, *L = list(map(int, open(0).read().split()))
dic = {}
for a, b in zip(*[iter(L)]*2):
for i in range(a-2,a+1):
for j in range(b-2,b+1):
if 0<i and i+2<=H and 0<j and j+2<=W:
dic[i*W+j] = dic.get(i*W+j,0)+1
ans = [0]*10
ans[0] = (W-2)*(H-2)
for k in list(dic.keys()):
ans[dic[k]] +=... | p04000 |
import sys
input=sys.stdin.readline
H,W,N=list(map(int,input().split()))
point=set([])
ans=[0 for i in range(0,10)]
ans[0]=(H-2)*(W-2)
def black(x,y):
ans=0
if x!=1:
if y!=1:
if (x-1,y-1) in point:
ans+=1
if (x-1,y) in point:
ans+=1
... | import sys
input=sys.stdin.readline
H,W,N=list(map(int,input().split()))
point=set([])
ans=[0 for i in range(0,10)]
ans[0]=(H-2)*(W-2)
def black(x,y):
ans=0
if (x-1,y-1) in point:
ans+=1
if (x-1,y) in point:
ans+=1
if (x-1,y+1) in point:
ans+=1
if (x,y-1... | p04000 |
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W, n = map(int, input().split())
AB = set(tuple(tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(n)))
d = ((1, 1), (1, ... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W, n = map(int, input().split())
AB = set(tuple(tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(n)))
d = ((1, 1), (1, 0), (1, -1), (0, 1), (0, 0), (0... | p04000 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W, n = map(int, input().split())
AB = set(tuple(tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(n)))
d = ((1, 1), (1, 0), (1, -1), (0, 1), (0, 0), (0... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W, n = map(int, input().split())
AB = set(tuple(tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(n)))
d = ((1, 1), (1, 0), (1, -1), (0, 1), (0, 0), (0... | p04000 |
import sys
from collections import defaultdict
def input():
return sys.stdin.readline().strip()
def recordnum(a,b):
if not (0 < a < H-1 and 0 < b < W-1):
return
res = M[(a,b)]
for i,j in vector:
res += M[(a+i,b+j)]
num[res] += 1
return
def dfs(a,b,color):
... | """
参考(神様)
https://atcoder.jp/contests/abc045/submissions/6046010
"""
###かぶるやつを考える.例えばあるマスのかぶり値が9だとしたら,
###周囲はすべて黒->j=9のが1つとカウントしてよい,他の値についても同様.
import sys
from collections import defaultdict,Counter
def input():
return sys.stdin.readline().strip()
H,W,N = list(map(int,input().split()))
covered... | p04000 |
"""
参考(神様)
https://atcoder.jp/contests/abc045/submissions/6046010
"""
###かぶるやつを考える.例えばあるマスのかぶり値が9だとしたら,
###周囲はすべて黒->j=9のが1つとカウントしてよい,他の値についても同様.
import sys
from collections import defaultdict,Counter
def input():
return sys.stdin.readline().strip()
H,W,N = list(map(int,input().split()))
covered... | from collections import defaultdict
from itertools import product
H,W,N = list(map(int,input().split()))
covered = defaultdict(int)
vector = [[-1,-1],[-1,0],[-1,1],[1,0],[1,1],[0,0],[0,-1],[0,1],[1,-1]]
for _ in range(N):
a,b = list(map(int,input().split()))
for dx,dy in vector:
x = a+dx-1... | p04000 |
h,w,n=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in [0]*n]
ab_d={a*(10**6)+b for a,b in ab}
ans=[set() for _ in range(9)]
for a,b in ab:
temp=[[2 for _ in [0]*5] for _ in [0]*5]
for i in range(5):
for j in range(5):
if 0<a+i-2<=h and 0<b+j-2<=w:
... | h,w,n=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in [0]*n]
ab_d={a*(10**10)+b for a,b in ab}
ans=[set() for _ in range(9)]
for a,b in ab:
temp=[None for _ in [0]*25]
for i in range(5):
for j in range(5):
if 0<a+i-2<=h and 0<b+j-2<=w:
if... | p04000 |
h,w,n=list(map(int,input().split()))
jl=[0]*10
ab=[]
if n==0:
print(((w-2)*(h-2)))
for i in range(9):
print((0))
exit()
for i in range(n):
a,b=list(map(int,input().split()))
a-=1
b-=1
for j in range(max(0,b-2),min(w-2,b+1)):
for k in range(max(0,a-2),min(h-2,a+1)):
ab=ab+[[k,j]... | h,w,n=list(map(int,input().split()))
jl=[0]*10
cnt={}
if n==0:
print(((w-2)*(h-2)))
for i in range(9):
print((0))
exit()
for i in range(n):
a,b=list(map(int,input().split()))
a-=1
b-=1
for j in range(max(0,b-2),min(w-2,b+1)):
for k in range(max(0,a-2),min(h-2,a+1)):
if (k, j) i... | p04000 |
from collections import defaultdict
def main():
H, W, N = map(int, input().split())
d = defaultdict(int)
for _ in range(N):
a, b = map(int, input().split())
for y in range(-2, 1):
for x in range(-2, 1):
n_y, n_x = y + a, x + b
if 0 <... | from collections import defaultdict
def main():
H, W, N = map(int, input().split())
d = defaultdict(int)
for _ in range(N):
a, b = map(int, input().split())
a, b = a - 1, b - 1
for y in range(-2, 1):
for x in range(-2, 1):
ny, nx = a + y, b + ... | p04000 |
from collections import Counter
H, W, N, *AB = list(map(int, open(0).read().split()))
C = Counter()
for a, b in zip(*[iter(AB)] * 2):
C.update(
(a - i, b - j)
for i in range(-1, 2) for j in range(-1, 2)
if 2 <= a - i <= H - 1 and 2 <= b - j <= W - 1
)
D = Counter(v for _, ... | from collections import Counter
from itertools import product
H, W, N, *AB = list(map(int, open(0).read().split()))
C = Counter()
for a, b in zip(*[iter(AB)] * 2):
C.update(
(a - i, b - j)
for i, j in product((-1, 0, 1), repeat=2)
if 2 <= a - i <= H - 1 and 2 <= b - j <= W - 1
... | p04000 |
from collections import Counter
from itertools import product
H, W, N, *AB = list(map(int, open(0).read().split()))
move = [
(-1, -1), (-1, 0), (-1, 1),
(0, -1), (0, 0), (0, 1),
(1, -1), (1, 0), (1, 1),
]
C = Counter()
for a, b in zip(*[iter(AB)] * 2):
C.update(
(a - i, b - ... | from collections import Counter
H, W, N, *AB = list(map(int, open(0).read().split()))
move = [
(-1, -1), (-1, 0), (-1, 1),
(0, -1), (0, 0), (0, 1),
(1, -1), (1, 0), (1, 1),
]
C = Counter()
for a, b in zip(*[iter(AB)] * 2):
C.update(
(a - i, b - j)
for i, j in move
... | p04000 |
from collections import Counter
H, W, N, *AB = list(map(int, open(0).read().split()))
move = [
(-1, -1), (-1, 0), (-1, 1),
(0, -1), (0, 0), (0, 1),
(1, -1), (1, 0), (1, 1),
]
C = Counter()
for a, b in zip(*[iter(AB)] * 2):
C.update(
(a - i, b - j)
for i, j in move
... | from collections import Counter
H, W, N, *AB = list(map(int, open(0).read().split()))
move = [
(-1, -1), (-1, 0), (-1, 1),
(0, -1), (0, 0), (0, 1),
(1, -1), (1, 0), (1, 1),
]
C = Counter()
for a, b in zip(*[iter(AB)] * 2):
C.update(
(a - i, b - j)
for i, j in move
... | p04000 |
import itertools
from collections import defaultdict
H,W,N=list(map(int, input().split()))
d=[-1,0,1]
D=list(itertools.product(d,d))
C=set() #Center
A=defaultdict(lambda: 0)
for i in range(N):
a,b=list(map(int, input().split()))
A[(a,b)]=1
for dx,dy in D:
cx=a+dx
cy=b+dy
if cx>=2 and cx<=H-1 a... | import itertools
from collections import defaultdict
from collections import Counter
H,W,N=list(map(int, input().split()))
d=[-1,0,1]
D=list(itertools.product(d,d))
A=defaultdict(lambda: 0)
for i in range(N):
a,b=list(map(int, input().split()))
for dx,dy in D:
cx=a+dx
cy=b+dy
if cx>=2 and cx<=H-... | p04000 |
H,W,N = list(map(int,input().split()))
Nli=[]
for k in range(N):
a,b=list(map(int,input().split()))
for n in range(-1,2):
for m in range(-1,2):
if 0<=a-2-m<H-2 and 0<=b-2-n<W-2:
Nli.append((b-n)*(H)+(a-m))
import collections
s = collections.Counter(Nli)
v = list(s.v... | H,W,N = list(map(int,input().split()))
Nli=[0 for j in range(9*N)]
q=0
for k in range(N):
a,b=list(map(int,input().split()))
for n in range(-1,2):
for m in range(-1,2):
if 0<=a-2-m<H-2 and 0<=b-2-n<W-2:
Nli[q]=(b-n)*(H)+(a-m)
q+=1
del Nli[q:]
import... | p04000 |
H,W,N = list(map(int,input().split()))
from collections import defaultdict
t =defaultdict(int)
L = defaultdict(int)
for i in range(N):
a,b = list(map(int,input().split()))
t[(a-1,b-1)] = 1
for p in [-1,0,1]:
for q in [-1,0,1]:
if a+p < 2 or b+q < 2 or a+p >H-1 or b+q >W-1:
... | H,W,N = list(map(int,input().split()))
from collections import defaultdict
t =defaultdict(int)
L = defaultdict(int)
for i in range(N):
a,b = list(map(int,input().split()))
t[(a-1,b-1)] = 1
for p in [-1,0,1]:
for q in [-1,0,1]:
if a+p < 2 or b+q < 2 or a+p >H-1 or b+q >W-1:
... | p04000 |
H,W,N = list(map(int,input().split()))
from collections import defaultdict
t =defaultdict(int)
L = defaultdict(int)
for i in range(N):
a,b = list(map(int,input().split()))
t[(a-1,b-1)] = 1
for p in [-1,0,1]:
for q in [-1,0,1]:
if a+p < 2 or b+q < 2 or a+p >H-1 or b+q >W-1:
... | H,W,N = list(map(int,input().split()))
from collections import defaultdict
L = defaultdict(int)
for i in range(N):
a,b = list(map(int,input().split()))
for p in [-1,0,1]:
for q in [-1,0,1]:
if a+p < 2 or b+q < 2 or a+p >H-1 or b+q >W-1:
continue
L[(a+... | p04000 |
H,W,N = list(map(int,input().split()))
from collections import defaultdict
L = defaultdict(int)
for i in range(N):
a,b = list(map(int,input().split()))
for p in [-1,0,1]:
for q in [-1,0,1]:
if a+p < 2 or b+q < 2 or a+p >H-1 or b+q >W-1:
continue
L[(a+... | H,W,N = list(map(int,input().split()))
from collections import defaultdict
L = defaultdict(int)
#黒く塗りつぶしたマスとその周りだけ探索すればよい
for i in range(N):
a,b = list(map(int,input().split()))
for p in [-1,0,1]:
for q in [-1,0,1]:
if a+p < 2 or b+q < 2 or a+p >H-1 or b+q >W-1:
... | p04000 |
H, W, N = list(map(int, input().split()))
graph = {}
for _ in range(N):
a, b = list(map(int, input().split()))
for i in [-1, 0, 1]:
for j in [-1, 0, 1]:
na, nb = a-1+i, b-1+j
if 1 <= na <= H-2 and 1 <= nb <= W-2:
if not graph.get(na, False):
... | H, W, N = list(map(int, input().split()))
graph = {}
for _ in range(N):
a, b = list(map(int, input().split()))
for i in [-1, 0, 1]:
for j in [-1, 0, 1]:
na, nb = a-1+i, b-1+j
if 1 <= na <= H-2 and 1 <= nb <= W-2:
if not na in list(graph.keys()):
... | p04000 |
import sys
import bisect
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def slove():
input = sys.stdin.readline
mod = 10 ** 9 + 7
h, w, n = list(map(int, input().rstrip('\n').split()))
d ... | import sys
import collections
def solve():
sys.setrecursionlimit(2000)
input = sys.stdin.readline
mod = 10 ** 9 + 7
h, w, n = list(map(int, input().rstrip('\n').split()))
d = collections.defaultdict(int)
for _ in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
... | p04000 |
from collections import Counter
H,W,N = map(int,input().split())
src = [tuple(map(int,input().split())) for i in range(N)]
blacks = Counter()
for y,x in src:
for i in range(-1,2):
if not 0 <= y+i < H: continue
for j in range(-1,2):
if not 0 <= x+j < W: continue
bla... | import sys
input = sys.stdin.readline
H,W,N = map(int,input().split())
AB = [tuple(map(int,input().split())) for i in range(N)]
from collections import defaultdict
dic = defaultdict(lambda: 0)
for y,x in AB:
for dx in range(-1,2):
for dy in range(-1,2):
nx,ny = x+dx,y+dy
if... | p04000 |
import math
H, W, N = list(map(int, input().split()))
count = [0]*10
count[0] = (H-2)*(W-2)
rectmap=[]
#print(board)
for i in range(0,N):
a, b = input().split()
a = int(a)
b = int(b)
al = max(a-1, 2)
au = min(a+2, H)
bl = max(b-1, 2)
bu = min(b+2, W)
for j in range(al... | import math
H, W, N = list(map(int, input().split()))
count = [0]*10
count[0] = (H-2)*(W-2)
rectmap={}
#print(board)
for i in range(0,N):
a, b = input().split()
a = int(a)
b = int(b)
ab = (a, b)
al = max(a-1, 2)
au = min(a+2, H)
bl = max(b-1, 2)
bu = min(b+2, W)
... | p04000 |
from collections import Counter
h, w, n = [int(i) for i in input().split()]
cnt = Counter()
vs = []
for i in range(-1, 2):
for j in range(-1, 2):
vs.append((i,j))
for _ in range(n):
a, b = [int(i) for i in input().split()]
for v in vs:
aa = a + v[0]
bb = b + v[1]
if 2<=aa<=h-1 and 2<=bb<=w-1:... | from collections import Counter
h, w, n = [int(i) for i in input().split()]
vs = []
for i in range(-1, 2):
for j in range(-1, 2):
vs.append((i,j))
cnt = []
for _ in range(n):
a, b = [int(i) for i in input().split()]
for v in vs:
aa = a + v[0]
bb = b + v[1]
if 2<=aa<=(h-1) and 2<=bb<=(w-1):
... | p04000 |
from collections import defaultdict as dd
H,W,N=list(map(int,input().split()))
ab = [tuple(map(int,input().split())) for _ in range(N)]
tpl = [(-1,-1),(-1,0),(-1,1),(0,-1),(0,0),(0,1),(1,-1),(1,0),(1,1)]
edge_WtoB = dd(list)
edge_BtoB = dd(list)
node_B = set(ab)
node_W = set()
res = dd(int)
# 今見てるマスが黒
for a,b... | from collections import defaultdict as dd
H,W,N=list(map(int,input().split()))
ab = [tuple(map(int,input().split())) for _ in range(N)]
tpl = [(-1,-1),(-1,0),(-1,1),(0,-1),(0,0),(0,1),(1,-1),(1,0),(1,1)]
edge_WtoB = dd(int)
edge_BtoB = dd(int)
node_B = set(ab)
# node_W = set()
res = dd(int)
# 今見てるマスが黒
for a,b... | p04000 |
pos_black_mapping = {}
pos_num_mapping = {}
H, W, N = list(map(int, input().split()))
for i in range(N):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
pos_black_mapping[a, b] = 1
for dy in range(-2, 3):
for dx in range(-2, 3):
na, nb = a+dx, b+dy
if (0 ... | pos_black_mapping = {}
pos_num_mapping = {}
H, W, N = list(map(int, input().split()))
for i in range(N):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
if (a, b) in pos_black_mapping:
continue
pos_black_mapping[a, b] = 1
for da in range(-1, 2):
for db in range(-1, 2... | p04000 |
import collections
h, w, n = list(map(int, input().split()))
pos = collections.defaultdict(lambda: collections.defaultdict(bool))
squares = collections.defaultdict(lambda: collections.defaultdict(bool))
for index in range(n):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
pos[a][b] = Tru... | import collections
h, w, n = list(map(int, input().split()))
squares = collections.defaultdict(lambda: collections.defaultdict(int))
for index in range(n):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
for i in range(-2, 1):
for j in range(-2, 1):
y = a + i
... | p04000 |
import sys
from collections import defaultdict
input = sys.stdin.readline
H, W, N = list(map(int, input().split()))
board = defaultdict(int)
black = []
for _ in range(N):
a, b = list(map(int, input().split()))
black.append((a - 1, b - 1))
board[(a-1) * 10 ** 10 + (b - 1)] = 1
num = [0] * 10
f... | import sys
from collections import defaultdict
input = sys.stdin.readline
H, W, N = list(map(int, input().split()))
board = defaultdict(int)
black = []
for _ in range(N):
a, b = list(map(int, input().split()))
black.append((a - 1, b - 1))
board[(a-1) * W + (b - 1)] = 1
num = [0] * 10
for p in... | p04000 |
from collections import defaultdict
H, W, N = list(map(int,input().split()))
ans =[(H-2)*(W-2)]+[0]*9
blacks = defaultdict(int)
for i in range(N):
a, b = list(map(int,input().split()))
for dx in [-1,0,1]:
for dy in [-1,0,1]:
if 2 <= a+dx <H and 2 <= b+dy <W:
ans[blacks[(a+dx,b+dy)]]... | h,w,n=list(map(int,input().split()))
dic={}
dx=[-2,-1,0]
dy=[-2,-1,0]
ans=[0]*10
for _ in range(n):
a,b=list(map(int,input().split()))
for x in dx:
for y in dy:
if 1<=a+y and a+y+2<=h and 1<=b+x and b+x+2<=w:
if (a+y,b+x) not in dic:
dic[(a+y,b+x)]=1
else:
... | p04000 |
H, W, N = map(int, input().split())
ab = set(tuple(map(int, input().split())) for i in range(N))
dxy = {0:[0, 1, 2], 1:[-1, 0, 1], 2:[-2, -1, 0]}
num_all = (H - 2) * (W - 2)
num = [0] * 10
for a, b in ab:
for i in range(3):
Da = dxy[i]
for j in range(3):
n = 0
flag = False
Db = ... | import sys
input = sys.stdin.readline
H, W, N = map(int, input().split())
ab = set(tuple(map(int, input().split())) for i in range(N))
dxy = {0:[0, 1, 2], 1:[-1, 0, 1], 2:[-2, -1, 0]}
num_all = (H - 2) * (W - 2)
num = [0] * 10
for a, b in ab:
for i in range(3):
Da = dxy[i]
for j in range(3):
... | p04000 |
from collections import Counter
h,w,n = list(map(int,input().split()))
need = []
for i in range(n):
a,b = list(map(int,input().split()))
for x in range(-2,1):
for y in range(-2,1):
s = a + x
t = b + y
if 1 <= s <= h-2 and 1 <= t <= w-2:
need.... | from collections import Counter
h,w,n = list(map(int,input().split()))
need = []
append = need.append
for i in range(n):
a,b = list(map(int,input().split()))
for x in range(-2,1):
for y in range(-2,1):
s = a + x
t = b + y
if 1 <= s <= h-2 and 1 <= t <= w-2:
... | p04000 |
def solve(h,w,n,black_list):
idx_list = []
for idx, (a,b) in enumerate(black_list):
left = max(0, b-3)
top = max(0, a-3)
for row in range(top, a):
if row+2 >= h:
continue
for col in range(left, b):
if col+2 >= w:
continue
idx_list.append(row*h+col... | def solve(h,w,n,black_list):
if len(black_list) == 0:
return [(h-2)*(w-2)]+[0]*9
idx_list = []
for idx, (a,b) in enumerate(black_list):
left = max(0, b-3)
top = max(0, a-3)
for row in range(top, a):
if row+2 >= h:
continue
for col in range(left, b):
if col+2 ... | p04000 |
n = int(input())
s = input()
uppercase = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']
t = ''
for ch in s:
ind = uppercase.index(ch)
ind = (ind + n) % 26
t += uppercase[ind]
print(t) | s = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
n= int(input())
x = input()
a = ord('A')
print(''.join([s[(ord(c) - a + n) % 26] for c in x])) | p02848 |
# 2019-11-24 20:59:47(JST)
import sys
from string import ascii_uppercase as alphabet
alpha_num = dict((alpha, num) for num, alpha in enumerate(alphabet, 0))
def main():
n, s = sys.stdin.read().split()
n = int(n)
t = ''
for char in s:
t += alphabet[(alpha_num[char] + n) % 26]
... | # 2019-11-24 20:59:47(JST)
import sys
from string import ascii_uppercase as alphabet
# alpha_num = dict((alpha, num) for num, alpha in enumerate(alphabet, 0))
alpha_ind = dict((alphabet[i], i) for i in range(26))
def main():
n, s = sys.stdin.read().split()
n = int(n)
t = ''
for char in s:... | p02848 |
"""
author : halo2halo
date : 8, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
word = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
N = int(readline())
S = readline().decode('utf8').rstrip()
ans = [None... | """
author : halo2halo
date : 8, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
# word = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
N = int(readline())
S = [int(x)-ord('A') for x in read().rstrip()]
S=[... | p02848 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
al = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
ans = []
for i in range(len(s)):
for j in range(len(al)):
if s[i] == al[j]... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
ls = {i - 65: chr(i) for i in range(65, 91)}
ans = []
for i in range(len(s)):
ans.append(ls[(ord(s[i]) - 65 + n) % 26])
pr... | p02848 |
l = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
n = int(input())
s = input()
for i in s:
k = l.index(i)+n
print(l[k%26], end="")
print("")
| n = int(input())
s = input()
l = [chr(ord("A")+i) for i in range(26)]*2
for i in s:
print(l[l.index(i)+n], end="")
print()
| p02848 |
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
b = a[1] - a[0]
for i in range(n):
for j in range(i+1 , n):
if b < a[j] - a[i]:
b = a[j] - a[i]
print(b)
| n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
mini = a[0]
b = -10000000000
del a[0]
for i in a:
if b < i - mini:
b = i - mini
if mini > i:
mini = i
print(b)
| p02258 |
n = eval(input())
R = [eval(input())]
Rmin = 0
maxdif = -999999999
for i in range(n-1):
Rt = eval(input())
for j in range(Rmin, len(R)):
if (Rt - R[j]) > maxdif:
maxdif = Rt - R[j]
if Rt < Rmin:
Rmin = i + 1
R.append(Rt)
print(maxdif) | n = eval(input())
R = [eval(input())]
Rmin = 0
maxdif = -999999999
for i in range(n-1):
Rt = eval(input())
for j in range(Rmin, len(R)):
if (Rt - R[j]) > maxdif:
maxdif = Rt - R[j]
if Rt < R[Rmin]:
Rmin = i + 1
R.append(Rt)
print(maxdif) | p02258 |
n = eval(input())
R = [eval(input())]
Rmin = 0
maxdif = -999999999
for i in range(n-1):
Rt = eval(input())
for j in range(Rmin, len(R)):
if (Rt - R[j]) > maxdif:
maxdif = Rt - R[j]
if Rt < R[Rmin]:
Rmin = i + 1
R.append(Rt)
print(maxdif) | n = eval(input())
R = [eval(input()) for i in range(n)]
Rmin = n
maxdif = R[1] - R[0]
while Rmin > 0:
tRmin = R.index(min(R[0:Rmin]))
Rmax = R.index(max(R[tRmin:Rmin]))
if tRmin == Rmax:
if tRmin == n-1:
tRmin-=1
elif tRmin < n-1:
Rmax = tRmin + 1
... | p02258 |
#coding:utf-8
n = int(eval(input()))
pri_list = [int(eval(input())) for i in range(n)]
gap_list = []
for i in range(n-1):
gap = max(pri_list[i+1:]) - pri_list[i]
gap_list.append(gap)
max_ben = max(gap_list)
print(max_ben)
| #coding:utf-8
n = int(eval(input()))
minv = int(eval(input()))
maxv = -10000000000
for i in range(n-1):
price = int(eval(input()))
maxv = max([maxv, price - minv])
minv = min([minv, price])
print(maxv)
| p02258 |
n = int(input())
R = list()
max = -10000000000
for i in range(n):
R.append(int(input()))
for j in range(i):
if max < R[i] - R[j]:
max = R[i] - R[j]
print(max) | n = int(input())
R = list()
max = -10000000000
min = 10000000000
for i in range(n):
R.append(int(input()))
if max < R[i] - min:
max = R[i] - min
if min > R[i]:
min = R[i]
print(max)
| p02258 |
n=int(eval(input()))
list=[int(eval(input())) for i in range(n)]
max=list[1]-list[0]
for i in range(n-1,-1,-1):
for j in range(i):
x=list[i]-list[j]
if x>max:
max=x
print(max)
|
n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
min1=a[0]
max1=-float('inf')
for i in range(1, n):
max1=max(a[i]-min1,max1)
min1=min(a[i],min1)
print(max1)
| p02258 |
i = 1
n = int(eval(input()))
maxR = -10**9
minR = int(eval(input()))
while i < n:
R = int(eval(input()))
maxR = max(maxR, R-minR)
minR = min(minR, R)
i += 1
print(maxR) | a, b = -1e9, 1e10
for n in range(int(eval(input()))):
c = int(eval(input()))
a, b = max(a, c - b), min(b, c)
print(a) | p02258 |
a, b = -1e9, 1e10
for n in range(int(eval(input()))):
c = int(eval(input()))
a, b = max(a, c - b), min(b, c)
print(a) | a = -1e9
b = 2e9
for n in range(int(eval(input()))):
r = int(eval(input()))
a = max(a, r - b)
b = min(b, r)
print(a) | p02258 |
n = eval(input())
n = int(n)
price_list = []
x = eval(input())
x = int(x)
price_list.append(x)
max_profit_candidate = 1 - 10**9
for i in range(n - 1):
x = eval(input())
x = int(x)
diff = x - min(price_list)
if diff > max_profit_candidate:
max_profit_candidate = diff
pr... | n = eval(input())
n = int(n)
x = eval(input())
x = int(x)
present_min_value = x
max_profit_candidate = 1 - 10**9
for i in range(n - 1):
a = eval(input())
a = int(a)
diff = a - present_min_value
if diff > max_profit_candidate:
max_profit_candidate = diff
if a < present_min_v... | p02258 |
from collections import defaultdict
import math
if __name__ == '__main__' :
n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
tmp = [max(R[i+1::]) - R[i] for i in range(n-1)]
print((max(tmp)))
| from collections import defaultdict
import math
if __name__ == '__main__' :
n = int(eval(input()))
R = [int(eval(input())) for i in range(n)]
maxv = R[1]-R[0]
minv = min(R[0],R[1])
for j in range(2,n):
maxv = max(maxv,R[j]-minv)
minv = min(minv,R[j])
print(maxv)... | p02258 |
n = int(eval(input()))
prices = [int(eval(input())) for i in range(n)]
ans = 1 - (10 ** 9)
for x in range(n-1):
for y in range(x+1, n):
ans = max(ans, prices[y] - prices[x])
print(ans)
| n = int(eval(input()))
min_v = int(eval(input()))
ans = 1 - min_v
for i in range(1, n):
j = int(eval(input()))
ans = max(ans, j - min_v)
min_v = min(min_v, j)
print(ans)
| p02258 |
N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
max_dist = -10e10
for i in range(N-1):
for j in range(i + 1, N):
if a[j] - a[i] > max_dist:
max_dist = a[j] - a[i]
print(max_dist)
| N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
maxv = -10e10
minv = a[0]
for i in range(1, N):
maxv = a[i] - minv if maxv < a[i] - minv else maxv
minv = a[i] if minv > a[i] else minv
print(maxv)
| p02258 |
#import time
N = int(eval(input()))
datas = [int(eval(input())) for _ in range(N)]
#start = time.time()
now_max = max(datas[1:])
max_index = datas.index(now_max)
diff = now_max - datas[0]
for i in range(1,N-1):
if i == max_index:
d = datas[i+1:]
now_max = max(d)
max_index = d.... | #import time
N = int(eval(input()))
datas = [int(eval(input())) for _ in range(N)]
#start = time.time()
now_max = max(datas[1:])
max_index = datas.index(now_max)
diff = now_max - datas[0]
for i in range(1,N-1):
if i == max_index:
now_max = max(datas[i+1:])
max_index = datas.index(now_m... | p02258 |
from sys import stdin
N,*datas = [int(i) for i in stdin.readlines()]
now_max = max(datas[1:])
max_index = (N-1) - list(reversed(datas)).index(now_max)
_min = min(datas)
min_index = datas.index(_min)
if max_index > min_index:
diff = now_max - _min
else:
diff = now_max - datas[0]
for i in ... | from sys import stdin
N,*datas = [int(i) for i in stdin.readlines()]
now_max = max(datas[1:])
max_index = datas.index(now_max)
diff = now_max - datas[0]
for i in range(1,N-1):
if i == max_index:
now_max = max(datas[i+1:])
max_index = datas.index(now_max,i+1)
new_diff = now_max - dat... | p02258 |
n = int(input())
R = [0 for i in range(n)]
ans = 1 - 10**9
for i in range(n):
R[i] = int(input())
if i == 0:
min_R = R[0]
continue
if R[i] - min_R > ans:
ans = R[i] - min_R
if R[i] < min_R:
min_R = R[i]
print(ans)
| n = int(input())
R = [0 for i in range(n)]
ans = 1 - 10**9
min_R = int(input())
for i in range(n-1):
R[i] = int(input())
if R[i] - min_R > ans:
ans = R[i] - min_R
if R[i] < min_R:
min_R = R[i]
print(ans)
| p02258 |
amount = int(eval(input()))
numbers = [int(eval(input())) for i in range(amount)]
max_profit = -1 * (numbers[0] - numbers[1])
for i in range(amount - 1):
for j in range(i + 1, amount):
if (-1 * (numbers[i] - numbers[j])) >= max_profit:
max_profit = -1 * (numbers[i] - numbers[j])
p... | maxv = -2 * 10 ** 9
minv = 2 * 10 ** 9
n = int(eval(input()))
for i in range(n):
x = int(eval(input()))
maxv = max(x - minv, maxv)
minv = min(x, minv)
print(maxv) | p02258 |
# -*- coding: utf-8 -*-
n = int(input())
R_List = []
Max = 0
for i in range(n):
R_List.append(int(input()))
if i == 0:
continue
elif i == 1:
Max = R_List[1]-R_List[0]
else:
for j in range(i):
Max = max(Max, R_List[i]-R_List[j])
print(Max) | # -*- coding: utf-8 -*-
n = int(input())
R_List = []
Max = 0
R_min = 0
for i in range(n):
R_List.append(int(input()))
if i == 0:
R_min = R_List[0]
elif i == 1:
Max = R_List[1]-R_min
R_min = min(R_min, R_List[1])
else:
Max = max(Max, R_List[i]-R_min)
... | p02258 |
n = int(eval(input()))
t = []
for i in range(n):
t.append(int(eval(input())))
buy = t[0]
prev_sell = max(t[1:])
val = prev_sell - buy
for i in range(n-1):
if i == 0 or t[i - 1] < t[i]:
continue
prev_sell = max(t[i+1:])
val2 = prev_sell - t[i]
if val2 > val:
val =... | n = int(eval(input()))
t = []
for i in range(n):
t.append(int(eval(input())))
buy = t[0]
val = t[-1] - buy
for i in range(1, n):
if t[i] - buy > val:
val = t[i] - buy
if t[i] < buy:
buy = t[i]
print(val)
| p02258 |
import sys
n=int(eval(input()))
r=list(map(int,sys.stdin.read().split()))
print((max([max(r[i+1:])-r[i]for i in range(n-1)]))) | n=int(eval(input()))
r=[int(eval(input()))for _ in range(n)]
s=r[0];b=r[1]-s
for i in range(1,n):
b=max(b,r[i]-s)
s=min(s,r[i])
print(b)
| p02258 |
import sys
b,s=-1e10,1e10
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
| import sys
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
| p02258 |
import sys
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin.readlines()):
if b<r-s:b=r-s
if s>r:s=r
print(b)
| import sys
def m():
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
if'__main__'==__name__:m()
| p02258 |
import sys
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
| import sys
def f():
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
f()
| p02258 |
n=int(eval(input()))
Rt=[]
for i in range(n):
Rt.append(int(eval(input())))
a=-999999999
for i in range(1,n):
for j in range(i):
if a<Rt[i]-Rt[j]:
a=Rt[i]-Rt[j]
print(a)
| n=int(eval(input()))
Rt=[]
for i in range(n):
Rt.append(int(eval(input())))
maxv=Rt[1]-Rt[0]
minv=Rt[0]
for j in range(1,n):
maxv=max(maxv,Rt[j]-minv)
minv=min(minv,Rt[j])
print(maxv)
| p02258 |
N = int(eval(input()))
purchase_price = int(eval(input()))
profit = -2000000000
for _ in range(N-1):
price = int(eval(input()))
profit = max(profit, (price-purchase_price))
purchase_price = min(price, purchase_price)
print(profit)
| N = int(eval(input()))
r1 = int(eval(input()))
r2 = int(eval(input()))
R = [int(eval(input())) for i in range(N-2)]
res = r2 - r1
min_r = min(r1, r2)
for r in R:
res = max(res, r - min_r)
min_r = min(min_r, r)
print(res)
| p02258 |
N =int(eval(input()))
R = []
for i in range(N):
R.append(int(eval(input())))
maxv=-2000000000
minv=R[0]
for i in range(1,N):
maxv=max(maxv,R[i]-minv)
minv=min(minv,R[i])
print(maxv) | import sys
i=input
n =int(i())
r0=int(i())
r1=int(i())
maxv=r1-r0
minv=min(r1,r0)
for i in map(int,sys.stdin.readlines()):
maxv=max(maxv,i-minv)
minv=min(minv,i)
print(maxv) | p02258 |
#16D8101012J 伊藤惇 dj Python3
import sys
def Maximum_Profit(n,A):
Max=-sys.maxsize
for i in range(n-1):
tmp=(max(A[i+1:])-A[i])
if Max<tmp:
Max=tmp
return Max
if __name__ == "__main__":
n=int(eval(input()))
A=[]
for i in range(n):
A.append(int(e... | #16D8101012J 伊藤惇 dj Python3
def Maximum_Profit(n,A):
Max=A[1]-A[0]
Min=A[0]
for j in range(1,n):
Max=max(Max,A[j]-Min)
Min=min(Min,A[j])
return Max
if __name__ == "__main__":
n=int(eval(input()))
A=[]
for i in range(n):
A.append(int(eval(input())))
... | p02258 |
n = int(input())
nums = [int(input()) for i in range(n)]
maxv = nums[1] - nums[0]
for j in range(1, n):
for i in range(j):
maxv = max(maxv, nums[j]-nums[i])
print(maxv)
| # coding: utf-8
# 答えを見た。。。
n = int(input())
R = [int(input()) for i in range(n)]
maxv = -2000000000
minv = R[0]
for r in R[1:]:
maxv = max(maxv, r - minv)
minv = min(minv, r)
print(maxv)
| p02258 |
arr = []
for i in range(int(eval(input()))):
arr.append(int(eval(input())))
m = 0
for i in range(len(arr)-1):
for j in range(i+1, len(arr)):
if i == 0 and j == 1:
m = arr[j] - arr[i]
else:
m = max(m, arr[j] - arr[i])
print(m) | n = int(eval(input()))
arr = [int(eval(input())) for i in range(n)]
m = 1 - 10**9
minv = arr[0]
for i in range(1,len(arr)):
if arr[i] - minv > m:
m = arr[i] - minv
minv = min(minv, arr[i])
print(m) | p02258 |
r = []
N = int(eval(input()))
for i in range(0, N):
r.append(int(eval(input())))
min = r[N-2]
max = r[N-1]
for i in range(N-1)[::-1]:
for j in range(i+1, N):
if r[j] - r[i] > max - min:
max = r[j]
min = r[i]
print((max - min)) | r = []
N = int(eval(input()))
for i in range(0, N):
r.append(int(eval(input())))
min_i = N-2
max_i = N-1
for i in range(N-1)[::-1]:
if (r[i] - r[i+1]) * r[max_i] - r[min_i] < 0:
for j in range(i+1, N):
if r[j] - r[i] > r[max_i] - r[min_i]:
max_i = j
... | p02258 |
r = []
N = int(eval(input()))
for i in range(0, N):
r.append(int(eval(input())))
min_i = N-2
max_i = N-1
for i in range(N-1)[::-1]:
if r[i] < r[i+1]:
for j in range(i+1, N):
if r[j] - r[i] > r[max_i] - r[min_i]:
max_i = j
min_i = i
if r[max... | N = int(eval(input()))
r = [int(eval(input())) for i in range(N)]
min = r[0]
max = -9999999999999999
for i in range(1, N):
if r[i] - min > max:
max = r[i] - min
if r[i] < min:
min = r[i]
print(max) | p02258 |
import sys
def solve():
n = int(input())
R = []
for i in range(n):
R.append(int(input()))
#for i in xrange(n):
# print R[i]
max_profit = -sys.maxsize
for i in range(n):
for j in range(i + 1, n):
if R[j] - R[i] > max_profit:
m... | import sys
def solve():
n = int(input())
R = []
for i in range(n):
R.append(int(input()))
#for i in xrange(n):
# print R[i]
max_profit = -sys.maxsize
min_R = R[0]
for i in range(1, n):
if R[i] - min_R > max_profit:
max_profit = R[i] - ... | p02258 |
num = n = int(eval(input()))
price = []
max_profit = -999999999999999
while(n>0):
x = int(eval(input()))
price.append(x)
n -= 1
for i in range(1,num):
for n in range(0,i):
pro = price[i] - price[n]
if pro > max_profit:
max_profit = pro
print(("{0}".format(max_... | num= n = int(eval(input()))
price = []
max_pro = -999999999
while(n>0):
x = int(eval(input()))
price.append(x)
n -= 1
min = price[0]
for i in range(1,num):
pro = price[i]-min
if(max_pro < pro):
max_pro = pro
if(min > price[i]):
min = price[i]
print(("{0}".form... | p02258 |
n = eval(input())
n = int(n)
pl = []
for i in range(n):
pl.append(int(eval(input())))
l = []
for i, p in enumerate(pl[:-1]):
l.append(max(pl[i+1:])-p)
m = max(l)
print(m) | n = eval(input())
n = int(n)
pl = []
for i in range(n):
pl.append(int(eval(input())))
m = pl[0]
M = pl[0]
difM = pl[1]-pl[0]
for i, p in enumerate(pl[1:]):
if p < m:
m = p
continue
if p - m > difM:
difM = p - m
print(difM)
| p02258 |
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
ans = a[1]-a[0]
for i in range(n-1):
k = max(a[i+1:]) - a[i]
if k > ans:
ans = k
print(ans)
| n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
nowmin = a[0]
ans = a[1]-a[0]
for i in range(n-1):
if a[i] <= nowmin:
k = max(a[i+1:]) - a[i]
if k > ans:
ans = k
nowmin = a[i]
print(ans)
| p02258 |
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
nowmin = a[0] + 1
ans = a[1]-a[0]
for i in range(n-1):
if a[i] < nowmin:
k = max(a[i+1:]) - a[i]
if k > ans:
ans = k
nowmin = a[i]
print(ans)
| n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
nowmin = a[0]
nowmax = max(a[1:])
ans = nowmax - nowmin
for i in range(n-1):
if a[i] == nowmax:
nowmax = max(a[i+1:])
if a[i] < nowmin:
k = nowmax - a[i]
if k > ans:
ans = k
nowmin = a[i]
prin... | p02258 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.