input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [list([int(n)-1 for n in input().split()]) for i in range(N)]
cur = [0 for i in range(N)]
que = [i for i in range(N)]
ans = 0
while len(que) > 0:
done = {}
que2 = []
for n in que:
if done.get(n):
continue
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(eval(input()))
A = [list([int(n)-1 for n in input().split()]) for i in range(N)]
cur = [0 for i in range(N)]
que = [i for i in range(N)]
ans = 0
while len(que) > 0:
done = {}
que2 = []
for n in que:
if done.get(... | p02925 |
import sys
sys.setrecursionlimit(10**7)
def dfs(v,s):
global c
seen[v]=True
for nv in G[v]:
if seen[nv]:
if nv in s:
c=True
continue
dfs(nv,s|{v})
srted.append(v)
def setID():
t=0
ID=[[None]*N for i in range(N)]
for... | import sys
sys.setrecursionlimit(10**7)
def dfs(v,s):
global c
if c:
return
seen[v]=True
for nv in G[v]:
if seen[nv]:
if nv in s:
c=True
return
continue
dfs(nv,s|{v})
srted.append(v)
def setID():
... | p02925 |
"""
最長経路問題として解く。
各試合のノードを作成。
各試合ノードごとに、「この試合が終わったら、次はこの試合ができるようになる。」という対応関係を作っていく。
"""
def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[0]*(N)]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#選手iにとって、選手jが何番目の相手かを逆... | """
最長経路問題として解く。
各試合のノードを作成。
各試合ノードごとに、「この試合が終わったら、次はこの試合ができるようになる。」という対応関係を作っていく。
"""
def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[0]*(N)]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#選手iにとって、選手jが何番目の相手かを逆... | p02925 |
def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[]]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#AR[i][j] => iにとって選手jとの試合が何番目か
AR = [[]]
for i in range(1,N+1):
AR.append([0]*(N+1))
for j in range... | def main():
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [[]]
for _ in range(N):
A.append([0]+list(map(int,input().split())))
#AR[i][j] => iにとって選手jとの試合が何番目か
AR = [[]]
for i in range(1,N+1):
AR.append([0]*(N+1))
for j in range... | p02925 |
N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
from collections import deque
q=deque()
#seen=[[False for j in range(N)] for i in range(N)]
# 選手nが試合できるならqueに入れる
... | N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
q=[]
#seen=[[False for j in range(N)] for i in range(N)]
# 選手nが試合できるならqueに入れる
def check(i):
if len(a[i])==0:
... | p02925 |
N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
q=[]
#seen=[[False for j in range(N)] for i in range(N)]
# 選手nが試合できるならqueに入れる
def check(i):
if len(a[i])==0:
... | N=int(eval(input()))
a=[[0 for j in range(N-1)] for i in range(N)]
for i in range(N):
line=list(map(int,input().split()))
for j in range(N-1):
a[i][j]=line[j]-1
a[i]=a[i][::-1]
stack=[]
def addmatch(i):
if len(a[i])==0:
return
j=a[i][-1]
if a[j][-1]==i:
stack.append([i,j])
... | p02925 |
import sys
readline = sys.stdin.readline
N = int(readline())
A = [None] * N
for i in range(N):
# 後ろからpopできるように逆順リストで持つ
A[i] = list([x - 1 for x in list(map(int,readline().split()))])[::-1]
# 今日試合ができる可能性がある人リスト
candi = set(range(N))
day = 0
while True:
day += 1
nex = set()
done = set()
... | import sys
readline = sys.stdin.readline
N = int(readline())
A = [None] * N
for i in range(N):
# 後ろからpopできるように逆順リストで持つ
A[i] = list([x - 1 for x in list(map(int,readline().split()))])[::-1]
# 今日試合ができる可能性がある人リスト
candi = set(range(N))
day = 0
while candi:
day += 1
nex = set()
done = set()
... | p02925 |
import sys
from collections import deque
input = sys.stdin.readline
n = int(eval(input()))
a = [deque([x for x in list(map(int, input().split()))]) for _ in range(n)]
nokori_games = n * (n - 1) / 2
day = 1
r5000 = list(range(5000))
player_in_this_game = set()
rn = list(range(n))
for _ in r5000:
for m in... | import sys
import time
from collections import deque
start = time.time()
input = sys.stdin.readline
n = int(eval(input()))
a = [deque([x for x in list(map(int, input().split()))]) for _ in range(n)]
nokori_games = n * (n - 1) / 2
day = 1
r5000 = list(range(5000))
player_in_this_game = set()
rn = list(... | p02925 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
xs = [None]
for _ in range(N):
xs.append(list(map(int, input().split()))[::-1])
tops = [None] * (N+1)
for i in range(N):
i += 1
tops[i] = xs[i].pop()
cc = 0
rr = 0
while True:
vs = set()
nn = False
for i in range(N):
... | import sys
input = sys.stdin.readline
N=int(eval(input()))
xs = [None]
for _ in range(N):
xs.append(list(map(int, input().split()))[::-1])
tops = [None] * (N+1)
for i in range(N):
i += 1
tops[i] = xs[i].pop()
cc = 0
rr = 0
ns = [i+1 for i in range(N)]
while True:
vs = set()
nn = Fal... | p02925 |
N = int(eval(input()))
A = []
for i in range(N):
l = list(map(int,input().split()))
A.append([i-1 for i in l])
match_num = [0 for i in range(N)]
match_dict = {}
idx = 0
for i in range(N-1):
for j in range(i+1, N):
match_dict[(i,j)] = idx
idx += 1
M = idx
edge = [[] for i in range(M)]
parent = [[] f... | N = int(eval(input()))
A = []
for i in range(N):
l = list(map(int,input().split()))
A.append([i-1 for i in l])
match_num = [0 for i in range(N)]
match_dict = {}
idx = 0
for i in range(N-1):
for j in range(i+1, N):
match_dict[(i,j)] = idx
idx += 1
M = idx
edge = [[] for i in range(M)]
parent = [[] f... | p02925 |
#!/usr/bin/env python3
import sys
from collections import deque
INF = float("inf")
def Topological_sorting(E):
N = len(E)
in_deg = [0]*N
for i in range(N): # ２重ループでO(E)
for to_ in E[i]:
in_deg[to_] += 1
ans = [v for v in range(N) if in_deg[v] == 0]
deq =... | #!/usr/bin/env python3
from collections import deque
def Topological_sorting(E):
N = len(E)
in_deg = [0]*N
for i in range(N): # ２重ループでO(E)
for to_ in E[i]:
in_deg[to_] += 1
ans = [v for v in range(N) if in_deg[v] == 0]
deq = deque(ans)
while deq: ... | p02925 |
# -*- coding: utf-8 -*-
from sys import stdin
# import numpy as np
from collections import deque
# import sys
# sys.setrecursionlimit(10**4)
def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list([int(x)-1 for x in stdin.readline().split()])
def _lf(): return list(map(float, stdin.... | from sys import stdin
# import numpy as np
from collections import deque
# import sys
# sys.setrecursionlimit(10**4)
def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list([int(x)-1 for x in stdin.readline().split()])
def _lf(): return list(map(float, stdin.readline().split()))
def... | p02925 |
import sys
read = sys.stdin.buffer.read
def main():
N, *X = list(map(int, read().split()))
A = [0] * N
for i in range(N):
A[i] = X[(N - 1) * i : (N - 1) * (i + 1)]
M = N * (N - 1) // 2
total_mathces = 0
for day in range(M):
matches = 0
played = [False... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = [0] * N
for i in range(N):
A[i] = [int(s) - 1 for s in readline().split()]
M = N * ... | p02925 |
from collections import deque
n=int(eval(input()))
al=[deque(list(map(int,input().split()))) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
... | import time
n=int(eval(input()))
al=[list(map(int,input().split())) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
start=time.time()
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
... | p02925 |
import time
n=int(eval(input()))
al=[list(map(int,input().split())) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
start=time.time()
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
... | import time
n=int(eval(input()))
al=[list(map(int,input().split())) for _ in range(n)]
m=n*(n-1)//2
tn=[n-1]*n
start=time.time()
for i in range(m+1):
flg=True
s=0
ts=set()
for j in range(n):
if tn[j]>0 and j not in ts:
t=al[j][0]-1
if t not in ts:
... | p02925 |
import pprint
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
day = 0
while True:
end = 1
game = list()
for i in range(n):
if a[i] != []:
end = 0
if a[a[i][0]-1] != []:
if a[a[i][0]-1][0]-1 == i:
... | import pprint
n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(n)]
day = 0
check = set(range(n))
while True:
end = 1
game = set()
for i in check:
if a[i] != []:
end = 0
if a[a[i][0]-1] != []:
if a[a[i][0]-1][0]-1 == ... | p02925 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [list(map(int, input().split()))[::-1] for _ in range(N)]
ans = 0
match = N*(N-1)//2
player = set(range(N))
seen = [False]*N
while True:
update = False
checked = seen[::]
ans += 1
for x in player:
if checked[x]... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
pair = N * (N - 1) // 2
ptoi = dict()
i = 0
for x in range(1, N):
for y in range(x + 1, N + 1):
ptoi[(x, y)] = i
ptoi[(y, x)] = i
i += 1
edge = [[] for _ in range(pair)]
inde... | p02925 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
if P[-1] == N:
tmp = P[-1]
P[-1] = P[-2]
P[-2] = tmp
ans += 1
for i in range(N-1):
if P[i] == i+1:
tmp = P[i]
P[i] = P[i+1]
P[i+1] = tmp
ans += 1
for i in range(N):
if P[i] =... | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
i = 0
while i < N:
if P[i] == i + 1:
ans += 1
i += 1
i += 1
print(ans)
| p03612 |
# ARC082D - Derangement
def main():
N = int(eval(input()))
P = tuple(map(int, input().split()))
A = [1 if i == j else 0 for i, j in enumerate(P, 1)]
ans, cur = 0, 0
for i in A:
if i:
cur += 1
else:
ans += (cur + 1) // 2
cur = 0
ans ... | # ARC082D - Derangement (ABC072D)
def main():
N = int(eval(input()))
P = tuple(map(int, input().split()))
ans, cur = 0, 0
for i, j in enumerate(P, 1):
if i == j: # subsequence which needs to replace
cur += 1
elif i != j and cur:
ans += (cur + 1) // 2
... | p03612 |
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
same = deque()
for i in range(1, N + 1):
if i == P[i]: same.append(i)
if not same:
print((0))
... | import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
ans = 0
for i in range(1, N):
if i == P[i]:
P[i + 1] = P[i]
ans += 1
if N == P[N]: ans... | p03612 |
n = int(eval(input()))
a = list(map(int,input().split()))
res = 0
i = 1
while i < n+1:
if a[i-1] == i:
res += 1
i+=2
else:
i+=1
print(res) | n = int(eval(input()))
p = list(map(int,input().split()))
i = 1
res = 0
while i < n+1:
if p[i-1] == i:
res += 1
i += 1
i += 1
print(res) | p03612 |
n = int(eval(input()))
p = list([int(x)-1 for x in input().split()])
ans = 0
for i in range(n-1):
if p[i]==i:
p[i],p[i+1] = p[i+1],p[i]
ans += 1
if p[-1]==n-1:ans+=1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n):
if p[i]-1==i:
if i<n-1:p[i],p[i+1] = p[i+1],p[i]
ans += 1
print(ans) | p03612 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ... | p03612 |
n=int(eval(input()))
arr=list(map(int,input().split()))
ans=0
for i in range(n-2):
if arr[i]==i+1:
arr[i],arr[i+1]=arr[i+1],arr[i]
ans+=1
elif arr[i+1]==i+1:
arr[i+1],arr[i+2]=arr[i+2],arr[i+1]
if arr[-1]==n or arr[-2]==n-1:
ans+=1
print(ans)
| n=int(eval(input()))
arr=list(map(int,input().split()))
ans=0
for i in range(n-1,-1,-1):
if arr[i]==i+1:
arr[i],arr[i-1]=arr[i-1],arr[i]
ans+=1
print(ans) | p03612 |
N = int(eval(input()))
p = list(map(int,input().split()))
import queue
from math import ceil
que = queue.Queue()
ans = 0
for i in range(N):
if p[i]==i+1:
que.put(i)
else:
ans+=ceil(que.qsize()/2)
que = queue.Queue()
ans+=ceil(que.qsize()/2)
print(ans) | N = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
i = 0
while i < N:
if p[i] == i+1:
ans += 1
if i+1 < N and p[i+1]==i+2:
i += 1
i += 1
print(ans) | p03612 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
increased = False
for i in range(n):
if increased:
increased = False
continue
if p[i] == i+1:
cnt += 1
i += 1
increased = True
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
increased = False
for i in range(n):
if increased:
increased = False
elif p[i] == i+1:
cnt += 1
increased = True
print(cnt)
| p03612 |
n = int(eval(input()))
l = list(map(int, input().split()))
l = [x-1 for x in l]
ans = 0
for i in range(n):
if l[i] == i:
ans += 1
if i != n-1:
l[i+1] = l[i]
print(ans)
| n = int(eval(input()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
ans = 0
for i in range(n):
if P[i] == i:
if i != n-1:
ans += 1
P[i+1] = P[i]
else:
ans += 1
print(ans)
| p03612 |
n = int(eval(input()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
ans = 0
for i in range(n):
if P[i] == i:
if i != n-1:
ans += 1
P[i+1] = P[i]
else:
ans += 1
print(ans)
| n = int(eval(input()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
ans = 0
for i in range(n):
if i != n-1:
if P[i] == i:
ans += 1
P[i+1] = P[i]
else:
if P[i] == i:
ans += 1
print(ans) | p03612 |
N=int(eval(input()))
alist=[0]+list(map(int,input().split()))
answer=0
if alist[N]==N:
alist[N-1],alist[N]=alist[N],alist[N-1]
answer+=1
for i in range(1,N+1):
if alist[i]==i:
alist[i],alist[i+1]=alist[i+1],alist[i]
answer+=1
print(answer) | N=int(eval(input()))
alist=[0]+list(map(int,input().split()))
answer=0
for i in range(1,N):
if alist[i]==i:
alist[i],alist[i+1]=alist[i+1],alist[i]
answer+=1
if alist[N]==N:
print((answer+1))
else:
print(answer) | p03612 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
a[i]-=1
ans=0
for i in range(n-1):
if a[i]==i and a[i+1]==i+1:
ans+=1
a[i],a[i+1]=i+1,i
if a[i]==i:
ans+=1
if a[-1]==n-1:
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
if a[i]==i+1:
a[i],a[i+1]=a[i+1],a[i]
ans+=1
if a[-1]==n:
ans+=1
print(ans) | p03612 |
N = int(eval(input()))
p = [int(x) for x in input().split()]
ans = 0
for i in range(N):
if i < N - 1 and p[i] == i + 1:
p[i] = p[i+1]
p[i+1] = i+1
ans += 1
elif i == N -1 and p[i] == i+1:
p[i] = p[i-1]
p[i-1] = i + 1
ans += 1
print(ans) | N = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(N):
if p[i]-1 == i:
if i + 1 <= N-1:
p[i] = p[i+1]
p[i+1] = i + 1
ans += 1
elif i - 1 >= 0:
p[i] = p[i-1]
p[i-1] = i + 1
ans += 1
pri... | p03612 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
i = 0
ans = 0
while i < n:
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
i += 1
print(ans)
| n = int(eval(input()))
p = [int(i) for i in input().split()]
ans = 0
for i in range(n):
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
print(ans)
| p03612 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
while True:
for i in range(N-1):
if i + 1 == P[i]:
P[i], P[i+1] = P[i+1], P[i]
count += 1
flag = True
for i in range(1, N+1):
if i == P[i-1]:
flag = False
break
... | N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(N-1):
if i + 1 == P[i]:
P[i], P[i+1] = P[i+1], P[i]
count += 1
if N == P[N-1]:
count += 1
print(count) | p03612 |
N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
if p[0] == 1:
tmp = p[1]
p[1] = p[0]
p[0] = tmp
cnt += 1
for i in range(N - 1, -1, -1):
if i + 1 == p[i]:
tmp = p[i]
p[i] = p[i - 1]
p[i - 1] = tmp
cnt += 1
print(cnt) | N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
#if p[0] == 1:
# tmp = p[1]
# p[1] = p[0]
# p[0] = tmp
# cnt += 1
for i in range(N - 1, -1, -1):
if i + 1 == p[i]:
tmp = p[i]
p[i] = p[i - 1]
p[i - 1] = tmp
cnt += 1
print(cnt) | p03612 |
#!/usr/bin/env python3
import sys
def solve(N: int, p: "List[int]"):
ans = 0
for i in range(N-1):
if(i+1 == p[i]):
p[i],p[i+1] = p[i+1],p[i]
ans += 1
for i in range(N-1,-1,-1):
if(i+1 == p[i]):
p[i],p[i-1] = p[i-1],p[i]
... | #!/usr/bin/env python3
import sys
def solve(N: int, p: "List[int]"):
ans = 0
for i in range(N-1):
if(i+1 == p[i]):
p[i],p[i+1] = p[i+1],p[i]
ans += 1
if(N == p[N-1]):
ans += 1
print(ans)
# for i in range(N-1):
# ... | p03612 |
N = int(eval(input()))
P = list([int(a) - 1 for a in input().split()])
ans = 0
for i in range(N):
p = P[i]
if p == i:
if i < N - 1:
P[i], P[i + 1] = P[i + 1], P[i]
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
if P[i] == i + 1:
if i + 1 < N:
P[i], P[i + 1] = P[i + 1], P[i]
ans += 1
print(ans)
| p03612 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
tmp = [-1,-1]
for i in range(n):
if p[i] == i+1:
if i+1 == tmp[0]+1 and p[i]==tmp[1]+1:
cnt+=0
tmp = [-1, -1]
else:
cnt+=1
tmp = [i+1,p[i]]
# print(p[i],tmp,cnt)
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
tmp = -1
for i in range(n):
if p[i] == i+1:
if i+1 == tmp+1:
cnt+=0
tmp = -1
else:
cnt+=1
tmp = i+1
print(cnt) | p03612 |
N = int(eval(input()))
p = tuple(map(int, input().split()))
a = list(p)
b = list(p)
c = 0
for i in range(N):
if i+1 == a[i] and i == N-1:
c += 1
elif i+1 == a[i]:
a[i], a[i+1] = a[i+1], a[i]
c += 1
cc = 0
for i in range(N)[::-1]:
if i+1 == b[i] and i == 0:
... | N = int(eval(input()))
p = tuple(map(int, input().split()))
a = list(p)
b = list(p)
c = 0
for i in range(N):
if i+1 == a[i] and i == N-1:
c += 1
elif i+1 == a[i]:
a[i], a[i+1] = a[i+1], a[i]
c += 1
cc = 0
for i in range(N)[::-1]:
if i+1 == b[i] and i == 0:
... | p03612 |
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10
def main():
N = int(eval(input()))
p_list = list(map(int, input().split()))
a_list = list(range(1, N +... | from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10
def main():
N = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
i = 0
wh... | p03612 |
n = int(eval(input()))
p = list(map(int, input().split()))
temp = []
for i in range(n):
# print(i, p[i])
if p[i] == i+1:
temp.append('y')
continue
# if p[i] == i+1:
# if p[i-1] == i:
# del temp[-1]
# temp.append('x')
# else:
# ... | n = int(eval(input()))
p = list(map(int, input().split()))
temp = []
for i in range(n):
# print(i, p[i])
if p[i] == i+1:
temp.append('y')
continue
temp.append(p[i])
a = []
idx = 1
while True:
if idx > len(temp) - 1:
break
if temp[idx] == 'y' and temp[i... | p03612 |
import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
P = [int(p) for p in input().split()]
count = 0
now = 0
while now < N:
if P[now] == now + 1:
count += 1
if now < N - 1:
if P[now + 1] == now + 2: now += 1
... | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
P = [int(p) for p in input().split()]
swap = 0
for i in range(N):
if P[i] == i + 1:
if i < N - 1: P[i], P[i+1] = P[i+1], P[i]
swap += 1
print(swap)
return 0
if __name__ =... | p03612 |
# ABC 072 D
N = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
r = [0 for k in range(N)]
for k in range(N):
if p[k] == k+1:
r[k] = 1
for k in range(1,N):
if r[k] > 0:
r[k] += r[k-1]
r = r + [0]
for k in range(1,N+1):
if r[k] == 0:
ans += (r[k-1]+1)/... | N = int(eval(input()))
p = list(map(int,input().split()))
l = [0 for k in range(N+2)]
for k in range(N):
if p[k] == k+1:
l[k+1] = 1
t = 0
ans = 0
for e in l:
if e == 1:
t += 1
else:
ans += (t+1)//2
t = 0
print(ans)
| p03612 |
N=int(eval(input()))
P=list(map(int,input().split()))
S=[]
for x,y in zip(P, list(range(1,N+1))):
if x==y: S.append(y)
S.append('$')
L=len(S)
lake=[]
lake.append(S[0])
i=1
a=0
while i<L:
if S[i]=='$':
a+=1
elif lake[0]+1!=S[i]:
a+=1
lake=[]
lake.append(S[i])
els... | N=int(eval(input()))
S=[]
for x,y in zip(list(map(int,input().split())), list(range(1,N+1))):
if x==y: S.append(y)
S.append('$')
L=len(S)
l=[S[0]]
i=1
a=0
while i<L:
if S[i]=='$':a+=1
elif l[0]+1!=S[i]:
a+=1
l=[S[i]]
else:l.append(S[i])
i+=1
print(a) | p03612 |
N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
if P[i] == i+1:
if i != N - 1:
t = P[i]
P[i] = P[i+1]
P[i+1] = t
c += 1
else:
t = P[i]
P[i] = P[i-1]
P[i-1] = t
... | N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
f = 1
if P[i] == i+1:
if i != N - 1:
if P[i+1] != i+1:
t = P[i]
P[i] = P[i+1]
P[i+1] = t
c += 1
else:
if P[i-1]... | p03612 |
import itertools
def solve():
N = int(eval(input()))
p = list(map(int, input().split()))
chk = ""
for i in range(N):
if p[i] == i + 1:
chk += "1"
else:
chk += "0"
chk_splited = chk.split('0')
cnt = 0
for c in chk_splited:
... | import itertools
def solve():
N = int(eval(input()))
p = list(map(int, input().split()))
one_cnt = 0
swap_cnt = 0
for i in range(N):
if p[i] == i + 1:
one_cnt += 1
else:
if one_cnt % 2 == 0:
swap_cnt += one_cnt / 2
els... | p03612 |
def check(n,p):
for i in range(n):
if (i+1) == p[i]:
return False
return True
def solve(n,p):
memo = {}
items = [(0,p)]
result = 0
while items:
step, p = items.pop(0)
if check(n,p):
result = step
break
else... | def solve(n, p):
result = 0
for i in range(n-1):
if (i+1) == p[i]:
p[i], p[i+1] = p[i+1],p[i]
result += 1
i = n - 1
if (i+1) == p[i]:
p[i-1], p[i] = p[i],p[i-1]
result += 1
return result
if __name__ == '__main__':
n = int(eval(input()... | p03612 |
# sys.stdin.readline()
import sys
input = sys.stdin.readline
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if i+1 == p[i]:
if p[i]+1 == p[i+1]:
p[i+1] = p[i]
ans += 1
if p[n-1] == n:
ans += 1
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, *p = list(map(int, read().split()))
p += [0]
cnt = 0
for i, pp in enumerate(p):
if (i + 1) == pp:
p[i + 1] = 0
cnt += 1
print(cnt)
| p03612 |
n = int(eval(input()))
cnt = 0
p = list(map(int,input().split()))
for i in range(n):
if p[i]==i+1:
if i==0:
p[i+1],p[i] = p[i],p[i+1]
cnt+=1
elif i==n-1:
cnt+=1
break
elif p[i]==i+2:
p[i-1],p[i] = p[i],p[i-1]
... | def solve():
n = int(eval(input()))
l = list(map(int,input().split()))
res = 0
for i in range(n-1):
if l[i]==i+1:
l[i],l[i+1]=l[i+1],l[i]
res+=1
if l[n-1]==n:
res+=1
print(res)
if __name__=='__main__':
solve() | p03612 |
N = int(eval(input()))
P = list(map(int,input().split()))
ls = [""] * N
cnt = 0
for i in range(N):
if P[i] == i + 1:
ls[i] = "#"
else:
ls[i] = "."
if ls[-1] == "#":
if ls[-2] == "#":
ls[-1], ls[-2] = ".", "."
else:
ls[-1] = "."
cnt += 1
for j in range(N-1):
if ls[... | N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
if P[-1] == N:
ans += 1
P[-1] = -1
if P[-2] == N - 1:
P[-2] = -1
for i in range(N-1):
if P[i] == i + 1:
ans += 1
if P[i+1] == i + 2:
P[i+1] = -1
print(ans) | p03612 |
N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
i = 0
while i < N:
if i + 1 == p[i]:
c = 1
for j in range(i + 1, N):
if j+1 != p[j]:
i = j
break
else:
c += 1
i = j
cnt += (c+1)//2... | N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
i = 0
while i < N:
if i + 1 == p[i]:
c = 1
j = i+1
while j < N:
if j+1 != p[j]:
i = j
break
else:
c += 1
j += 1
else:
... | p03612 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
t = 'o' if P[0] == 1 else 'x'
j = 0 if t == 'o' else 1
L = []
for i, p in enumerate(P):
s = 'o' if p == (i + 1) else 'x'
if s == t:
cnt += 1
else:
L.append(cnt)
cnt = 1
t = s
L.append(cnt)
a... | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
ans = 0
t = 'o' if P[0] == 1 else 'x'
for i, p in enumerate(P):
s = 'o' if p == (i + 1) else 'x'
if s == t:
cnt += 1
else:
if t == 'o':
ans += (cnt + 2 - 1) // 2
cnt = 1
t = s
else:... | p03612 |
n=int(eval(input()))
p=[int(i) for i in input().split()]
cnt=0
for i in range(n-1):
if p[i]==i+1:
p[i],p[i+1]=p[i+1],p[i]
cnt+=1
if p[-1]==n:cnt+=1
print(cnt) | n,*p=list(map(int,open(0).read().split()))
i=c=0
while i<n:
if p[i]==i+1:
i+=1
c+=1
i+=1
print(c) | p03612 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for n in range(N-1):
if P[n]==n+1 and P[n+1]==n+2:
ans+=1
P[n+1] = n+1
elif P[n]==n+1 and P[n+1]!=n+2:
ans+=1
if P[-1]==N:
print((ans+1))
else:
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
c = 0
for n in range(N-1):
if P[n]==n+1:
P[n],P[n+1] = P[n+1],P[n]
c+=1
if P[-1]==N:
print((c+1))
else:
print(c) | p03612 |
n = int(eval(input()))
p = list(map(int, input().split()))
x = []
for i in range(n):
if p[i] - 1 == i:
x.append('x')
else:
x.append('o')
cnt = 0
for i in range(n-1):
if x[i] == "x" and x[i+1] == 'o':
cnt += 1
elif x[i] == "x" and x[i+1] == 'x':
cnt += 1... | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if p[i]-1 == i:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
if p[-1] == n:
ans+=1
print(ans) | p03612 |
from itertools import groupby
n = eval(input())
li = list(map(int, input().split()))
lii = [val == (itr + 1) for itr, val in enumerate(li)]
gbli = [[key, len(list(group))] for key, group in groupby(lii)]
ans = 0
for key, val in gbli:
if key:
ans += (val - 1) // 2 + 1
print(ans)
| from itertools import groupby
n = int(eval(input()))
P = list(map(int, input().split()))
T = [val == (itr + 1) for itr, val in enumerate(P)]
ans = 0
for k, v in groupby(T):
if k == True:
ans += (sum(v) - 1) // 2 + 1
print(ans) | p03612 |
n = int(eval(input()))
temp = list(map(int, input().split()))
l = [0]*n
ans = 0
for i in range(n):
if temp[i] == i+1:
l[i] = 0
else:
l[i] = 1
for i in range(n):
if l[i] == 0 and i == n-1:
ans += 1
if l[i] == 0 and not i == n-1:
l[i] = 1
l[i+1] = 1
ans += 1
print(ans) | n = int(eval(input()))
l = list(map(int, input().split()))
ans = 0
for i in range(n):
if l[i] == i + 1 and i == n-1:
ans += 1
if l[i] == i + 1 and not i == n-1:
l[i], l[i+1] = l[i+1], l[i]
ans += 1
print(ans) | p03612 |
N=int(eval(input()))
p=list(map(int,input().split()))
count=0
import collections
s=collections.deque()
for i in range(N):
if p[i]==i+1:
s.append(i)
ans=0
while(s):
x=s.popleft()
if x+1 in s:
s.popleft()
ans+=1
print(ans)
| N=int(eval(input()))
p=list(map(int,input().split()))
count=0
t=set()
for i in range(N):
if p[i]==i+1:
t.add(i)
ans=0
id=0
while(id<N):
if id in t:
if id+1 in t:
id+=1
ans+=1
id+=1
print(ans)
| p03612 |
n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
for i in range(n):
if i != n-1:
if i+1 == l[i]:
a = l[i]
b = l[i+1]
l[i]=b
l[i+1]=a
ans += 1
else:
if i+1 == l[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if i+1 == p[i]:
p[i+1] = p[i]
ans += 1
if p[n-1] == n:
ans += 1
print(ans) | p03612 |
from math import ceil
n=int(eval(input()))
p=list(map(int,input().split()))
m=[]
l=[0]*n
for i in range(n):
if p[i]==i+1:
l[i]=1
# print(l)
t=0
for i in range(n):
if i==n-1:
if l[i]==1:
t+=1
m.append(t)
break
if l[i]==1:
t+=1
if... | n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for i in range(n-1):
if p[i]==i+1:
ans+=1
x,y=p[i+1],p[i]
p[i+1],p[i]=y,x
if i==n-2:
if p[-1]==n:
ans+=1
print(ans)
| p03612 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
cnt = 0
for i in range(n):
if p[i] == i + 1:
cnt += 1
if i != n - 1:
p[i], p[i+1] = p[i+1], p[i]
else:
print(cnt) | n = int(eval(input()))
p = [int(x) for x in input().split()]
skip = False
cnt = 0
for i in range(n):
if skip:
skip = False
elif p[i] == i + 1:
cnt += 1
skip = True
else:
print(cnt) | p03612 |
import copy
n=int(eval(input()))
f1=list(map(int,input().split()))
f2=copy.deepcopy(f1)
c=0
for i in range(n-1):
if f1[i]==i+1:
c+=1
f1[i],f1[i+1]=f1[i+1],f1[i]
for i in range(n-1,0,-1):
#print(d)
if f1[i]==i+1:
c+=1
f1[i],f1[i-1]=f1[i-1],f1[i]
print(c)
| n=int(eval(input()))
f=list(map(int,input().split()))
c=0
for i in range(n-1):
if f[i]==i+1:
c+=1
f[i],f[i+1]=f[i+1],f[i]
if f[n-1]==n:
f[n-2],f[n-1]=f[n-1],f[n-2]
c+=1
print(c) | p03612 |
n = int(eval(input()))
p = list(map(int, input().split())) + [0]
cnt = 0
j = False
for i in range(n):
if p[i] == i + 1:
cnt += 1
if p[i + 1] == i + 2:
if j == False:
cnt -= 1
j = True
else:
j = False
else:
... | n = int(eval(input()))
p = list(map(int, input().split())) + [0]
cnt = 0
i = 0
while i < n:
if p[i] == i + 1:
cnt += 1
i += 1
i += 1
print(cnt) | p03612 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
K = I()
A = [i for i in range(1,100)] # Snuke数の候補
for i in range(13):
for j in range(100,1000):
A.append(j*10**i+10**i-1)
A.sort(reverse=True)
B = []
m = 10**18
for a in A:
x = a/sum(int(i) for i in list(str(a)))
if x... | import sys
K = int(sys.stdin.readline().rstrip())
ANS = [1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1099, 1199, 1299, 1399, 1499, 1599, 1699, 1799, 1899, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 10999, 11999, 12999, 13999, 14999, 15999, 1... | p03318 |
def f(n):
s=str(n)
return sum([int(s[i]) for i in range(len(s))])
sunuke=[]
for i in range(16):
for j in range(1,500):
sunuke.append(j*(10**i)-1)
sunuke=list(set(sunuke))
sunuke.sort()
sunuke.pop(0)
L=len(sunuke)
tmp1,tmp2=sunuke[L-1],f(sunuke[L-1])
ans=[sunuke[L-1]]
for i in rang... | def f(n):
s=str(n)
return sum([int(s[i]) for i in range(len(s))])
sunuke=[]
for i in range(16):
for j in range(1,200):
sunuke.append(j*(10**i)-1)
sunuke=list(set(sunuke))
sunuke.sort()
sunuke.pop(0)
L=len(sunuke)
tmp1,tmp2=sunuke[L-1],f(sunuke[L-1])
ans=[sunuke[L-1]]
for i in rang... | p03318 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | p03318 |
import math
# import datetime
def s(n):
sum = 0
for c in str(n):
sum += int(c)
return sum
k = int(eval(input()))
found=0
def next_sunuke(n, s_n, s_n_div):
global found
if n == 1:
return
log_n = int(math.log(n,10))
m = n - 10 ** int(log_n // 1.25)
# m = n - 1
while m >= 1:
s... | import math
# import datetime
def s(n):
sum = 0
for c in str(n):
sum += int(c)
return sum
k = int(eval(input()))
found=0
def next_sunuke(n, s_n, s_n_div):
global found
if n == 1:
return
log_n = int(math.log(n,10))
m = n - 10 ** int(log_n // 1.25)
while m >= 1:
s_m = s(m)
s... | p03318 |
def main():
s=set()
for digit in range(16):
for i in range(1,1000):
c=i*10**digit+int('9'*digit or 0)
if c<10**15:
s.add(c)
c=sorted(s)
for i,n in enumerate(c):
sn=n/sum(map(int,str(n)))
for m in c[i+1:i+50]:
sm=m/sum... | def main():
s=set()
for digit in range(16):
for i in range(1,1000):
c=i*10**digit+int('9'*digit or 0)
if c<10**15:
s.add(c)
c=sorted(s)
for i,n in enumerate(c):
sn=n/sum(map(int,str(n)))
for m in c[i+1:i+20]:
sm=m/sum... | p03318 |
#!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def calc(n):
s = sum(map(int, str(n)))
return n / s
def f(n):
ld = list(map(int, str(n)))
cand = []
f... | #!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def calc(n):
s = sum(map(int, str(n)))
return n / s
def main():
k = ri()
cand = list(range(1, 10))
la... | p03318 |
K = int(eval(input()))
def ns(n):
return sum([int(c) for c in str(n)])
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
base *= 10 | K = int(eval(input()))
def ns(n):
ret, tmp = 0, n
while tmp > 0:
tmp, r = divmod(tmp, 10)
ret += r
return ret
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
b... | p03318 |
K = int(eval(input()))
def ns(n):
ret, tmp = 0, n
while tmp > 0:
tmp, r = divmod(tmp, 10)
ret += r
return ret
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > (ans + 10 * base) / ns(ans + 10 * base):
b... | K = int(eval(input()))
def ns(n):
ret, tmp = 0, n
while tmp > 0:
# tmp, r = divmod(tmp, 10)
r = tmp % 10
tmp //= 10
ret += r
return ret
ans, base = 0, 1
for _ in range(K):
ans += base
print(ans)
if (ans + base) / ns(ans + base) > ... | p03318 |
from math import log, floor
from itertools import islice
k = int(eval(input()))
def s(n):
return n / sum(map(int, str(n)))
def f(n):
ds = list(range(int(log(n+1, 10))+2))
xs = [(10**(d+1))*floor(n/(10**(d+1)) + 1) - 1 for d in ds]
return min(xs, key=s)
def g():
for n in range(1, 10... | from math import log, floor
from itertools import accumulate, chain, islice, repeat
k = int(eval(input()))
def f(n):
ds = list(range(int(log(n+1, 10))+2))
xs = [(10**(d+1))*floor(n/(10**(d+1)) + 1) - 1 for d in ds]
return min(xs, key=lambda n:(n / sum(map(int, str(n))), n))
snukes = chain(li... | p03318 |
def S(i):
ans = 0
while i // 10 > 0:
ans += i % 10
i //= 10
ans += i
return ans
K = int(eval(input()))
Ans, count, N = [], 0, 1
while count < K:
N2, Nd = N, 1
while N2//10 > 0:
Nd += 1
N2 //= 10
minX, X = N/S(N), N
for i in range(Nd+2):
... | def S(i):
ans = 0
while i // 10 > 0:
ans += i % 10
i //= 10
ans += i
return ans
K = int(eval(input()))
count, N = 0, 1
while count < K:
N2, Nd = N, 1
while N2//10 > 0:
Nd += 1
N2 //= 10
minX, X = N/S(N), N
for i in range(Nd+2):
x ... | p03318 |
K = int(eval(input()))
P = [n for n in range(1, 10)]
Q = [n for n in range(1, 10)]
for d in range(20):
if d < 8:
for m in range(10, 100):
P.append(int(str(m)+"9"*d))
Q.append(m//10+m%10+9*d)
else:
for m in range(100, 1000):
P.append(int(str(m)+"9"*... | K = int(eval(input()))
P = [n for n in range(1, 10)]
Q = [n for n in range(1, 10)]
for d in range(20):
if d < 12:
for m in range(10, 100):
P.append(int(str(m)+"9"*d))
Q.append(m//10+m%10+9*d)
else:
for m in range(100, 1000):
P.append(int(str(m)+"9"... | p03318 |
k = int(eval(input()))
z=1
n=1
while z<=k:
a=1
l=len(str(n))
s = str(n)
x = list(map(int, list(s)))
while a<=l:
if x[0]==1 and l>3:
if l-a-1==0:
print(n)
a=a+100
z=z+1
elif n==19:
print((19... | k = int(eval(input()))
n=0
a=1
b=0
if a==1 and n<9:
while n<9 and b<k:
n+=1
print(n)
b+=1
a+=1
if a==2:
while n<90 and b<k:
n+=10
print(n)
b+=1
a+=1
while b<k:
n+=10**(a-1)
print(n)
b+=1
if (n>((a-1)*10**a-10**(a-1)) and... | p03318 |
k = eval(input())
K = int(k)
j = 1
count = 0
while True:
a = 0
j = str(j)
for i in range(len(j)):
a += int(j[i:i+1])
j = int(j)
if j/a < 2:
print(j)
count += 1
if count == K:
break
j += 1 | K = int(eval(input()))
a = 1
b = 0
def snk(n):
s = 0
for i in str(n):
s += int(i)
return(n/s)
count = 0
while True:
print(a)
count += 1
if snk(a + 10 ** b) > snk(a + 10 ** (b + 1)):
b += 1
a += 10 ** b
if count == K:
break | p03318 |
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from... | import sys;input=lambda:sys.stdin.readline().rstrip()
Yes=lambda b:print("Yes"if b else"No")
s,t=input(),input()
Yes(s==t[:-1])
| p02681 |
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str, T: str):
return [NO, YES][len(S)+1 == len(T) and S == T[:-1]]
de... | #!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str, T: str):
return [NO, YES][S == T[:-1]]
def main():
sys.se... | p02681 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
import string
def main():
s = input().rstrip()
t = input().rstrip()
for i in range(len(s)):
if s[i] != t[i]:
print("No")
exit()
if len(t) == len(s) +... | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
import string
def main():
s = input().rstrip()
t = input().rstrip()
t = t[0:-1]
if s == t:
print("Yes")
else:
print("No")
if __name__=="__main__":
main()... | p02681 |
n, a, b = list(map(int, input().split()))
s_t = set()
for i in range(n):
s_t.add(int(eval(input())))
print((len(s_t.difference(set(range(a, b))))))
| n, a, b = list(map(int, input().split()))
s_t = set()
for i in range(n):
s_t.add(int(eval(input())))
answer = 0
for s in s_t:
if a <= s < b:
pass
else:
answer += 1
print(answer)
| p03975 |
n, a ,b = list(map(int, input().split()))
c = 0
for i in range(n):
t = eval(input())
if not t in range(a,b):
c += 1
print(c) | n, a ,b = list(map(int, input().split()))
c = 0
for i in range(n):
t = eval(input())
if not a <= t < b:
c += 1
print(c) | p03975 |
# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 2016-10-07
#
# Usage
#
"""
def read():
"""Read like as below.
N A B
t_1
t_n
"""
l... | # -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 2016-10-07
#
# Usage
#
"""
def read():
"""Read like as below.
N A B
t_1
t_n
"""
line_1 = in... | p03975 |
import copy
n = int(eval(input()))
a = list(map(int,input().split()))
b = [0]
for i in range(len(a)):
b.append(b[i] + a[i])
del b[0]
c = copy.copy(b)
first_minus = 0
first_plus = 0
for i in range(len(b)):
if(i%2 == 0):
if (b[i] >= 0):
diff = abs(b[i]) + 1
... | import copy
n = int(eval(input()))
a = list(map(int,input().split()))
sum = 0
ans_a = 0
for i in range(len(a)):
sum += a[i]
if(i%2 == 0):
if(sum >= 0):
ans_a += sum + 1
sum = -1
else:
if(sum <= 0):
ans_a += 1 - sum
sum = 1
... | p03739 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
b.append(a[i])
ct1=0
if a[0]<=0:
a[0]=1
ct1+=1-a[0]
for i in range(1,n):
if i%2==1:
if sum(a[0:i+1])>=0:
ct1+=sum(a[0:i+1])+1
a[i]=-sum(a[0:i])-1
else:
if sum(a[0:i+1])<=0:
ct1+=1-sum(a[0:... | n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
b.append(a[i])
ct1=0
if a[0]<=0:
ct1+=1-a[0]
a[0]=1
x=a[0]
for i in range(1,n):
y=x+a[i]
if i%2==1:
if y>=0:
ct1+=y+1
a[i]=-x-1
else:
if y<=0:
ct1+=1-y
a[i]=-x+1
x+=a[i]
c... | p03739 |
nums = int(eval(input()))
ary = list(map(int,input().split()))
#puls no toki
count = 0
sum = ary[0]
if ary[0] < 0 :
count += abs(ary[0])+1
sum = 1
elif ary[0] == 0:
sum = 1
count += 1
for i in range (1,nums):
sum += ary[i]
if i % 2 == 1:
if sum > 0 :
coun... | n = int(eval(input()))
a = list(map(int,input().split()))
count = 0
check = 0
for i in range(n):
check += a[i]
if i%2==0 and check <= 0:
count += 1-check
check = 1
elif i%2==1 and check >= 0:
count += 1+check
check = -1
ans = count
count = 0
check = 0
for ... | p03739 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
"""
if a[0] == 0:
#a[1] とa[0]を足して|1|かつa[0]とa[1]+a[0]の符号を逆にしたい
if a[1] > 0:
a[0] = 1 - a[1]
elif a[1] < 0:
a[0] = -1 - a[1]
else: # a[0] a[1] 共に0の場合、a[2]に依存する -> 両方やればいい
奇数番目と偶数ばんめのどちらを＋にするか
"""
ans_odd = 0
total_odd ... |
N = int(eval(input()))
A = list(map(int, input().split()))
#奇数番目を負にする場合
odd = 0
total = 0
for i in range(N):
total += A[i]
if i % 2 == 0: #奇数番目の場合
if total > -1:
odd += 1 + total
total = -1
else:
if total < 1:
odd += 1 - total
... | p03739 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
b = a[:]
acc = 0
for i in range(n):
if i%2==0:
if acc+b[i]<=0:
b[i] += 1-(acc+b[i])
else:
if acc+b[i]>=0:
b[i] -= acc+b[i]+1
acc += b[i]
c = a[... | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
cnt1, now = 0, 0
for i in range(n):
now += a[i]
if i%2==0:
if now<=0:
cnt1 += 1-now
now = 1
else:
if now>=0:
cnt1 += now+1
... | p03739 |
import copy
n = int(eval(input()))
a = list(map(int, input().split()))
def judge_pm(a,b):
if a*b<0:
return True
else:
return False
a1 = copy.deepcopy(a)
tmp_sum = a1[0]
operate_num1 = 0
for i in range(1, n):
if judge_pm(tmp_sum, tmp_sum+a1[i]):
pass
elif tmp_su... | import copy
n = int(eval(input()))
a = list(map(int, input().split()))
def judge_pm(a,b):
if a*b<0:
return True
else:
return False
a1 = copy.deepcopy(a)
operate_num1 = 0
if a1[0]==0:
a1[0] = 1
operate_num1 += 1
tmp_sum = a1[0]
for i in range(1, n):
if judge_pm(tmp_... | p03739 |
N = int(eval(input()))
arr = list(map(int,input().split()))
def S1(a,b):
c,last,ans = 0,0,0
for t in range(N):
c += 1
if c % 2 == a:
while last+arr[t] <= 0:
ans += 1
last += 1
elif c % 2 == b:
while last +arr[t] >= 0:
... | N = int(eval(input()))
arr = list(map(int,input().split()))
def S1(a,b):
c,total,ans = 0,0,0
for t in arr:
c += 1
if c % 2 == a:
if total+t <= 0:
ans += abs(total+t)+1
total = 1
continue
elif c % 2 == b:
... | p03739 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [a_ for a_ in a]
ans = 10**14
for a0 in [-1,a[0],1]:
if a0 == 0:
continue
ans_ = abs(a[0]-a0)
b[0] = a0
sign = b[0] > 0
for i in range(1,n):
b[i] = a[i]+b[i-1]
if sign:
if b[i] >= 0:
... | n = int(eval(input()))
A = list(map(int, input().split()))
def adj(n, a ,flag):
na = 0
cnt = 0
for i in range(n):
na += a[i]
if flag == 1:
if na <= 0:
cnt += 1 - na
na = 1
flag = -1
elif flag == -1:
... | p03739 |
n=int(eval(input()))
a=list(map(int, input().split()))
sum_now=a[0]
sum_before=-a[0]
count_1=0
count_2=0
for i in range(n):
while sum_now*sum_before>=0:
if sum_before==0:
sum_now=-a[1]/abs(a[1])
count_1+=1
else:
count_1+=abs(int(sum_now))+1
... | n=int(eval(input()))
a=list(map(int, input().split()))
sum_now=a[0]
sum_before=-a[0]
count_1=0
count_2=0
for i in range(n):
if sum_now*sum_before>=0:
if sum_before==0:
sum_now=-a[1]/abs(a[1])
count_1+=1
else:
count_1+=abs(int(sum_now))+1
s... | p03739 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = A.copy()
gokei = 0
ans1 = 0
for i in range(N):
gokei = sum(A[:i+1])
# 偶数番目を負に
if i % 2 == 0:
if gokei >= 0:
ans1 += abs(-1 - gokei)
A[i] -= abs(-1 - gokei)
if i % 2 == 1:
if gokei <= 0... | N = int(eval(input()))
A = list(map(int, input().split()))
gokei = 0
ans1 = 0
for i in range(N):
gokei += A[i]
# 偶数番目を負に
if i % 2 == 0:
if gokei >= 0:
ans1 += abs(-1 - gokei)
gokei -= abs(-1 - gokei)
if i % 2 == 1:
if gokei <= 0:
ans1 ... | p03739 |
N = int(eval(input()))
A = list(map(int, input().split()))
gokei = 0
ans1 = 0
for i in range(N):
gokei += A[i]
# 偶数番目を負に
if i % 2 == 0:
if gokei >= 0:
ans1 += abs(-1 - gokei)
gokei -= abs(-1 - gokei)
if i % 2 == 1:
if gokei <= 0:
ans1 ... | N = int(eval(input()))
A = list(map(int, input().split()))
c = A[0]
ans1 = 0
for a in A[1:]:
if c > 0 and c + a >= 0:
ans1 += c + a + 1
c = -1
elif c < 0 and c + a <= 0:
ans1 += -(c + a) + 1
c = 1
else:
c = c + a
c = 1
ans2 = abs(A[0] - 1)
for... | p03739 |
#!/usr/bin/env python3
from itertools import accumulate
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = list(accumulate(a))
ans = 10**18
for j in range(2):# 偶数行が正か奇数行が正
ans2 = 0
diff = 0
for i in range(n):
p = a[i] + dif... | N = int(eval(input()))
A = list(map(int, input().split()))
# 方針:正負正...と負正負...の両方を試す
ans = 0
now = 0
for i in range(N):
if i % 2 == 0:# 正にする
if now+A[i] <= 0:
ans += 1 - (now+A[i])
now = 1
else:
now += A[i]
else:
if now+A[i] >= 0:
... | p03739 |
n = int(eval(input()))
a = list(map(int,input().split()))
sun = 0
ans1 = 0
for i in range(n):
if i == 0:
SUN = 1
else:
SUN = sun
now = a[i]
if SUN * (sun+now) >= 0:
ans1 += abs(sun+now) + 1
if SUN > 0:
sun = -1
else:
sun = 1
else:
sun += now
sun = 0
ans2 ... | n = int(eval(input()))
a = list(map(int,input().split()))
can = []
ans = 0
now = 0
for i in range(n):
now += a[i]
if i % 2 == 0:
if now <= 0:
ans += 1 - now
now = 1
else:
if now >= 0:
ans += 1 + now
now = -1
can.append(ans)
ans = 0
now = 0
for i in range(n):
no... | p03739 |
n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
for i in range(n):
for j in range(2):
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | p03739 |
n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | n=int(eval(input()))
a=list(map(int,input().split()))
def ma():
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j... | p03739 |
eval(input())
l=list(map(int,input().split()))
def f(s):
c=t=0
for i in l:
t+=i
if s*t<=0: c+=abs(t-s); t=s
s*=-1
return c
print((min(f(1),f(-1)))) | _,*l=list(map(int,open(0).read().split()))
def f(s):
c=t=0
for i in l:
t+=i
if s*t<=0: c+=abs(t-s); t=s
s*=-1
return c
print((min(f(1),f(-1)))) | p03739 |
#
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
""" n! mod m 階乗
mod = 1e9 + 7
N = 10000000
... | #
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
""" n! mod m 階乗
mod = 1e9 + 7
N = 10000000
... | p03739 |
from functools import lru_cache
n = int(eval(input()))
s = list(map(int, input().split()))
@lru_cache(maxsize=None)
def cost_e():
res = 0
sum = 0
for j, y in enumerate(s, 1):
tmp = sum + y
if j & 1 and tmp >= 0:
sum = -1
res += abs(tmp) + 1
eli... | n = int(eval(input()))
s = list(map(int, input().split()))
def cost(t):
res = 0
sum = 0
for y in s:
sum += y
if sum * t <= 0:
res += abs(sum - t)
sum = t
t *= -1
return res
print((min(cost(1), cost(-1))))
| p03739 |
n = int(eval(input()))
a = list(map(int, input().split()))
import copy
a2 = copy.copy(a)
ans1 = 0 #偶数インデックスが正
for i in range(n):
s1 = sum(a[:i+1])
if i % 2 == 0:
if s1 <= 0:
x = abs(s1) + 1
ans1 += x
a[i] += x
else:
continue
els... | n = int(eval(input()))
a = list(map(int, input().split()))
def f(a, sgn):
cnt = 0
s = 0
for i in range(n):
s += a[i]
sgn *= (-1) #判定する符号は交互に変わる
if s * sgn <= 0: #sgn一致しなければその積は負
x = s + sgn*(-1)
s -= x
cnt += abs(x)
retu... | p03739 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.