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=input()
arr=input().split()
min=int(arr[0])
cnt=0
for i in range(len(arr)):
if min >= int(arr[i]):
cnt+=1
else:
min = int(arr[i])
print(cnt)
|
N=input()
arr=input().split()
min=int(arr[0])
cnt=0
for i in range(len(arr)):
if min >= int(arr[i]):
cnt+=1
min = int(arr[i])
print(cnt)
|
[] | 597,201
| 597,202
|
u474214924
|
python
|
p02791
|
N=input()
arr=input().split()
min=int(arr[0])
cnt=0
for i in range(len(arr)):
if min >= int(arr[i]):
cnt+=1
print(i)
else:
min = int(arr[i])
print(cnt)
|
N=input()
arr=input().split()
min=int(arr[0])
cnt=0
for i in range(len(arr)):
if min >= int(arr[i]):
cnt+=1
min = int(arr[i])
print(cnt)
|
[
"call.remove"
] | 597,203
| 597,202
|
u474214924
|
python
|
p02791
|
n=int(input().split())
arr=list(map(int,input().split()))
ans=1
least=arr[0]
for i in range(1,n):
if arr[i]<=least:
ans+=1
least=min(least,arr[i])
print(ans)
|
n=int(input())
arr=list(map(int,input().split()))
ans=1
least=arr[0]
for i in range(1,n):
if arr[i]<=least:
ans+=1
least=min(least,arr[i])
print(ans)
|
[
"call.remove"
] | 597,208
| 597,209
|
u163320134
|
python
|
p02791
|
n = int(input())
p =[i for i in input().split()]
count = 0
min_p = p[0]
for i in range(n):
if p[i] <= min_p:
min_p = p[i]
count += 1
print(count)
|
n = int(input())
p =[int(i) for i in input().split()]
count = 0
min_p = p[0]
for i in range(n):
if p[i] <= min_p:
min_p = p[i]
count += 1
print(count)
|
[
"call.add",
"call.arguments.change"
] | 597,211
| 597,212
|
u491762407
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
count = 1
a = P[0]
for i in range(N-1):
b = min(a,P[i])
if b >= P[i+1]:
count += 1
print(count)
|
N = int(input())
P = list(map(int,input().split()))
count = 1
a = P[0]
for i in range(N-1):
b = min(a,P[i])
if b >= P[i+1]:
count += 1
a = b
print(count)
|
[
"assignment.add"
] | 597,213
| 597,214
|
u318740143
|
python
|
p02791
|
N = int(input())
num = list(map(int,input().split()))
ans = 1
min = num[0]
for i in range(N-1):
if min > num[i]:
ans += 1
min = num[i]
print(ans)
|
N = int(input())
num = list(map(int,input().split()))
ans = 1
min = num[0]
for i in range(1,N):
if min > num[i]:
ans += 1
min = num[i]
print(ans)
|
[
"expression.operation.binary.remove",
"call.arguments.add"
] | 597,217
| 597,218
|
u492713440
|
python
|
p02791
|
N = int(input())
num = list(map(int,input().split()))
ans = 1
min = num[0]
for i in range(1,N):
if num[i] > min:
ans += 1
min = num[i]
print(ans)
|
N = int(input())
num = list(map(int,input().split()))
ans = 1
min = num[0]
for i in range(1,N):
if min > num[i]:
ans += 1
min = num[i]
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 597,219
| 597,218
|
u492713440
|
python
|
p02791
|
a=input(int)
s=list(map(int,input().split()))
count=0
min=s[0]
for i in range(0,a):
if min>=s[i]:
count+=1
min=s[i]
print(count)
|
a=int(input())
s=list(map(int,input().split()))
count=0
min=s[0]
for i in range(0,a):
if min>=s[i]:
count+=1
min=s[i]
print(count)
|
[
"call.add",
"assignment.value.change",
"call.arguments.change"
] | 597,224
| 597,225
|
u129961029
|
python
|
p02791
|
a=input()
s=list(map(int,input().split()))
count=0
min=s[0]
for i in range(1,a):
if min>s[i] :
count+=1
min=s[j]
print(count)
|
a=int(input())
s=list(map(int,input().split()))
count=0
min=s[0]
for i in range(0,a):
if min>=s[i]:
count+=1
min=s[i]
print(count)
|
[
"call.add",
"call.arguments.change",
"literal.number.integer.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 597,226
| 597,225
|
u129961029
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split()))
cnt = 1
min_p = p[0]
if n == 1:
print(n)
else:
for i in range(1, n):
if p[i] > min_p:
min_p = p[i]
cnt += 1
print(cnt)
|
n = int(input())
p = list(map(int, input().split()))
cnt = 1
min_p = p[0]
if n == 1:
print(n)
else:
for i in range(1, n):
if p[i] < min_p:
min_p = p[i]
cnt += 1
print(cnt)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,238
| 597,239
|
u706330549
|
python
|
p02791
|
n = int(input())
p_lst = list(map(int,input().split()))
number = 0
p_i = p_lst[0]
for i in range(n):
if p_lst[i]<=p_i:
number += 1
p_i = p_lst[i]
print(number)
|
n = int(input())
p_lst = list(map(int,input().split()))
number = 1
p_min = p_lst[0]
for i in range(1,n):
if p_lst[i]<=p_min:
number += 1
p_min = p_lst[i]
print(number)
|
[
"call.arguments.add",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 597,244
| 597,245
|
u672316981
|
python
|
p02791
|
n=int(input())
p=list(map(int, input().split()))
cnt=1
min_v=p[0]
for i in range(1,n):
if p[i]>=min_v:
cnt+=1
else:
min_v=p[i]
print(cnt)
|
n=int(input())
p=list(map(int, input().split()))
cnt=1
min_v=p[0]
for i in range(1,n):
if p[i]<=min_v:
cnt+=1
min_v=p[i]
print(cnt)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,257
| 597,258
|
u731448038
|
python
|
p02791
|
n=int(input())
p=list(map(int, input().split()))
cnt=1
min_v=p[0]
for i in range(1,n):
if p[i]>min_v:
cnt+=1
else:
min_v=p[i]
print(cnt)
|
n=int(input())
p=list(map(int, input().split()))
cnt=1
min_v=p[0]
for i in range(1,n):
if p[i]<=min_v:
cnt+=1
min_v=p[i]
print(cnt)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,259
| 597,258
|
u731448038
|
python
|
p02791
|
max = 0
cnt = 0
N = int(input())
P = list(map(int, input().split()))
for i in range(N):
p = P[i]
if max < p:
max = p
cnt += 1
print(cnt)
|
min = 10000000
cnt = 0
N = int(input())
P = list(map(int, input().split()))
for i in range(N):
p = P[i]
if min >= p:
min = p
cnt += 1
print(cnt)
|
[
"misc.opposites",
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"control_flow.loop.for.condition.change"
] | 597,260
| 597,261
|
u137913818
|
python
|
p02791
|
n = int(input())
l = list(map(int,input().split()))
min_num = MAX(l) +1
ans = 0
for i in l:
if min_num >= i:
min_num = i
ans += 1
print(ans)
|
n = int(input())
l = list(map(int,input().split()))
min_num = max(l) +1
ans = 0
for i in l:
if min_num >= i:
min_num = i
ans += 1
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 597,268
| 597,269
|
u178192749
|
python
|
p02791
|
n = list(map(int, input().split()))
cont = 1
x = n[0]
for i in range(len(n)):
if x > n[i]:
cont+=1
x = n[i]
print(cont)
|
s = input()
n = list(map(int, input().split()))
cont = 1
x = n[0]
for i in range(len(n)):
if x > n[i]:
cont+=1
x = n[i]
print(cont)
|
[
"assignment.add"
] | 597,270
| 597,271
|
u244908700
|
python
|
p02791
|
import sys
N = int(sys.stdin.readline())
nums = [int(x) for x in sys.stdin.readline().split]
ans = 0
_min = float('inf')
for num in nums:
if _min >= num:
ans += 1
_min = min(_min, num)
print(ans)
|
import sys
N = int(sys.stdin.readline())
nums = [int(x) for x in sys.stdin.readline().split()]
ans = 0
_min = float('inf')
for num in nums:
if _min >= num:
ans += 1
_min = min(_min, num)
print(ans)
|
[
"call.add"
] | 597,280
| 597,281
|
u899782392
|
python
|
p02791
|
import sys
from operator import itemgetter
import collections
def r(n, p):
m = n + 1
count = 0
for i in range(n):
m = min(p[i], m)
if m == p[i]:
count += 1
return count
def main():
input = sys.stdin.readline
n = int(input())
p = map(int, input().split())
print(r(n,p))
if __name__ == '__main__':
main()
|
import sys
from operator import itemgetter
import collections
def r(n, p):
m = n + 1
count = 0
for i in range(n):
m = min([p[i], m])
if m == p[i]:
count += 1
return count
def main():
input = sys.stdin.readline
n = int(input())
p = list(map(int, input().split()))
print(r(n,p))
if __name__ == '__main__':
main()
|
[
"call.arguments.change",
"call.add"
] | 597,284
| 597,285
|
u303633930
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split()))
q = p[0]
p = p[1:]
m = 1
if n > 1:
for pi in p:
if q > pi:
print(pi)
m += 1
q = pi
print(m)
|
n = int(input())
p = list(map(int, input().split()))
q = p[0]
p = p[1:]
m = 1
if n > 1:
for pi in p:
if q > pi:
m += 1
q = pi
print(m)
|
[
"call.remove"
] | 597,296
| 597,297
|
u308754115
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
count = 0
m = N
for p in reversed(P):
m = min(m, p)
if p <= m:
count += 1
print(count)
|
N = int(input())
P = list(map(int, input().split()))
count = 0
m = N
for p in P:
m = min(m, p)
if p <= m:
count += 1
print(count)
|
[
"call.remove",
"call.arguments.change"
] | 597,308
| 597,309
|
u501952592
|
python
|
p02791
|
n=int(input())
a=list(map(int,input().split()))
b=[]
mx=0
cnt=0
for i in a:
mx=max(mx,i)
if mx<=i:
cnt+=1
print(cnt)
|
n=int(input())
a=list(map(int,input().split()))
b=[]
mx=10**10
cnt=0
for i in a:
mx=min(mx,i)
if mx>=i:
cnt+=1
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,318
| 597,319
|
u427571081
|
python
|
p02791
|
N=int(input())
P=list(map(int,input().split()))
Pmax=P[0]
result=0
for i in range(N):
if P[i]<=Pmax:
result+=1
else:
Pmax=P[i]
print(result)
|
N=int(input())
P=list(map(int,input().split()))
Pmin=P[0]
result=0
for i in range(N):
if P[i]<=Pmin:
result+=1
Pmin=P[i]
print(result)
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 597,324
| 597,325
|
u782616557
|
python
|
p02791
|
# https://atcoder.jp/contests/abc152/submissions/9600286
N = int(input())
P = list(map(int, input().split()))
c = max(P)
count = 0
for i in P:
#リストの始めから探索
#minを保持していく
if i < c:
c=i
count+=1
print(count)
|
# https://atcoder.jp/contests/abc152/submissions/9600286
N = int(input())
P = list(map(int, input().split()))
c = 10**9
count = 0
for i in P:
#リストの始めから探索
#minを保持していく
if i < c:
c=i
count+=1
print(count)
|
[
"call.arguments.change"
] | 597,342
| 597,343
|
u826702060
|
python
|
p02791
|
N = int(input())
M = 0
for P in map(int, input().split()):
if P <= N:
N = x
M += 1
print(M)
|
N = int(input())
M = 0
for P in map(int, input().split()):
if P <= N:
N = P
M += 1
print(M)
|
[
"assignment.value.change",
"identifier.change"
] | 597,350
| 597,351
|
u238987462
|
python
|
p02791
|
n = int(input())
p = [int(i) for i in input().split()]
min = n+1
count = 0
for i in range(n):
if min > p[i]+1:
count += 1
min = p[i]+1
print(count)
|
n = int(input())
p = [int(i) for i in input().split()]
min = n+1
count = 0
for i in range(n):
if min >= p[i]+1:
count += 1
min = p[i]+1
print(count)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,352
| 597,353
|
u218216885
|
python
|
p02791
|
N = int(input())
m = [0]*N
s = input()
m = s.split()
c = 99999999
k = 0
for i in range(N):
m[i] = int(m[i])
if m[i] > c:
c = m[i]
k +=1
print(c)
|
N = int(input())
m = [0]*N
s = input()
m = s.split()
c = 99999999
k = 0
for i in range(N):
m[i] = int(m[i])
if m[i] <= c:
c = m[i]
k +=1
print(k)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 597,376
| 597,377
|
u793565199
|
python
|
p02791
|
import bisect
N = int(input())
P = list(map(int, input().split()))
count = 0
last_min = P[i]
for i in range(N):
last_min = min(last_min, P[i])
if i == 0:
count += 1
elif last_min == P[i]:
count += 1
print(count)
|
import bisect
N = int(input())
P = list(map(int, input().split()))
count = 0
last_min = P[0]
for i in range(N):
last_min = min(last_min, P[i])
if i == 0:
count += 1
elif last_min == P[i]:
count += 1
print(count)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 597,385
| 597,386
|
u595952233
|
python
|
p02791
|
n=int(input())
p=list(map(int,input().split()))
ans=0
mini=10e+7
for i in range(n):
if(p[i]>mini):
ans+=1
mini=p[i]
print(ans)
|
n=int(input())
p=list(map(int,input().split()))
ans=0
mini=10e+6
for i in range(n):
if(mini>p[i]):
ans+=1
mini=p[i]
print(ans)
|
[
"literal.number.float.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 597,390
| 597,391
|
u547167033
|
python
|
p02791
|
n=int(input())
p=list(map(int,input().split()))
ans=0
p_max=n+1
for i in range(n):
if p[i]<p_min:
ans+=1
p_min=p[i]
print(ans)
|
n=int(input())
p=list(map(int,input().split()))
ans=0
p_min=n+1
for i in range(n):
if p[i]<p_min:
ans+=1
p_min=p[i]
print(ans)
|
[
"assignment.variable.change",
"identifier.change"
] | 597,418
| 597,419
|
u217627525
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split()))
count = 0
min = p[0]
for i in range(n):
if min >= p[i]:
count += 1
print(count)
|
n = int(input())
p = list(map(int, input().split()))
count = 0
min = p[0]
for i in range(n):
if min >= p[i]:
count += 1
min = p[i]
print(count)
|
[
"assignment.add"
] | 597,431
| 597,432
|
u785723272
|
python
|
p02789
|
n,m=map(int,input().split())
if(n==m):
print("yes")
else:
print("no")
|
n,m=map(int,input().split())
if(n==m):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 597,552
| 597,553
|
u272975200
|
python
|
p02791
|
n=int(input())
p=map(int,input().split())
for i in range(1,n):p[i]=min(p[i-1],p[i])
print(len(set(p)))
|
n,p=int(input()),list(map(int,input().split()))
for i in range(1,n):p[i]=min(p[i-1],p[i])
print(len(set(p)))
|
[
"call.arguments.change"
] | 597,658
| 597,659
|
u989345508
|
python
|
p02791
|
N = int(input())
P = [ int(i) for i in input().split()]
num = 0
min = N
for base in range(N):
if P[base] < min:
min = P[base]
num += 1
print(num)
|
N = int(input())
P = [ int(i) for i in input().split()]
num = 0
min = N
for base in range(N):
if P[base] <= min:
min = P[base]
num += 1
print(num)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,667
| 597,668
|
u224353074
|
python
|
p02791
|
N = int(input())
list = [int(i) for i in input().split()]
ans = 0
min = 0
for j in rainge(N):
if (min >= list[j]):
abs += 1
min = list[j]
else:
continue
print(ans)
|
N = int(input())
list = [int(i) for i in input().split()]
ans = 0
min = list[0]
for j in range(N):
if (min >= list[j]):
ans += 1
min = list[j]
else:
continue
print(ans)
|
[
"identifier.change",
"call.function.change"
] | 597,673
| 597,674
|
u522185720
|
python
|
p02791
|
n = int(input())
p = [int(i) for i in input().split()]
count = 0
min_value = p[0]
for i in enumerate(p):
if i <= min_value:
count += 1
min_value = i
print(count)
|
n = int(input())
p = [int(i) for i in input().split()]
count = 0
min_value = p[0]
for i in p:
if i <= min_value:
count += 1
min_value = i
print(count)
|
[
"call.remove",
"call.arguments.change"
] | 597,682
| 597,683
|
u430223993
|
python
|
p02791
|
n = int(input())
p = list(map(int,input().split()))
count = 1
min_p = p[1]
for i in range(1,n):
if min_p > p[i]:
count += 1
min_p = p[i]
print(count)
|
n = int(input())
p = list(map(int,input().split()))
count = 1
min_p = p[0]
for i in range(n):
if min_p > p[i]:
count += 1
min_p = p[i]
print(count)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 597,686
| 597,687
|
u756693875
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split( )))
c =0
m = p[0]
for i in range(n):
if m - p[i] > 0:
c += 1
else:
m = p[i]
print(c)
|
n = int(input())
p = list(map(int, input().split( )))
c = 0
m = p[0]
for i in range(n):
if m >= p[i]:
c += 1
m = p[i]
print(c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 597,690
| 597,689
|
u277312083
|
python
|
p02791
|
N=int(input())
P=list(map(int,input().split()))
b=0
a=0
for i in range(N):
if P[i]<=b:
b=P[i]
a+=1
print(a)
|
N=int(input())
P=list(map(int,input().split()))
b=N
a=0
for i in range(N):
if P[i]<=b:
b=P[i]
a+=1
print(a)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 597,697
| 597,698
|
u223555291
|
python
|
p02791
|
N=int(input())
P=list(map(int,input().split()))
b=[]
a=0
for i in range(N):
if P[i]<=b:
b=P[i]
a+=1
print(a)
|
N=int(input())
P=list(map(int,input().split()))
b=N
a=0
for i in range(N):
if P[i]<=b:
b=P[i]
a+=1
print(a)
|
[
"assignment.value.change"
] | 597,699
| 597,698
|
u223555291
|
python
|
p02791
|
n = int(input())
p = [int(x) for x in input.split()]
ans = 0
mn = n
for i in p:
if mn > i:
mn = i
if mn >= i:
ans += 1
print(ans)
|
n = int(input())
p = [int(x) for x in input().split()]
ans = 0
mn = n
for i in p:
if mn > i:
mn = i
if mn >= i:
ans += 1
print(ans)
|
[
"call.add"
] | 597,700
| 597,701
|
u184882264
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split(" ")))
m = P[0]
c = 0
for i in range(1, N):
if P[i] < m:
c += 1
m = P[i]
print(c)
|
N = int(input())
P = list(map(int, input().split(" ")))
m = P[0]
c = 1
for i in range(1, N):
if P[i] < m:
c += 1
m = P[i]
print(c)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 597,711
| 597,712
|
u665224938
|
python
|
p02791
|
p_num = int(input())
p = list(map(int,input().split()))
count = 1
min = p[0]
for i in p[1:]:
if i < min_num:
min_num = i
count += 1
print(count)
|
p_num = int(input())
p = list(map(int,input().split()))
count = 1
min_num = p[0]
for i in p[1:]:
if i < min_num:
min_num = i
count += 1
print(count)
|
[
"assignment.variable.change",
"identifier.change"
] | 597,721
| 597,722
|
u751485759
|
python
|
p02791
|
p_num = int(input())
p = list(map(int,input().split()))
count = 1
min = List[0]
for i in List[1:]:
if i < min_num:
min_num = i
count += 1
print(count)
|
p_num = int(input())
p = list(map(int,input().split()))
count = 1
min_num = p[0]
for i in p[1:]:
if i < min_num:
min_num = i
count += 1
print(count)
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 597,723
| 597,722
|
u751485759
|
python
|
p02791
|
N = int(input())
List = [int(x) for x in input().split()]
cnt = 0
min_num = List[0]
for i in List[1:]:
if i < min_num:
min_num = i
cnt += 1
print(cnt)
|
N = int(input())
List = [int(x) for x in input().split()]
cnt = 1
min_num = List[0]
for i in List[1:]:
if i < min_num:
min_num = i
cnt += 1
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 597,726
| 597,727
|
u973744316
|
python
|
p02791
|
N = int(input())
List = [int(x) for x in input().split()]
cnt = 0
min_num = List[0]
for i in List[1:]:
if i < min_num:
min_num = i
cnt += 1
print(cnt)
|
N = int(input())
List = [int(x) for x in input().split()]
cnt = 1
min_num = List[0]
for i in List[1:]:
if i < min_num:
min_num = i
cnt += 1
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 597,728
| 597,727
|
u973744316
|
python
|
p02791
|
import sys
import math
import itertools
N=int(input())
P=list(map(int,input().split()))
mn=10^6
cnt=1
for i in range(1,N):
if P[i]<=mn:
mn=P[i]
cnt+=1
print(cnt)
|
import sys
import math
import itertools
N=int(input())
P=list(map(int,input().split()))
mn=10**6
cnt=0
for i in range(N):
if P[i]<=mn:
mn=P[i]
cnt+=1
print(cnt)
|
[
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"call.arguments.change"
] | 597,736
| 597,737
|
u934740772
|
python
|
p02791
|
import sys
import math
import itertools
N=int(input())
P=list(map(int,input().split()))
mn=10^6
cnt=1
for i in range(1,N):
if P[i]<=mn:
mn=P[i]
cnt+=1
print(cnt)
|
import sys
import math
import itertools
N=int(input())
P=list(map(int,input().split()))
mn=P[0]
cnt=1
for i in range(1,N):
if P[i]<=mn:
mn=P[i]
cnt+=1
print(cnt)
|
[] | 597,736
| 597,740
|
u934740772
|
python
|
p02791
|
N=int(input())
P=list(map(int,input().split()))
M=0
c=0
for i in range(N):
if M<P[i]:
M=P[i]
c+=1
print(c)
|
N=int(input())
P=list(map(int,input().split()))
M=N
c=0
for i in range(N):
if M>=P[i]:
M=P[i]
c+=1
print(c)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,754
| 597,755
|
u692311686
|
python
|
p02791
|
def func():
return
n = int(input())
# s = input()
# a, b = map(int, input().split())
p = list(map(int, input().split()))
# a = input().split()
cnt = 0
min_ = n
for i in range(n):
if min(min_, p[i]) == p[i]:
cnt += 1
print(cnt)
|
def func():
return
n = int(input())
# s = input()
# a, b = map(int, input().split())
p = list(map(int, input().split()))
# a = input().split()
cnt = 0
min_ = n
for i in range(n):
min_ = min(min_, p[i])
if min_ == p[i]:
cnt += 1
print(cnt)
|
[
"assignment.variable.change",
"control_flow.branch.if.add"
] | 597,762
| 597,763
|
u739259290
|
python
|
p02791
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = a[0]
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = max(a[i],tmp)
print(ans)
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = a[0]
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = min(a[i],tmp)
print(ans)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 597,772
| 597,773
|
u520276780
|
python
|
p02791
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = 0
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = max(a[i],tmp)
print(ans)
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = a[0]
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = min(a[i],tmp)
print(ans)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 597,774
| 597,773
|
u520276780
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split( )))
ans = 0
tmp = 0
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = max(a[i],tmp)
print(ans)
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = a[0]
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = min(a[i],tmp)
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 597,775
| 597,773
|
u520276780
|
python
|
p02791
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = n+1
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = max(a[i],tmp)
print(ans)
|
n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = a[0]
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = min(a[i],tmp)
print(ans)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 597,776
| 597,773
|
u520276780
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
count = 1
minP = P[0]
for i in range(1, N):
if P[i] <= minP:
count = count + 1
minP = P[i]
print(count)
|
N = int(input())
P = list(map(int, input().split()))
count = 1
minP = P[0]
for i in range(1, N):
if P[i] < minP:
count = count + 1
minP = P[i]
print(count)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,804
| 597,805
|
u886832246
|
python
|
p02791
|
# -*- coding: utf-8 -*-
n=int(input())
p = list(map(int, input().split()))
result = []
c = 0
for i in range(0,n):
flag = 0
if smallest >= p[i]:
c += 1
smallest = p[i]
print(c)
|
# -*- coding: utf-8 -*-
n=int(input())
p = list(map(int, input().split()))
result = []
c = 0
smallest = p[0]
for i in range(0,n):
flag = 0
if smallest >= p[i]:
c += 1
smallest = p[i]
print(c)
|
[
"assignment.add"
] | 597,806
| 597,807
|
u619455726
|
python
|
p02791
|
import sys
sysinput = sys.stdin.readline
N = int(sysinput())
P = list(map(int, sysinput().split()))
memo_mini = N
i_count = 1
for i in range(1, N):
if memo_mini > P[i]:
i_count +=1
memo_mini = P[i]
else:
pass
print(i_count)
|
import sys
sysinput = sys.stdin.readline
N = int(sysinput())
P = list(map(int, sysinput().split()))
memo_mini = N
i_count = 0
for i in range(0, N):
if memo_mini >= P[i]:
i_count +=1
memo_mini = P[i]
else:
pass
print(i_count)
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,817
| 597,818
|
u527977536
|
python
|
p02791
|
N = int(input())
P = [i for i in input().split()]
mini = P[0]
ans = 0
for i in P:
if i <= mini:
ans += 1
mini = i
print(ans)
|
N = int(input())
P = [int(i) for i in input().split()]
mini = P[0]
ans = 0
for i in P:
if i <= mini:
ans += 1
mini = i
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 597,823
| 597,824
|
u256281774
|
python
|
p02791
|
N = int(input())
INF = 99999999
P = list(map(int, input().split()))
mins = [INF] * N
ans = 1
mins[0] = P[0]
for i in range(1,N):
if (mins[i-1] > P[i]):
ans += 1
mins[i] = P[i]
# print("i:" + str(i));
# print(mins);
else:
mins[i] = mins[i-1]
|
N = int(input())
INF = 99999999
P = list(map(int, input().split()))
mins = [INF] * N
ans = 1
mins[0] = P[0]
for i in range(1,N):
if (mins[i-1] > P[i]):
ans += 1
mins[i] = P[i]
# print("i:" + str(i));
# print(mins);
else:
mins[i] = mins[i-1]
print(ans)
|
[
"call.add"
] | 597,825
| 597,826
|
u985374340
|
python
|
p02791
|
n=int(input().rstrip())
p=[int(i) for i in input().split()]
a=1
m=p[0]
for i in range(1,n):
if p[i]<=m:
a+=1
print(a)
m=min(m,p[i])
print(a)
|
n=int(input().rstrip())
p=[int(i) for i in input().split()]
a=1
m=p[0]
for i in range(1,n):
if p[i]<=m:
a+=1
m=min(m,p[i])
print(a)
|
[
"call.remove"
] | 597,830
| 597,831
|
u692691139
|
python
|
p02791
|
def Convert(string):
li = list(string.split(" "))
return li
N = input().split()
L = Convert(input())
Min = L[0]
Sum = 0
for i in L:
if i <= Min:
Sum += 1
Min = i
print(Sum)
|
def Convert(string):
li = list(map(int, string.split(" ")))
return li
N = input().split()
L = Convert(input())
Min = L[0]
Sum = 0
for i in L:
if i <= Min:
Sum += 1
Min = i
print(Sum)
|
[
"call.add",
"call.arguments.change"
] | 597,832
| 597,833
|
u770230638
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
ans = 0
m = 0
for i in range(0, N):
if m > P[i]:
m = P[i]
if P[i] <= m:
ans += 1
print(ans)
|
N = int(input())
P = list(map(int, input().split()))
ans = 0
m = P[0]
for i in range(0, N):
if m > P[i]:
m = P[i]
if P[i] <= m:
ans += 1
print(ans)
|
[] | 597,834
| 597,835
|
u547728429
|
python
|
p02791
|
a = int(input())
k = list(map(int, input().split()))
count = 0
min =9999999
for i in range(1,len(k)):
if min > k[i]:
min= k[i]
count += 1
print(count)
|
a = int(input())
k = list(map(int, input().split()))
count = 0
min =99999999
for i in range(len(k)):
if min > k[i]:
min= k[i]
count += 1
print(count)
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 597,842
| 597,843
|
u498575211
|
python
|
p02791
|
N = int(input())
li = list(map(int,input().split()))
ans = 0
data = N
for i in range(N):
if data > li[i]:
ans += 1
data = li[i]
print(ans)
|
N = int(input())
li = list(map(int,input().split()))
ans = 0
data = N
for i in range(N):
if data >= li[i]:
ans += 1
data = li[i]
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,846
| 597,847
|
u488934106
|
python
|
p02791
|
n = int(input())
p = list(map(int,input().split()))
li = [0]*n
sta = 1
for i in range(n):
if p[i] < sta:
li[i]=1
else:
sta = p[i]
print(sum(li))
|
n = int(input())
p = list(map(int,input().split()))
li = [0]*n
sta = n
for i in range(n):
if p[i] <= sta:
li[i]=1
sta = p[i]
print(sum(li))
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,852
| 597,853
|
u793666115
|
python
|
p02791
|
n = int(input())
n_list = list(map(int, input().split()))
min_num = n
count = 0
for i in range(n):
if min_num > n_list[i]:
min_num = n_list[i]
count += 1
print(count)
|
n = int(input())
n_list = list(map(int, input().split()))
min_num = n
count = 0
for i in range(n):
if min_num >= n_list[i]:
min_num = n_list[i]
count += 1
print(count)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,854
| 597,855
|
u046961553
|
python
|
p02791
|
n = int(input())
p = [int(s) for s in input().split()]
count = 0
m = p[0]
for a in range(n):
i = p[a]
if M>=i:
count+=1
m = i
print(count)
|
n = int(input())
p = [int(s) for s in input().split()]
count = 0
M = p[0]
for a in range(n):
i = p[a]
if M >=i :
count+=1
M = i
print(count)
|
[
"assignment.variable.change",
"identifier.change"
] | 597,856
| 597,857
|
u343523553
|
python
|
p02791
|
N = int(input())
p_n = list(input().split())
result = 0
min_tmp = N + 1
for x in range(N):
if p_n[x] < min_tmp:
result += 1
min_tmp = min(min_tmp,p_n[x])
print(result)
|
N = int(input())
p_n = list(map(int,input().split()))
result = 0
min_tmp = N + 1
for x in range(N):
if p_n[x] < min_tmp:
result += 1
min_tmp = min(min_tmp,p_n[x])
print(result)
|
[
"call.add",
"call.arguments.change"
] | 597,864
| 597,865
|
u195355592
|
python
|
p02791
|
N = int(input())
a = input().rstrip().split()
P = [0] * N
for i in range(N):
P[i] = int(a[i])
minP = P[0]
ans = 1
for i in range(N - 1):
if P[i] >= P[i + 1]:
ans += 1
minP = P[i + 1]
print(ans)
|
N = int(input())
a = input().rstrip().split()
P = [0] * N
for i in range(N):
P[i] = int(a[i])
minP = P[0]
ans = 1
for i in range(N - 1):
if minP >= P[i + 1]:
ans += 1
minP = P[i + 1]
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 597,866
| 597,867
|
u017050982
|
python
|
p02791
|
N = int(input())
a = input().rstrip().split()
P = [0] * N
for i in range(N):
P[i] = int(a[i])
minP = P[0]
ans = 1
for i in range(N - 1):
if P[i] > P[i + 1]:
ans += 1
minP = P[i + 1]
print(ans)
|
N = int(input())
a = input().rstrip().split()
P = [0] * N
for i in range(N):
P[i] = int(a[i])
minP = P[0]
ans = 1
for i in range(N - 1):
if minP >= P[i + 1]:
ans += 1
minP = P[i + 1]
print(ans)
|
[
"control_flow.loop.for.condition.change"
] | 597,868
| 597,867
|
u017050982
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split()))
lowest = 2 * 10 ** 5 + 1000
cnt = n
for i in range(n):
if lowest < p[i]:
cnt -= 1
lowest = p[i]
print(cnt)
|
n = int(input())
p = list(map(int, input().split()))
lowest = 2 * 10 ** 5 + 1000
cnt = n
for i in range(n):
if lowest < p[i]:
cnt -= 1
lowest = min(lowest, p[i])
print(cnt)
|
[
"call.add",
"call.arguments.change"
] | 597,887
| 597,888
|
u325956328
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
M = P[0]
ans = 1
if N == 1:
print(1)
else:
for i in range(1,N):
if P[i] < M:
M = P[i]
ans += 1
print(ans)
|
N = int(input())
P = list(map(int,input().split()))
M = P[0]
ans = 1
if N == 1:
print(1)
else:
for i in range(1,N):
if P[i] <= M:
M = P[i]
ans += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 597,905
| 597,906
|
u376099073
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
maxP = P[0]
ans = 1
for i in range(1,N):
if (maxP < P[i]):
maxP = P[i]
else :
ans += 1
print(ans)
|
N = int(input())
P = list(map(int,input().split()))
minP = P[0]
ans = 1
for i in range(1,N):
if (minP > P[i]):
minP = P[i]
ans += 1
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 597,911
| 597,912
|
u202634017
|
python
|
p02791
|
n = int(input())
p = list(input().split())
cnt = 0
cmp = p[0]
for i in range(n):
if p[i] <= cmp:
cnt += 1
cmp = p[i]
print(cnt)
|
n = int(input())
p = list(map(int, input().split()))
cnt = 0
cmp = p[0]
for i in range(n):
if p[i] <= cmp:
cnt += 1
cmp = p[i]
print(cnt)
|
[
"call.add",
"call.arguments.change"
] | 597,972
| 597,973
|
u878849567
|
python
|
p02791
|
N = input()
Pn = input().split()
result = 0
last = Pn[0] # 初期化
for i in Pn:
if int(last) >= int(i):
print(i)
result += 1
last = int(i)
print(result)
|
N = input()
Pn = input().split()
result = 0
last = Pn[0] # 初期化
for i in Pn:
if int(last) >= int(i):
result += 1
last = int(i)
print(result)
|
[
"call.remove"
] | 597,984
| 597,985
|
u991923581
|
python
|
p02791
|
N = input()
P = input().split(' ')
count = 0
print(P)
for i, Pi in enumerate(P):
if i == 0:
count = count +1
Pmin = int(Pi)
elif Pmin>=int(P[i]):
count = count +1
Pmin = int(Pi)
print(count)
|
N = input()
P = input().split(' ')
count = 0
for i, Pi in enumerate(P):
if i == 0:
count = count +1
Pmin = int(Pi)
elif Pmin>=int(P[i]):
count = count +1
Pmin = int(Pi)
print(count)
|
[
"call.remove"
] | 597,990
| 597,991
|
u232873434
|
python
|
p02791
|
total = input()
L = list(map(int, input().split()))
sum=0
Q=0
for i in range(int(total)):
if i == 0:
Q=L[i]
sum = sum + 1
else:
if Q>=L[i]:
sum = sum + 1
else:
Q=L[i]
print(sum)
|
total = input()
L = list(map(int, input().split()))
sum=0
Q=0
for i in range(int(total)):
if i == 0:
Q=L[i]
sum = sum + 1
else:
if Q>=L[i]:
sum = sum + 1
Q=L[i]
print(sum)
|
[] | 597,992
| 597,993
|
u071695942
|
python
|
p02791
|
n=int(input())
l1=list(map(int,input().split()))
cnt=0
max1=l1[0]
for i in range(len(l1)):
if l1[i]<=max1:
cnt=cnt+1
max1=max(max1,l1[i])
print(cnt)
|
n=int(input())
l1=list(map(int,input().split()))
cnt=0
max1=l1[0]
for i in range(len(l1)):
if l1[i]<=max1:
cnt=cnt+1
max1=min(max1,l1[i])
print(cnt)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 597,994
| 597,995
|
u903328637
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
memo = [0] * N
memo[0] = 1
minn = 0
for i in range(1, N):
if P[i] <= minn:
memo[i] = 1
else:
memo[i] = 0
minn = min(minn, P[i])
print(sum(memo))
|
N = int(input())
P = list(map(int, input().split()))
memo = [0] * N
memo[0] = 1
minn = P[0]
for i in range(1, N):
if P[i] <= minn:
memo[i] = 1
else:
memo[i] = 0
minn = min(minn, P[i])
print(sum(memo))
|
[] | 598,002
| 598,003
|
u517910772
|
python
|
p02791
|
n = int(input())
p = list(map(int, input().split()))
m = p[0]
count = 1
for i in range(1,n):
if m >= p[i]:
count += 1
m = min(m, p[i-1])
print(count)
|
n = int(input())
p = list(map(int, input().split()))
m = p[0]
count = 1
for i in range(1,n):
if m >= p[i]:
count += 1
m = min(m, p[i])
print(count)
|
[
"expression.operation.binary.remove"
] | 598,016
| 598,017
|
u278183305
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5)]
for i in range(N-1):
P_min.append(min(P_min[i],P[i]))
print(P_min)
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5)]
for i in range(N-1):
P_min.append(min(P_min[i],P[i]))
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
[
"call.remove"
] | 598,022
| 598,023
|
u267300160
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5),]
for i in range(N):
P_min.append(min(P_min[i-1],P[i]))
#print(P_min)
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5)]
for i in range(N-1):
P_min.append(min(P_min[i],P[i]))
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
[
"expression.operation.binary.remove"
] | 598,024
| 598,023
|
u267300160
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5),]
for i in range(N-1):
P_min.append(min(P_min[i-1],P[i]))
#print(P_min)
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5)]
for i in range(N-1):
P_min.append(min(P_min[i],P[i]))
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
[
"expression.operation.binary.remove"
] | 598,025
| 598,023
|
u267300160
|
python
|
p02791
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5),]
for i in range(N-1):
P_min.append(min(P_min[i-1],P[i]))
#print(P_min)
ans = 0
for i in range(N):
if P_min[i] > P[i]:
ans += 1
print(ans)
|
N = int(input())
P = list(map(int,input().split()))
P_min = [2*(10**5)]
for i in range(N-1):
P_min.append(min(P_min[i],P[i]))
ans = 0
for i in range(N):
if P_min[i] >= P[i]:
ans += 1
print(ans)
|
[
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,026
| 598,023
|
u267300160
|
python
|
p02792
|
def main():
N = int(input())
cnt = 0
'''
i => Aの末尾の桁が Bの先頭の桁
j => Bの末尾の桁が Aの先頭の桁
'''
cnt = [[0] * 10 for _ in range(10)]
for i in range(1,N):
tmp = str(i)
first = int(tmp[0])
last = int(tmp[-1])
cnt[first][last] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
if __name__ == "__main__":
main()
|
def main():
N = int(input())
cnt = 0
'''
i => Aの末尾の桁が Bの先頭の桁
j => Bの末尾の桁が Aの先頭の桁
'''
cnt = [[0] * 10 for _ in range(10)]
for i in range(N+1):
tmp = str(i)
first = int(tmp[0])
last = int(tmp[-1])
cnt[first][last] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
if __name__ == "__main__":
main()
|
[
"call.arguments.change"
] | 598,100
| 598,101
|
u761529120
|
python
|
p02792
|
n=int(input())
c=[[0]*10 for _ in range(10)]
ans=0
for i in range(1,n):
c[int(str(i)[0])][int(str(i)[-1])] +=1
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans)
|
n=int(input())
c=[[0]*10 for _ in range(10)]
ans=0
for i in range(1,n+1):
c[int(str(i)[0])][int(str(i)[-1])] +=1
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,102
| 598,103
|
u474202990
|
python
|
p02792
|
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = {}
for a in range(1, 10):
for b in range(1, 10):
cnt = 0
# 1桁の整数が条件を満たすケース
if a == b:
cnt += 1
# 2桁以上の整数で条件を満たすケース
i = 1
while True:
_min = a * (10**i) + b # 整数が a0000b
_max = a * (10**i) + b
_i = i - 1
while _i > 0:
_max += 9 * (10**_i) # 整数が a999b
_i -= 1
if _max <= n:
cnt += 10**(i - 1)
i += 1
continue
elif _min > n:
break
else: # a0..0b <= b < a9..9b
cnt += ((n - _min) // 10) + 1
break
d[10 * a + b] = cnt
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += d[a * 10 + b] * d[b * 10 + a]
print(ans)
return
if __name__ == "__main__":
main()
|
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = {}
# n以下のaで始まり、bで終わる整数のそれぞれ求める
# 計算量: O(log_n)
for a in range(1, 10):
for b in range(1, 10):
cnt = 0
# 1桁の整数が条件を満たすケース
if a == b and a <= n:
cnt += 1
# 2桁以上の整数で条件を満たすケース
i = 1
while True:
_min = a * (10**i) + b # 整数が a0000b
_max = a * (10**i) + b
_i = i - 1
while _i > 0:
_max += 9 * (10**_i) # 整数が a999b
_i -= 1
if _max <= n:
cnt += 10**(i - 1)
i += 1
continue
elif _min > n:
break
else: # a0..0b <= n < a9..9b
cnt += ((n - _min) // 10) + 1
break
d[10 * a + b] = cnt
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += d[a * 10 + b] * d[b * 10 + a]
print(ans)
return
if __name__ == "__main__":
main()
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 598,108
| 598,109
|
u397496203
|
python
|
p02792
|
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = {}
for a in range(1, 10):
for b in range(1, 10):
cnt = 0
# 1桁の整数が条件を満たすケース
if a == b:
cnt += 1
# 2桁以上の整数で条件を満たすケース
i = 1
while True:
_min = a * (10**i) + b # 整数が a0000b
_max = a * (10**i) + b
_i = i - 1
while _i > 0:
_max += 9 * (10**_i) # 整数が a999b
_i -= 1
if _max <= n:
cnt += 10**(i - 1)
i += 1
continue
elif _min > n:
break
else: # a0..0b <= b < a9..9b
cnt += ((n - _min) // 10) + 1
break
d[10 * a + b] = cnt
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += d[a * 10 + b] * d[b * 10 + a]
print(ans)
return
if __name__ == "__main__":
main()
|
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
d = {}
for a in range(1, 10):
for b in range(1, 10):
cnt = 0
# 1桁の整数が条件を満たすケース
if a == b and a <= n:
cnt += 1
# 2桁以上の整数で条件を満たすケース
i = 1
while True:
_min = a * (10**i) + b # 整数が a0000b
_max = a * (10**i) + b
_i = i - 1
while _i > 0:
_max += 9 * (10**_i) # 整数が a999b
_i -= 1
if _max <= n:
cnt += 10**(i - 1)
i += 1
continue
elif _min > n:
break
else: # a0..0b <= b < a9..9b
cnt += ((n - _min) // 10) + 1
break
d[10 * a + b] = cnt
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += d[a * 10 + b] * d[b * 10 + a]
print(ans)
return
if __name__ == "__main__":
main()
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 598,108
| 598,110
|
u397496203
|
python
|
p02792
|
N = int(input())
num = [[0] * 10 for _ in range(10)]
for i in range(1, N+1):
top = int(str(i)[0])
end = int(str(i)[-1])
num[top][end] += 1
ans = 0
for i in range(10):
for j in range(10):
count += num[i][j] * num[j][i]
print(count)
|
N = int(input())
num = [[0] * 10 for i in range(10)]
for i in range(1, N+1):
top = int(str(i)[0])
end = int(str(i)[-1])
num[top][end] += 1
count = 0
for i in range(10):
for j in range(10):
count += num[i][j] * num[j][i]
print(count)
|
[
"assignment.value.change",
"identifier.change",
"assignment.variable.change"
] | 598,122
| 598,123
|
u629709614
|
python
|
p02792
|
N=int(input())
d={}
for i in range(1,10):
for j in range(1,10):
d[i*10+j]=0
for i in range(1,min(10,N)):
d[i*10+i]=1
p,h,t,c=10,10,1,1
for i in range(11,N+1):
if t==10:
t=1
else:
d[h+t]+=1
t+=1
if p==c:
h+=10
c=0
if h==100:
h=10
p*=10
c+=1
ans=0
for i in range(1,9):
for j in range(i+1,10):
ans+=(d[i*10+j]*d[j*10+i])*2
for i in range(1,10):
ans+=d[i*10+i]**2
print(ans)
|
N=int(input())
d={}
for i in range(1,10):
for j in range(1,10):
d[i*10+j]=0
for i in range(1,min(10,N+1)):
d[i*10+i]=1
p,h,t,c=10,10,1,1
for i in range(11,N+1):
if t==10:
t=1
else:
d[h+t]+=1
t+=1
if p==c:
h+=10
c=0
if h==100:
h=10
p*=10
c+=1
ans=0
for i in range(1,9):
for j in range(i+1,10):
ans+=(d[i*10+j]*d[j*10+i])*2
for i in range(1,10):
ans+=d[i*10+i]**2
print(ans)
|
[
"expression.operation.binary.add"
] | 598,126
| 598,127
|
u054825571
|
python
|
p02792
|
N = int(input())
dp = [[0]*10 for _ in range(10)]
for a in range(N):
A = str(a)
dp[int(A[0])][int(A[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += dp[i][j]*dp[j][i]
print(ans)
|
N = int(input())
dp = [[0]*10 for _ in range(10)]
for a in range(N+1):
A = str(a)
dp[int(A[0])][int(A[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += dp[i][j]*dp[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,130
| 598,131
|
u800396927
|
python
|
p02792
|
import sys
import math
# a != b のとき
def count(a, b, N):
keta = len(str(N))
cnt = 0
# k == 1 なら a == b
if a == b:
cnt += 1 if a < N else 0
if keta == 1:
return cnt
# k == 2 なら ba のみ
if keta == 2:
cnt += 1 if b * 10 + a <= N else 0
return cnt
# k 桁より少ない数の場合 : 好きな数を間に挟む
for k in range(2, keta):
cnt += 10**(k - 2)
# k 桁の数字の場合
s = N // (10**(keta - 1))
t = N % 10
if b > s:
return cnt
elif b < s:
cnt += 10**(keta - 2)
else:
tempN = (N - s * (10**(keta - 1)) - t) // 10
# print(f"tempN {tempN}")
cnt += (tempN + 1) # tempN が 1 なら 0,1 を選べる
if a > t:
cnt -= 1
return cnt
def count_aa(a, N):
keta = len(str(N))
cnt = 0
# keta == 1
if keta == 1:
return 1 if a <= N[-1] else 0
cnt += 1 # a
# k == 2 なら aa のみ
if keta == 2:
return cnt + 1 if a <= N[-1] else 0
# 3桁以上
# k 桁より少ない数の場合
for k in range(2, keta):
cnt += 10**(k - 2)
# k 桁の数字の場合
s = N // (10**(keta - 1))
t = N % 10
if b > s:
return cnt
elif b < s:
cnt += 10**(keta - 2)
else:
tempN = (N - s * (10**(keta - 1)) - t) // 10
# print(f"tempN {tempN}")
cnt += (tempN + 1) # tempN が 1 なら 0,1 を選べる
if a > t:
cnt -= 1
return cnt
N = int(input())
c = 0
for i in range(1,N+1):
a = int(str(i)[0])
b = i % 10
# print(a,b)
if b == 0:
continue
c += count(a,b,N)
print(c)
|
import sys
import math
# a != b のとき
def count(a, b, N):
keta = len(str(N))
cnt = 0
# k == 1 なら a == b
if a == b:
cnt += 1 if a <= N else 0
if keta == 1:
return cnt
# k == 2 なら ba のみ
if keta == 2:
cnt += 1 if b * 10 + a <= N else 0
return cnt
# k 桁より少ない数の場合 : 好きな数を間に挟む
for k in range(2, keta):
cnt += 10**(k - 2)
# k 桁の数字の場合
s = N // (10**(keta - 1))
t = N % 10
if b > s:
return cnt
elif b < s:
cnt += 10**(keta - 2)
else:
tempN = (N - s * (10**(keta - 1)) - t) // 10
# print(f"tempN {tempN}")
cnt += (tempN + 1) # tempN が 1 なら 0,1 を選べる
if a > t:
cnt -= 1
return cnt
def count_aa(a, N):
keta = len(str(N))
cnt = 0
# keta == 1
if keta == 1:
return 1 if a <= N[-1] else 0
cnt += 1 # a
# k == 2 なら aa のみ
if keta == 2:
return cnt + 1 if a <= N[-1] else 0
# 3桁以上
# k 桁より少ない数の場合
for k in range(2, keta):
cnt += 10**(k - 2)
# k 桁の数字の場合
s = N // (10**(keta - 1))
t = N % 10
if b > s:
return cnt
elif b < s:
cnt += 10**(keta - 2)
else:
tempN = (N - s * (10**(keta - 1)) - t) // 10
# print(f"tempN {tempN}")
cnt += (tempN + 1) # tempN が 1 なら 0,1 を選べる
if a > t:
cnt -= 1
return cnt
N = int(input())
c = 0
for i in range(1,N+1):
a = int(str(i)[0])
b = i % 10
# print(a,b)
if b == 0:
continue
c += count(a,b,N)
print(c)
|
[
"expression.operator.compare.change"
] | 598,132
| 598,133
|
u726285999
|
python
|
p02792
|
def main():
import sys
from collections import defaultdict
def input(): return sys.stdin.readline().rstrip()
n = int(input())
nd = defaultdict(int)
for i in range(1, n):
tmp = str(i)
h, t = int(tmp[0]), int(tmp[-1])
nd[(h, t)] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += nd[(i, j)]*nd[(j, i)]
print(ans)
if __name__ == '__main__':
main()
|
def main():
import sys
from collections import defaultdict
def input(): return sys.stdin.readline().rstrip()
n = int(input())
nd = defaultdict(int)
for i in range(1, n+1):
tmp = str(i)
h, t = int(tmp[0]), int(tmp[-1])
nd[(h, t)] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += nd[(i, j)]*nd[(j, i)]
print(ans)
if __name__ == '__main__':
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,145
| 598,146
|
u266014018
|
python
|
p02792
|
n = int(input())
cnt = [[0] * 10 for i in range(10)]
for i in range(n):
a = int(str(i)[0])
b = int(str(i)[-1])
if a == 0 or b == 0:
continue
cnt[a][b] += 1
ans = 0
for i in range(n):
a = int(str(i)[0])
b = int(str(i)[-1])
ans += cnt[b][a]
print(ans)
|
n = int(input())
cnt = [[0] * 10 for i in range(10)]
for i in range(n+1):
a = int(str(i)[0])
b = int(str(i)[-1])
if a == 0 or b == 0:
continue
cnt[a][b] += 1
ans = 0
for i in range(n+1):
a = int(str(i)[0])
b = int(str(i)[-1])
ans += cnt[b][a]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,151
| 598,152
|
u612975321
|
python
|
p02792
|
from collections import defaultdict
strN=input()
lenN=len(strN)
N=int(strN)
if N<=9:print(N)
else:
count = defaultdict(int)
for i in range(10,N+1):
a,b=int(str(i)[0]),int(str(i)[1])
if b==0:continue
count[(a,b)] += 1
ans=0
for i in range(1,10):
count[(i,i)] += 1
count = dict(count)
for key in count.keys():
if key[0]<key[1] and count.get((key[1],key[0])):
ans += count[key] * count[(key[1],key[0])] * 2
if key[0]==key[1]:
ans += count[key]**2
print(ans)
|
from collections import defaultdict
strN=input()
lenN=len(strN)
N=int(strN)
if N<=9:print(N)
else:
count = defaultdict(int)
for i in range(10,N+1):
a,b=int(str(i)[0]),int(str(i)[-1])
if b==0:continue
count[(a,b)] += 1
ans=0
for i in range(1,10):
count[(i,i)] += 1
count = dict(count)
for key in count.keys():
if key[0]<key[1] and count.get((key[1],key[0])):
ans += count[key] * count[(key[1],key[0])] * 2
if key[0]==key[1]:
ans += count[key]**2
print(ans)
|
[
"expression.operation.unary.add",
"call.arguments.change"
] | 598,156
| 598,157
|
u401686269
|
python
|
p02792
|
N = int(input())
g = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
a = int(str(i)[0])
b = int(str(i)[-1])
g[a][b] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += g[i][j]*g[j][i]
print(ans)
|
N = int(input())
g = [[0] * (10) for _ in range(10)]
for i in range(1, N + 1):
a = int(str(i)[0])
b = int(str(i)[-1])
g[a][b] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += g[i][j]*g[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 598,165
| 598,166
|
u484229314
|
python
|
p02792
|
n = int(input())
cou = 0
for i in range(1,n+1):
i = str(i)
if i[0]!="0" and i[-1]!="0":
if int(i[0])>int(i[-1]):
cou += (9**(len(i)-1)-1)//8
elif int(i[0])<int(i[-1]):
cou += (9**(len(i)-2)-1)//8
#print(i,cou)
cou *= 2
l = [0 for i in range(9)]
for i in range(1,n+1):
i = str(i)
if i[0]==i[-1]:
l[int(i[0])-1] += 1
l1 = [i*i for i in l]
print(sum(l1)+cou)
|
n = int(input())
cou = 0
for i in range(1,n+1):
i = str(i)
if i[0]!="0" and i[-1]!="0":
if int(i[0])>int(i[-1]):
cou += (10**(len(i)-1)-1)//9
elif int(i[0])<int(i[-1]):
cou += (10**(len(i)-2)-1)//9
#print(i,cou)
cou *= 2
l = [0 for i in range(9)]
for i in range(1,n+1):
i = str(i)
if i[0]==i[-1]:
l[int(i[0])-1] += 1
l1 = [i*i for i in l]
print(sum(l1)+cou)
|
[
"literal.number.integer.change",
"expression.operation.binary.change"
] | 598,174
| 598,175
|
u288430479
|
python
|
p02792
|
import numpy as np
n = int(input())
table,ans = np.zeros((9,9)),0
for k in range(n):
num = str(k)
if int(num[0])!=0 and int(num[-1])!=0:
table[int(num[0])-1][int(num[-1])-1]+=1
for i in range(9):
for j in range(9):
ans += table[i][j]*table[j][i]
print(int(ans))
|
import numpy as np
n = int(input())
table,ans = np.zeros((9,9)),0
for k in range(n):
num = str(k+1)
if int(num[0])!=0 and int(num[-1])!=0:
table[int(num[0])-1][int(num[-1])-1]+=1
for i in range(9):
for j in range(9):
ans += table[i][j]*table[j][i]
print(int(ans))
|
[
"assignment.change"
] | 598,178
| 598,179
|
u131881594
|
python
|
p02792
|
import math
import numpy as np
N = int(input())
tb = [[0]*10]*10
tb = np.array(tb)
for i in range(1,N+1):
s = str(i)
tb[int(s[0])][int(s[-1])] =tb[int(s[0])][int(s[-1])] +1
point =0
for i in range(0,10):
for j in range(0,10):
point += tb[i][j] * tb[j][i]
|
import math
import numpy as np
N = int(input())
tb = [[0]*10]*10
tb = np.array(tb)
for i in range(1,N+1):
s = str(i)
tb[int(s[0])][int(s[-1])] =tb[int(s[0])][int(s[-1])] +1
point =0
for i in range(0,10):
for j in range(0,10):
point += tb[i][j] * tb[j][i]
print(point)
|
[
"call.add"
] | 598,180
| 598,181
|
u408071652
|
python
|
p02792
|
N=int(input())
A=[[0 for n in range(9)] for n in range(9)]
for n in range(N):
head=int(str(n)[0])
tail=n%10
if head!=0 and tail!=0:
A[head-1][tail-1]+=1
count=0
for i in range(9):
for j in range(9):
count+=A[i][j]*A[j][i]
print(count)
|
N=int(input())
A=[[0 for n in range(9)] for n in range(9)]
for n in range(N+1):
head=int(str(n)[0])
tail=n%10
if head!=0 and tail!=0:
A[head-1][tail-1]+=1
count=0
for i in range(9):
for j in range(9):
count+=A[i][j]*A[j][i]
print(count)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,186
| 598,187
|
u613920660
|
python
|
p02792
|
n = int(input())
c = [[0 for i in range(10)] for i in range(10)]
ans = 0
for i in range(n):
s = str(i)
c[int(s[0])][int(s[-1])] += 1
for i in range(1,10):
for j in range(1,10):
ans += c[i][j]*c[j][i]
print(ans)
|
n = int(input())
c = [[0 for i in range(10)] for i in range(10)]
ans = 0
for i in range(1,n+1):
s = str(i)
c[int(s[0])][int(s[-1])] += 1
for i in range(1,10):
for j in range(1,10):
ans += c[i][j]*c[j][i]
print(ans)
|
[
"call.arguments.add"
] | 598,190
| 598,191
|
u169350228
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.