problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02791 | N=int(input())
L=list(map(int,input().split()))
ans=1
M=L[0]
for i in range(1,N):
if M>=L[1]:
M=L[1]
ans+=1
else:
continue
print(ans) | N=int(input())
L=list(map(int,input().split()))
ans=1
M=L[0]
for i in range(1,N):
if M>=L[i]:
M=L[i]
ans+=1
else:
continue
print(ans) | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 596,557 | 596,558 | u075303794 | python |
p02791 | N=int(input())
L=map(int,input().split())
ans=1
M=L[0]
for i in range(1,N):
if M>=L[1]:
M=L[1]
ans+=1
else:
continue
print(ans) | N=int(input())
L=list(map(int,input().split()))
ans=1
M=L[0]
for i in range(1,N):
if M>=L[i]:
M=L[i]
ans+=1
else:
continue
print(ans) | [
"call.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 596,559 | 596,558 | u075303794 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
ans = 0
min_p = n
for i in p:
if i < min_p:
min_p = i
ans += 1
print(ans) | n = int(input())
p = list(map(int, input().split()))
ans = 0
min_p = n
for i in p:
if i <= min_p:
min_p = i
ans += 1
print(ans)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 596,572 | 596,573 | u163421511 | python |
p02791 | N=int(input())
P=list(map(int,input().split()))
count=0
MAX=P[0]
for num in P:
if num<=MAX:
count+=1
else:
MAX=num
print(count) | N=int(input())
P=list(map(int,input().split()))
count=0
MIN=P[0]
for num in P:
if num<=MIN:
count+=1
MIN=num
print(count) | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 596,585 | 596,586 | u640922335 | python |
p02791 | n = int(input())
a = list(map(int, input().split()))
ans = 1
c = a[0]
for i in range(1, n):
if min(c,a[i])== a[i]:
ans += 1
print(ans) | n = int(input())
a = list(map(int, input().split()))
ans = 1
c = a[0]
for i in range(1, n):
if min(c,a[i])== a[i]:
c = a[i]
ans += 1
print(ans) | [
"assignment.add"
] | 596,589 | 596,590 | u969848070 | python |
p02791 | n=int(input())
lst=list(map(int,input().split()))
premin=lst[0]
ans=0
for x in lst:
if min_list>=x:
ans+=1
premin=x
print(ans)
| n=int(input())
lst=list(map(int,input().split()))
premin=lst[0]
ans=0
for x in lst:
if premin>=x:
ans+=1
premin=x
print(ans)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 596,606 | 596,607 | u333700164 | python |
p02791 | n=int(input())
lst=list(map(int,input().split()))
premin=[lst[0]]
ans=0
for x in lst:
if min_list>=x:
ans+=1
premin=x
print(ans) | n=int(input())
lst=list(map(int,input().split()))
premin=lst[0]
ans=0
for x in lst:
if premin>=x:
ans+=1
premin=x
print(ans)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 596,608 | 596,607 | u333700164 | python |
p02785 | N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort
s = 0
for i in range(0,N-K):
s = s+H[i]
print (s) | N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
s = 0
for i in range(0,N-K):
s = s+H[i]
print (s) | [
"call.add"
] | 596,617 | 596,618 | u375477204 | python |
p02785 | enemmyCountN,killerTimeK = map(int,input().split())
enemyHp = input().split()
intEnemyHp = [int(i) for i in enemyHp]
enemyHp.sort()
resultEnemyCount = enemmyCountN - killerTimeK
countNormal = 0
if killerTimeK >= enemmyCountN:
print(0)
else:
for i in range(resultEnemyCount):
countNormal += intEnemyHp... | enemmyCountN,killerTimeK = map(int,input().split())
enemyHp = input().split()
intEnemyHp = [int(i) for i in enemyHp]
intEnemyHp.sort()
resultEnemyCount = enemmyCountN - killerTimeK
countNormal = 0
if killerTimeK >= enemmyCountN:
print(0)
else:
for i in range(resultEnemyCount):
countNormal += intEnem... | [
"identifier.change"
] | 596,619 | 596,620 | u534634083 | python |
p02785 | import numpy as np
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort
j=0
if K >= N:
print(0)
else:
for i in range (N-K):
j+=H[i]
print(j) | import numpy as np
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
j=0
if K >= N:
print(0)
else:
for i in range (N-K):
j+=H[i]
print(j) | [
"call.add"
] | 596,625 | 596,626 | u005317312 | python |
p02785 | import numpy as np
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort
j=0
if K >= N:
print(N)
else:
for i in range (N-K):
j+=H[i]
print(j) | import numpy as np
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
j=0
if K >= N:
print(0)
else:
for i in range (N-K):
j+=H[i]
print(j) | [
"call.add",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 596,628 | 596,626 | u005317312 | python |
p02785 | import numpy as np
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort
j=0
if K >= N:
print(N)
else:
for i in range (N-K):
j+=H[i]
print(j+K) | import numpy as np
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
j=0
if K >= N:
print(0)
else:
for i in range (N-K):
j+=H[i]
print(j) | [
"call.add",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 596,629 | 596,626 | u005317312 | python |
p02785 | N,K = (int(x) for x in input().split())
H = list(map(int, input().split()))
sum = 0
H = sorted(H)
answer = 0
for i in H[:N-K]:
answer += i
print(answer) | N,K = (int(x) for x in input().split())
H = list(map(int, input().split()))
sum = 0
H = sorted(H)
answer = 0
if N > K:
for i in H[:N-K]:
answer += i
print(answer) | [
"control_flow.branch.if.add"
] | 596,635 | 596,636 | u370828893 | python |
p02785 | N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
elif K == 0:
print(sum(H))
else:
H = sort(H)
print(sum(H[:-K])) | N, K = map(int, input().split())
H = list(map(int, input().split()))
if N <= K:
print(0)
elif K == 0:
print(sum(H))
else:
H = sorted(H)
print(sum(H[:-K]))
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 596,637 | 596,638 | u981693103 | python |
p02785 | def main():
N,K = map(int,input().split())
H = [int(h) for h in input().split()]
H = sorted(H,reverse=True)
for i in range(K):
H[i] = 0
print(sum(H))
if __name__ == '__main__':
main() | def main():
N,K = map(int,input().split())
H = [int(h) for h in input().split()]
H = sorted(H,reverse=True)
for i in range(min(K,N)):
H[i] = 0
print(sum(H))
if __name__ == '__main__':
main() | [
"call.add",
"call.arguments.add"
] | 596,651 | 596,652 | u172111219 | python |
p02785 | n, k = map(int, input().split())
hp_list = list(map(int, input().split()))
hp_list.sort()
attack = 0
for i, hp in enumurate(reversed(hp_list)):
if i < k:
continue
attack += hp
print(attack) | n, k = map(int, input().split())
hp_list = list(map(int, input().split()))
hp_list.sort()
attack = 0
for i, hp in enumerate(reversed(hp_list)):
if i < k:
continue
attack += hp
print(attack) | [
"identifier.change",
"call.function.change"
] | 596,663 | 596,664 | u414048826 | python |
p02785 | N, K=map(int, input().split())
List=sorted(list(map(int,input().split())))
a = 0
for i in range(N - k):
a = a + List[i]
print(a) | N, K=map(int, input().split())
List=sorted(list(map(int,input().split())))
a = 0
for i in range(N - K):
a = a + List[i]
print(a) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 596,679 | 596,680 | u870559097 | python |
p02785 | n,k = map(int, input().split())
h = list(map(int, input().split()))
sorted(h)
for i in range(k):
if(len(h) == 0):
break
h.pop()
print(sum(h)) | n,k = map(int, input().split())
h = list(map(int, input().split()))
hh = sorted(h)
for i in range(k):
if(len(hh) == 0):
break
hh.pop()
print(sum(hh)) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 596,683 | 596,684 | u854549222 | python |
p02785 | n,k = map(int,input().split())
h = list(map(int,input().split()))
sorted(h)
for i in range(k):
if(len(h)==0):
break
h.pop()
print(sum(h)) | n,k = map(int, input().split())
h = list(map(int, input().split()))
hh = sorted(h)
for i in range(k):
if(len(hh) == 0):
break
hh.pop()
print(sum(hh)) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 596,685 | 596,684 | u854549222 | python |
p02785 | n,k = (int(x) for x in input().split())
h_lst = [int(x) for x in input().split()]
h_lst.sort()
del h_lst[(-1)*k:]
print(sum(h_lst))
| n,k = (int(x) for x in input().split())
h_lst = [int(x) for x in input().split()]
h_lst.sort()
if k != 0:
del h_lst[(-1)*k:]
print(sum(h_lst)) | [
"control_flow.branch.if.add"
] | 596,692 | 596,693 | u287920108 | python |
p02785 | N,K = map(int, input().split())
print(N,K)
H = list(map(int, input().split()))
#H = input().split()
#print(H)
if N<=K:
print(0)
else:
# Hの中身を入れ替えて大きいものから順に必殺技で倒す
# つまり、配列をカットする
# 配列の残りの和が倒すのに必要な数
H.sort(reverse=True)
newH = H[K:]
sumH = sum(newH)
print(sumH) | N,K = map(int, input().split())
#print(N,K)
H = list(map(int, input().split()))
#H = input().split()
#print(H)
if N<=K:
print(0)
else:
# Hの中身を入れ替えて大きいものから順に必殺技で倒す
# つまり、配列をカットする
# 配列の残りの和が倒すのに必要な数
H.sort(reverse=True)
newH = H[K:]
sumH = sum(newH)
print(sumH) | [
"call.remove"
] | 596,701 | 596,702 | u982749462 | python |
p02785 | n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
h.append(int(i))
h.sort()
if k!=0:
for i in range(k):
h.pop(-1)
print(sum(h)) | n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
h.append(int(i))
h.sort()
if k!=0:
for i in range(min(n,k)):
h.pop(-1)
print(sum(h))
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 596,703 | 596,704 | u907223098 | python |
p02785 | N,K = map(int,input().split(' '))
H = [int(i) for i in input().split(' ')]
if K==0:
print(sum(H))
elif K>=N:
print(0)
else:
print(sum(H[:-K]))
| N,K = map(int,input().split(' '))
H = sorted([int(i) for i in input().split(' ')])
if K==0:
print(sum(H))
elif K>=N:
print(0)
else:
print(sum(H[:-K])) | [
"call.add",
"call.arguments.change"
] | 596,707 | 596,708 | u808757777 | python |
p02785 | n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
if k<=n:
for i in range(k):
a[i]=0
print(sum(h))
else:
print(0) | n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
if k<=n:
for i in range(k):
h[i]=0
print(sum(h))
else:
print(0) | [
"assignment.variable.change",
"identifier.change"
] | 596,719 | 596,720 | u357230322 | python |
p02785 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return lis... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return lis... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 596,721 | 596,722 | u637175065 | python |
p02785 | N, K = map(int, input().split())
monsterList = [int(x) for x in input().split()]
atackTimes = 0
monsterList.sort()
if K == 0:
for hp in monsterList[:-K]:
atackTimes += hp
else:
for hp in monsterList:
atackTimes += hp
print(atackTimes) | N, K = map(int, input().split())
monsterList = [int(x) for x in input().split()]
atackTimes = 0
monsterList.sort()
if K != 0:
for hp in monsterList[:-K]:
atackTimes += hp
else:
for hp in monsterList:
atackTimes += hp
print(atackTimes) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 596,725 | 596,726 | u310079355 | python |
p02785 | N,K=map(int,input().split())
H=list(map(int,input().split()))
if K>=N :
print(0)
elif K==0 :
sum(H)
else :
H.sort()
print(sum(H[:N-K])) | N,K=map(int,input().split())
H=list(map(int,input().split()))
if K>=N :
print(0)
elif K==0 :
print(sum(H))
else :
H.sort()
print(sum(H[:N-K])) | [
"call.add",
"call.arguments.change"
] | 596,733 | 596,734 | u144203608 | python |
p02785 | S1 = list(map(int, input().split()))
S2 = list(map(int, input().split()))
H = S1[0]
K = S1[1]
if K == 0:
print(sum(S2))
else:
print(sum(S2[:-K])) | S1 = list(map(int, input().split()))
S2 = list(map(int, input().split()))
H = S1[0]
K = S1[1]
S2.sort()
if K == 0:
print(sum(S2))
else:
print(sum(S2[:-K])) | [
"call.add"
] | 596,741 | 596,742 | u185409358 | python |
p02785 | import sys
n, k = map(int, sys.stdin.readline().split())
h = []
h.extend(sorted(map(int, sys.stdin.readline().split())))
del h[-k:]
print(sum(h))
| import sys
n, k = map(int, sys.stdin.readline().split())
h = []
h.extend(sorted(map(int, sys.stdin.readline().split())))
if k > 0:
del h[-k:]
print(sum(h))
| [
"control_flow.branch.if.add"
] | 596,743 | 596,744 | u690873774 | python |
p02785 | n,k=map(int,input().split())
l=list(map(int,input().split()))
if(k==0):
print(sum(l))
else:
l=sorted(l)
l=l[k:]
print(sum(l)) | n,k=map(int,input().split())
l=list(map(int,input().split()))
if(k==0):
print(sum(l))
else:
l=sorted(l,reverse=True)
l=l[k:]
print(sum(l))
| [
"call.arguments.add"
] | 596,749 | 596,750 | u221887203 | python |
p02785 | N, K = map(int,(input().split()))
H = list(map(int,(input().split())))
atk=0
H.sort(reverse=True)
del H[0:K]
print(H)
atk=sum(H)
print(atk) | N, K = map(int,(input().split()))
H = list(map(int,(input().split())))
atk=0
H.sort(reverse=True)
del H[0:K]
atk=sum(H)
print(atk) | [
"call.remove"
] | 596,751 | 596,752 | u382407432 | python |
p02785 | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
if(k >= n):
print(0)
else:
b = a[k-1:]
print(sum(b)) | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort(reverse=True)
if(k >= n):
print(0)
else:
b = a[k:]
print(sum(b)) | [
"expression.operation.binary.remove"
] | 596,753 | 596,754 | u256868077 | python |
p02791 | N = int(input())
P = list(map(int, input().split()))
num = P[0]
count = 1
for i in range(1, n):
if num >= P[i]:
count += 1
num = P[i]
print(count) | N = int(input())
P = list(map(int, input().split()))
num = P[0]
count = 1
for i in range(1, N):
if num >= P[i]:
count += 1
num = P[i]
print(count) | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 596,768 | 596,769 | u629709614 | python |
p02791 | n = int(input())
p = list(map(int,input().split()))
a = p[0]
ans = 0
for i in range(n):
if(a<=p[i]):
ans += 1
a = p[i]
print(ans)
| n = int(input())
p = list(map(int,input().split()))
a = p[0]
ans = 0
for i in range(n):
if(a>=p[i]):
ans += 1
a = p[i]
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 596,776 | 596,777 | u655048024 | python |
p02791 | n = int(input())
p = list(map(int,input().split()))
a = p[0]
ans = 0
for i in range(n):
if(m<=p[i]):
ans += 1
a = p[i]
print(ans) | n = int(input())
p = list(map(int,input().split()))
a = p[0]
ans = 0
for i in range(n):
if(a>=p[i]):
ans += 1
a = p[i]
print(ans) | [
"control_flow.loop.for.condition.change"
] | 596,778 | 596,777 | u655048024 | python |
p02791 | n = int(input())
P = list(map(int, input().split( )))
mas = P[0]
ans = 1
for i in range(n-1):
if mas >= P[i+1]:
ans += 1
mas = max(mas,P[i+1])
print(ans) | n = int(input())
P = list(map(int, input().split( )))
mas = P[0]
ans = 1
for i in range(n-1):
if mas >= P[i+1]:
ans += 1
mas = min(mas,P[i+1])
print(ans) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 596,779 | 596,780 | u046826851 | python |
p02791 | n=map(int,input().split())
*p,=map(int,input().split())
lmin=0
ans=0
for pp in p:
ans+=1 if pp<=lmin else 0
lmin=min(pp,lmin)
print(ans)
| n=map(int,input().split())
*p,=map(int,input().split())
lmin=10**10
ans=0
for pp in p:
ans+=1 if pp<=lmin else 0
lmin=min(pp,lmin)
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 596,789 | 596,790 | u860829879 | python |
p02791 | N = int(input())
P = list(map(lambda p : int(p), input().split(" ")))
left_min = P[0]
cnt = 0
for i in range(P):
if left_min >= P[i]:
cnt += 1
left_min = P[i]
print(cnt) | N = int(input())
P = list(map(lambda p : int(p), input().split(" ")))
left_min = P[0]
cnt = 0
for i in range(len(P)):
if left_min >= P[i]:
cnt += 1
left_min = P[i]
print(cnt) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 596,791 | 596,792 | u739843002 | python |
p02791 | N = int(input())
ls = list(map(int,input().split()))
ii = 0
minls = N
for i in range(N):
if ls[i] <= minls:
ii += 1
minls = max(minls,ls[i])
print(ii) | N = int(input())
ls = list(map(int,input().split()))
ii = 0
minls = N
for i in range(N):
if ls[i] <= minls:
ii += 1
minls = min(minls,ls[i])
print(ii) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 596,813 | 596,814 | u875769753 | python |
p02791 | N = int(input())
ls = list(map(int,input().split()))
ii = 0
maxls = 0
for i in range(N):
if ls[i] <= maxls:
ii += 1
maxls = max(maxls,ls[i])
print(ii) | N = int(input())
ls = list(map(int,input().split()))
ii = 0
minls = N
for i in range(N):
if ls[i] <= minls:
ii += 1
minls = min(minls,ls[i])
print(ii) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"call.function.change",
"call.arguments.change"
] | 596,815 | 596,814 | u875769753 | python |
p02791 | n = int(input())
a = list(map(int, input().split()))
count = 0
m = a[0]
for i in range(1, n):
if a[i] <= m:
m = a[i]
count += 1
print(count) | n = int(input())
a = list(map(int, input().split()))
count = 0
m = a[0]
for i in range(n):
if a[i] <= m:
m = a[i]
count += 1
print(count) | [
"call.arguments.change"
] | 596,820 | 596,821 | u581403769 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
count = 0
r = p[0]
for i in range(1, n+1):
s = min(r, p[i-1])
if (s == p[i-1]):
count += 1
print(count) | n = int(input())
p = list(map(int, input().split()))
count = 0
s = p[0]
for i in range(1, n+1):
s = min(s, p[i-1])
if (s == p[i-1]):
count += 1
print(count) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 596,822 | 596,823 | u641460756 | python |
p02791 | N = int(input())
P = list(map(int, input().split()))
ans = 0
min_num = P[0]
for n in P:
if n < min_num:
min_num = n
ans += 1
print(ans) | N = int(input())
P = list(map(int, input().split()))
ans = 1
min_num = P[0]
for n in P:
if n < min_num:
min_num = n
ans += 1
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 596,827 | 596,828 | u531599639 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
num = 0
res = 0
for v in p:
if num > v:
res += 1
num = v
print(res) | n = int(input())
p = list(map(int, input().split()))
num = n + 1
res = 0
for v in p:
if num > v:
res += 1
num = v
print(res) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 596,831 | 596,832 | u653837719 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(0,n):
mins[i] = min(p[i-1], p[i])
ans=1
for i in range(1, n):
if p[i] <= mins[i]:
ans+=1
print(ans) | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(mins[i-1], p[i])
ans=0
for i in range(0, n):
if p[i] <= mins[i]:
ans+=1
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"assignment.value.change",
"identifier.change"
] | 596,846 | 596,847 | u687574784 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(p[i-1], p[i])
ans=1
for i in range(1, n):
if p[i] <= mins[i]:
ans+=1
print(ans) | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(mins[i-1], p[i])
ans=0
for i in range(0, n):
if p[i] <= mins[i]:
ans+=1
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.integer.change",
"control_flow.loop.range.bounds.lower.change"
] | 596,848 | 596,847 | u687574784 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(p[i-1], p[i])
ans=1
for i in range(1, n):
if p[i] <= mins[i-1]:
ans+=1
print(ans) | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(mins[i-1], p[i])
ans=0
for i in range(0, n):
if p[i] <= mins[i]:
ans+=1
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.integer.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 596,849 | 596,847 | u687574784 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(p[i-1], p[i])
ans=0
for i in range(n):
if p[i] <= mins[i]:
ans+=1
print(ans) | n = int(input())
p = list(map(int, input().split()))
mins=[0]*n
mins[0]=p[0]
for i in range(1,n):
mins[i] = min(mins[i-1], p[i])
ans=0
for i in range(0, n):
if p[i] <= mins[i]:
ans+=1
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.arguments.add"
] | 596,850 | 596,847 | u687574784 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
pre = p[0]
ans = 0
for i in p:
if pre <= i:
ans += 1
pre = i
print(ans) | n = int(input())
p = list(map(int, input().split()))
pre = p[0]
ans = 0
for i in p:
if i <= pre:
ans += 1
pre = i
print(ans) | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 596,851 | 596,852 | u167647458 | python |
p02791 | n=int(input())
p=list(map(int,input().split()))
a=0
b=10**10
for i in range(n):
if p[i] <= b:
a+=1
b=a
else:
pass
print(a+1) | n=int(input())
p=list(map(int,input().split()))
a=0
b=10**10
for i in range(n):
if p[i] <= b:
a+=1
b=p[i]
else:
pass
print(a) | [
"assignment.value.change",
"expression.operation.binary.remove"
] | 596,855 | 596,856 | u580316619 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
mn = p[0]
cnt = 0
for i in range(n):
if p[i] <= mn:
cnt += 1
mn = max(mn, p[i])
print(cnt) | n = int(input())
p = list(map(int, input().split()))
mn = p[0]
cnt = 0
for i in range(n):
if p[i] <= mn:
cnt += 1
mn = min(mn, p[i])
print(cnt) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 596,857 | 596,858 | u517621096 | python |
p02791 | N = int(input())
P = list(map(int, input().split()))
ans = 0
tmp = P[0]
for i in range(1,N):
if P[i] <= P[0]:
ans+=1
tmp = P[i]
print(ans) | N = int(input())
P = list(map(int, input().split()))
ans = 1
tmp = P[0]
for i in range(1,N):
if P[i] <= tmp:
ans+=1
tmp = P[i]
print(ans) | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 596,859 | 596,860 | u189516107 | python |
p02791 | N = int(input())
P = list(map(int, input().split()))
ans = 0
maximum = 0
for p in P:
if p >= maximum:
maximum = p
ans += 1
print(ans) | N = int(input())
P = list(map(int, input().split()))
ans = 0
minimum = 200001
for p in P:
if p <= minimum:
minimum = p
ans += 1
print(ans) | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"control_flow.loop.for.condition.change"
] | 596,865 | 596,866 | u536034761 | python |
p02791 | n=int(input())
b=list(map(int,input().split()))
count=1
temp=[b[0]]
for i in range(1,n):
if b[i]==min(b[i],temp):
count=count+1
temp=b[i]
print(count) | n=int(input())
b=list(map(int,input().split()))
count=1
temp=b[0]
for i in range(1,n):
if b[i]==min(b[i],temp):
count=count+1
temp=b[i]
print(count) | [] | 596,867 | 596,868 | u629350026 | python |
p02791 | N=int(input())
P=list(map(int,input().split()))
ans=1
MIN=10**6
for i in range(1,N):
MIN=min(MIN,P[i])
if MIN>=P[i]:
ans+=1
print(ans) | N=int(input())
P=list(map(int,input().split()))
ans=0
MIN=10**6
for i in range(N):
MIN=min(MIN,P[i])
if MIN>=P[i]:
ans+=1
print(ans) | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 596,869 | 596,870 | u829249049 | python |
p02791 | N = int(input())
P = list(map(int, input().split()))
ans=0
p_min=S[0]
for i in range(N):
if p_min >= P[i]:
ans += 1
p_min = P[i]
print(ans)
| N = int(input())
P = list(map(int, input().split()))
ans=0
p_min=P[0]
for i in range(N):
if p_min >= P[i]:
ans += 1
p_min = P[i]
print(ans)
| [
"assignment.value.change",
"identifier.change"
] | 596,881 | 596,882 | u225493896 | python |
p02791 | # cook your dish here
n=int(input())
a=list(map(int,input().split()))
st=[]
ans=0
for i in range(n):
if i==0:
st.append(a[i])
else:
if st[-1]>=a[i]:
ans+=1
else:
st.append(a[i])
print(ans) | # cook your dish here
n=int(input())
a=list(map(int,input().split()))
st=[]
ans=0
for i in range(n):
if i==0:
st.append(a[i])
ans+=1
else:
if st[-1]>=a[i]:
ans+=1
st.append(a[i])
print(ans) | [] | 596,892 | 596,893 | u440608859 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
answer = 0
m = 0
for i in range(n):
if i == 0:
answer += 1
m = p[i]
elif p[i] <= m:
answer += 1
min = p[i]
print(answer) | n = int(input())
p = list(map(int,input().split()))
answer = 0
m = 0
for i in range(n):
if i == 0:
answer += 1
m = p[i]
continue
if p[i] <= m:
answer += 1
m = p[i]
print(answer) | [
"assignment.variable.change",
"identifier.change"
] | 596,902 | 596,903 | u283782321 | python |
p02791 | N=int(input())
P=list(map(int,input().split()))
min_p=P[0]
cnt=0
for i in range(N):
if min_p>P[i]:
min_p=P[i]
else:
cnt+=1
print(cnt) | N=int(input())
P=list(map(int,input().split()))
min_p=P[0]
cnt=0
for i in range(N):
if min_p>=P[i]:
min_p=P[i]
cnt+=1
print(cnt) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 596,915 | 596,916 | u962330718 | python |
p02791 | N=int(input())
lst=list(map(int,input().split()))
s=0
min=lst[0]
for i in lst:
if i<min:
min=i
s+=1
print(s) | N=int(input())
lst=list(map(int,input().split()))
s=0
min=lst[0]
for i in lst:
if i<=min:
min=i
s+=1
print(s) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 596,925 | 596,926 | u798675549 | python |
p02791 | N = int(input())
Pn = list(map(int, input().split()))
p_min = Pn[0]
cnt = 0
for i in Pn:
if i <=p_min:
cnt += 1
p_min = min(p_min, i)
| N = int(input())
Pn = list(map(int, input().split()))
p_min = Pn[0]
count = 0
for i in Pn:
if i <=p_min:
count += 1
p_min = min(p_min, i)
print(count) | [
"misc.typo",
"assignment.variable.change",
"identifier.change",
"call.add"
] | 596,933 | 596,934 | u124499550 | python |
p02791 | N = int(input())
P = [int(x) for x in input().split()]
cnt=1
tmp=P[0]
for i in range(1, N):
if min(tmp, P[i-1]) >= P[i]:
cnt+=1
# print(i, cnt)
print(cnt) | N = int(input())
P = [int(x) for x in input().split()]
cnt=1
tmp=P[0]
for i in range(1, N):
tmp = min(tmp, P[i-1])
if tmp >= P[i]:
cnt+=1
# print(i, cnt)
print(cnt) | [
"assignment.variable.change",
"control_flow.branch.if.add"
] | 596,948 | 596,949 | u461833298 | python |
p02791 | n = int(input())
numbers = list(map(int, input().split()))
count = 1
past = 0
for i in numbers:
if past > i:
count += 1
past = i
print(count)
| n = int(input())
numbers = list(map(int, input().split()))
count = 0
past = 10 ** 6
for i in numbers:
if past > i:
count += 1
past = i
print(count)
| [
"assignment.remove",
"assignment.add"
] | 596,954 | 596,955 | u420344407 | python |
p02791 | n = int(input())
numbers = list(map(int, input().split()))
count = 1
past = -9999999999999999999999999999
for i in numbers:
if past > i:
count += 1
past = i
print(count)
| n = int(input())
numbers = list(map(int, input().split()))
count = 0
past = 10 ** 6
for i in numbers:
if past > i:
count += 1
past = i
print(count)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 596,956 | 596,955 | u420344407 | python |
p02791 | n = int(input())
numbers = list(map(int, input().split()))
count = 1
past = 0
for i in numbers:
if past > i:
count += 1
past = i
print(count)
| n = int(input())
numbers = list(map(int, input().split()))
count = 0
past = 10 ** 6
for i in numbers:
if past > i:
count += 1
past = i
print(count)
| [
"assignment.remove",
"assignment.add"
] | 596,957 | 596,955 | u420344407 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
cnt = 0
tmp_min = p[0]
for i in range(n-1):
tmp_min = min(tmp_min, p[i])
if tmp_min == p[i]:
cnt += 1
print(cnt) | n = int(input())
p = list(map(int, input().split()))
cnt = 1
tmp_min = p[0]
for i in range(1, n):
tmp_min = min(tmp_min, p[i])
if tmp_min == p[i]:
cnt += 1
print(cnt) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.remove",
"call.arguments.add"
] | 596,960 | 596,961 | u723345499 | python |
p02791 | n=int(input())
p=list(map(int,input().split()))
ans=0
m=max(p)
for i in range(n):
if m>p[i]:
ans+=1
m=p[i]
print(ans) | n=int(input())
p=list(map(int,input().split()))
ans=0
m=n+1
for i in range(n):
if m>p[i]:
ans+=1
m=p[i]
print(ans) | [
"call.arguments.change"
] | 596,967 | 596,968 | u240249402 | python |
p02791 | N = int(input())
P = list(map(int, input().split()))
cnt = 0
min_n = P[0]
for i in range(N):
if min_n >= P[i]:
cnt += 1
min_p = P[i]
print(cnt) | N = int(input())
P = list(map(int, input().split()))
cnt = 0
min_n = P[0]
for i in range(N):
if min_n >= P[i]:
cnt += 1
min_n = P[i]
print(cnt) | [
"assignment.variable.change",
"identifier.change"
] | 596,983 | 596,984 | u760636024 | python |
p02791 | N = int(input())
P =list( map(int, input().split()))
s = P[0]
t = min(P)
Pmin = [P[0]]
for i in range(N - 1):
if P[i + 1] < Pmin[i]:
Pmin.append(P[i + 1])
else:
Pmin.append(Pmin[i])
print(Pmin)
cnt = 0
for j in range(N):
if P[j] == Pmin[j]:
cnt += 1
else:
pass
print(cnt) | N = int(input())
P =list( map(int, input().split()))
s = P[0]
t = min(P)
Pmin = [P[0]]
for i in range(N - 1):
if P[i + 1] < Pmin[i]:
Pmin.append(P[i + 1])
else:
Pmin.append(Pmin[i])
cnt = 0
for j in range(N):
if P[j] == Pmin[j]:
cnt += 1
else:
pass
print(cnt) | [
"call.remove"
] | 596,991 | 596,992 | u174181999 | python |
p02791 | N = int(input())
P =list( map(int, input().split()))
s = P[0]
t = min(P)
Pmin = [P[0]]
for i in range(N - 1):
if P[i + 1] < P[i]:
Pmin.append(P[i + 1])
else:
Pmin.append(Pmin[i])
cnt = 0
for j in range(N):
if P[j] == Pmin[j]:
cnt += 1
else:
pass
print(cnt) | N = int(input())
P =list( map(int, input().split()))
s = P[0]
t = min(P)
Pmin = [P[0]]
for i in range(N - 1):
if P[i + 1] < Pmin[i]:
Pmin.append(P[i + 1])
else:
Pmin.append(Pmin[i])
cnt = 0
for j in range(N):
if P[j] == Pmin[j]:
cnt += 1
else:
pass
print(cnt) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 596,993 | 596,992 | u174181999 | python |
p02791 | #!/usr/bin/env python3
def main():
N = int(input())
*P, = map(int, input().split())
mini = 10**6
cnt = 0
for _ in P:
if _ >= mini:
mini = _
cnt += 1
else:
continue
print(cnt)
main() | #!/usr/bin/env python3
def main():
N = int(input())
*P, = map(int, input().split())
mini = 10**6
cnt = 0
for _ in P:
if _ < mini:
mini = _
cnt += 1
else:
continue
print(cnt)
main() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,004 | 597,005 | u428891594 | python |
p02791 | #!/usr/bin/env python3
def main():
N = int(input())
*P, = map(int, input().split())
mini = 2*10**5
cnt = 0
for _ in P:
if _ >= mini:
mini = _
cnt += 1
else:
continue
print(cnt)
main() | #!/usr/bin/env python3
def main():
N = int(input())
*P, = map(int, input().split())
mini = 10**6
cnt = 0
for _ in P:
if _ < mini:
mini = _
cnt += 1
else:
continue
print(cnt)
main() | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,006 | 597,005 | u428891594 | python |
p02791 | n = int(input())
P = list(map(int, input().split()))
t = 0
m = P[0]
for i in range(1, n):
if m > P[i]:
m = P[i]
t += 1
print(t)
| n = int(input())
P = list(map(int, input().split()))
t = 1
m = P[0]
for i in range(1, n):
if m > P[i]:
m = P[i]
t += 1
print(t)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 597,009 | 597,010 | u745687363 | python |
p02791 | N = int(input)
P = list(map(int, input().split()))
result = 0
mini = [P[0]]
for i in range(N-1):
if mini[i]>P[i+1]:
mini.append(P[i+1])
else:
mini.append(mini[i])
for i in range(N):
if P[i]==mini[i]:
result += 1
print(result)
| N = int(input())
P = list(map(int, input().split()))
result = 0
mini = [P[0]]
for i in range(N-1):
if mini[i]>P[i+1]:
mini.append(P[i+1])
else:
mini.append(mini[i])
for i in range(N):
if P[i]==mini[i]:
result += 1
print(result) | [
"call.add"
] | 597,021 | 597,022 | u904081717 | python |
p02791 | import numpy as np
n = int(input())
p = np.array(input().split(),dtype=int)
maxp = 0
ans = 0
for i in p:
if i < maxp:
maxp = i
ans += 1
print(ans)
| import numpy as np
n = int(input())
p = np.array(input().split(),dtype=int)
minp = n+1
ans = 0
for i in p:
if i < minp:
minp = i
ans += 1
print(ans)
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 597,023 | 597,024 | u169350228 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
# 2重ループにすると楽に書けるが計算量が10^10になり厳しいので、
# min_i[i] = (x[0]～x[i]の中での最小値) という配列をつくった
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
print(n-count)
| [
"expression.operation.binary.remove"
] | 597,042 | 597,043 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(0,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
# 2重ループにすると楽に書けるが計算量が10^10になり厳しいので、
# min_i[i] = (x[0]～x[i]の中での最小値) という配列をつくった
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
print(n-count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 597,044 | 597,043 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(0,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
# 2重ループにすると楽に書けるが計算量が10^10になり厳しいので、
# min_i[i] = (x[0]～x[i]の中での最小値) という配列をつくった
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
print(n-count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 597,045 | 597,043 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
print(n-count)
| [
"expression.operation.binary.remove"
] | 597,042 | 597,046 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(0,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
print(n-count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 597,044 | 597,046 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(0,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
print(n-count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 597,045 | 597,046 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| [
"expression.operation.binary.remove"
] | 597,042 | 597,047 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(0,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 597,044 | 597,047 | u864843416 | python |
p02791 | n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(0,n-1):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| n=int(input())
x=list(map(int,input().split()))
min_i = [x[0]]
for i in range(1,n):
min_i.append(min(min_i[i-1],x[i]))
count=0
for i in range(1,n):
if min_i[i-1] < x[i]:
count=count+1
# if x[i-1]>=x[i]:
# count=count+1
#if min(x)==x[n-1]:
# count=count+1
print(n-count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 597,045 | 597,047 | u864843416 | python |
p02791 | N = int(input())
P = list(input().split())
ans = 1
hoge = P[0]
for i in range(1,N):
if P[i] < hoge:
ans+=1
hoge = P[i]
print(ans) | N = int(input())
P = list(map(int, input().split()))
ans = 1
hoge = P[0]
for i in range(1,N):
if P[i] < hoge:
ans+=1
hoge = P[i]
print(ans) | [
"call.add",
"call.arguments.change"
] | 597,050 | 597,051 | u863955163 | python |
p02791 | a=int(input())
b=list(map(int,input().split()))
k=1
v=b[0]
for i in range(a):
if b[i]<v:
k+=1
print(k) | a=int(input())
b=list(map(int,input().split()))
k=1
v=b[0]
for i in range(a):
if b[i]<v:
k+=1
v=b[i]
print(k) | [
"assignment.add"
] | 597,052 | 597,053 | u907446975 | python |
p02791 | n = int(input())
l = list(map(int, input().split()))
count = 0
num = l[0]
ans = 1
for i in range(1,n):
if num >= l[i]:
count = count + 1
num = l[i]
print(count) | n = int(input())
l = list(map(int, input().split()))
count = 0
num = l[0]
count = 1
for i in range(1,n):
if num >= l[i]:
count = count + 1
num = l[i]
print(count) | [
"assignment.variable.change",
"identifier.change"
] | 597,055 | 597,056 | u374829922 | python |
p02791 | n = int(input())
l = list(map(int, input().split()))
count = 0
num = l[0]
for i in range(1,n):
if num >= l[i]:
count = count + 1
num = l[i]
print(count) | n = int(input())
l = list(map(int, input().split()))
count = 0
num = l[0]
count = 1
for i in range(1,n):
if num >= l[i]:
count = count + 1
num = l[i]
print(count) | [
"assignment.add"
] | 597,057 | 597,056 | u374829922 | python |
p02791 | N = int(input())
P_list = [int(i) for i in input().split()]
# cnt = 1 # 1件目は必ず合致するので
# for i in range(1,len(P_list)) :
# pi = P_list[i]
# is_match = True
# for j in range(i) : # Pi==Pjは必ず正なのでジャッジ不要
# pj = P_list[j]
# if (pi > pj) :
# is_match = False
# break
# ... | N = int(input())
P_list = [int(i) for i in input().split()]
# cnt = 1 # 1件目は必ず合致するので
# for i in range(1,len(P_list)) :
# pi = P_list[i]
# is_match = True
# for j in range(i) : # Pi==Pjは必ず正なのでジャッジ不要
# pj = P_list[j]
# if (pi > pj) :
# is_match = False
# break
# ... | [
"call.remove"
] | 597,069 | 597,070 | u993642190 | python |
p02791 | N = int(input())
A = list(map(int,input().split()))
min = N + 1
AC = 0
for i in range(N):
if min < A[i]:
min = A[i]
AC += 1
print(AC) | N = int(input())
A = list(map(int,input().split()))
min = N + 1
AC = 0
for i in range(N):
if min > A[i]:
min = A[i]
AC += 1
print(AC) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,073 | 597,074 | u514118270 | python |
p02791 | N = int(input())
A = list(map(int,input().split()))
min = N + 1
AC = 0
for i in range(N):
if min > A[i]:
AC += 1
print(AC) | N = int(input())
A = list(map(int,input().split()))
min = N + 1
AC = 0
for i in range(N):
if min > A[i]:
min = A[i]
AC += 1
print(AC) | [
"assignment.add"
] | 597,075 | 597,074 | u514118270 | python |
p02791 | N=int(input())
P=list(map(int,input().split()))
ans=0
MAX=P[0]
for i in range(N):
if P[i]>=MAX:
ans=ans+1
MAX=P[i]
print(ans) |
N=int(input())
P=list(map(int,input().split()))
ans=0
MIN=P[0]
for i in range(N):
if P[i]<=MIN:
ans=ans+1
MIN=P[i]
print(ans) | [
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 597,086 | 597,087 | u111652094 | python |
p02791 | N = int(input())
P = list(map(int,input().split()))
ans = 1
small = N
for i in range(1,N):
if P[i] <= small:
ans += 1
small = P[i]
print(ans) | N = int(input())
P = list(map(int,input().split()))
ans = 1
small = P[0]
for i in range(1,N):
if P[i] <= small:
ans += 1
small = P[i]
print(ans) | [
"assignment.value.change"
] | 597,093 | 597,094 | u460185449 | python |
p02791 | n=int(input())
p=list(map(int,input().split()))
m=10**6
ans=1
for i in p:
if m>i:
m=i
ans+=1
print(ans) | n=int(input())
p=list(map(int,input().split()))
m=10**6
ans=0
for i in p:
if m>i:
m=i
ans+=1
print(ans) | [
"literal.number.integer.change",
"assignment.value.change"
] | 597,099 | 597,100 | u017415492 | python |
p02791 | n = int(input())
p = list(map(int, input().split()))
ans = 0
m = p[0]
for x in p:
if x <= m:
ans += 1
m = max(m, x)
print(ans) | n = int(input())
p = list(map(int, input().split()))
ans = 0
m = p[0]
for x in p:
if x <= m:
ans += 1
m = min(m, x)
print(ans) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 597,101 | 597,102 | u955251526 | python |
p02791 | import numpy as np
from collections import Counter
# 最頻値
def mode(list):
c = Counter(list)
freq_scores = c.most_common()
max_count = freq_scores[0][1]
modes = []
for num in freq_scores:
if num[1] == max_count:
modes.append(num[0])
return(modes)
n = int(input())
p_list = lis... | import numpy as np
from collections import Counter
# 最頻値
def mode(list):
c = Counter(list)
freq_scores = c.most_common()
max_count = freq_scores[0][1]
modes = []
for num in freq_scores:
if num[1] == max_count:
modes.append(num[0])
return(modes)
n = int(input())
p_list = lis... | [
"expression.operation.binary.remove",
"call.arguments.add",
"control_flow.loop.for.condition.change"
] | 597,112 | 597,113 | u075304271 | python |
p02791 | import numpy as np
n = int(input())
p = np.array(input().split(), dtype = int)
num = 0
las = 0
for i in range(n):
if p[las] <= p[i]:
las = i
num += 1
print(num)
| import numpy as np
n = int(input())
p = np.array(input().split(), dtype = int)
num = 0
las = 0
for i in range(n):
if p[las] >= p[i]:
las = i
num += 1
print(num)
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,140 | 597,141 | u769383879 | python |
p02791 | n = int(input())
a = list(map(int, input()))
ans = 1
tmp = a[0]
for i in a:
if i < tmp:
tmp = i
ans += 1
print(ans) | n = int(input())
a = list(map(int, input().split()))
ans = 1
tmp = a[0]
for i in a:
if i < tmp:
tmp = i
ans += 1
print(ans) | [
"call.add"
] | 597,144 | 597,145 | u569195503 | python |
p02791 | N=int(input())
a = [int(x) for x in input().split()]
count=1
mini=a[0]
print(a)
for i in range (1,N):
if a[i]<mini:
count=count+1
mini=a[i]
print(count) | N=int(input())
a = [int(x) for x in input().split()]
count=1
mini=a[0]
for i in range (1,N):
if a[i]<mini:
count=count+1
mini=a[i]
print(count) | [
"call.remove"
] | 597,158 | 597,159 | u799635973 | python |
p02791 | N=int(input())
L=list(map(int,input().split()))
ans=0
prev=-1
for l in L:
if l<prev:
ans+=1
prev=l
else:
continue
print(ans) | N=int(input())
L=list(map(int,input().split()))
ans=0
prev=float('inf')
for l in L:
if l<prev:
ans+=1
prev=l
else:
continue
print(ans)
| [
"call.arguments.add"
] | 597,193 | 597,194 | u375616706 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.