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 |
|---|---|---|---|---|---|---|---|
p02792
|
# 掛け算で求める，までは正しかった
# 式がよく分からない
# https://scrapbox.io/pocala-kyopro/D_-_Handstand_2 この考え方もやった
n = int(input())
if n <= 9:
print(n)
exit()
# cij = #{1 <= k <= N | kの先頭の桁の数はi，末尾の桁の数はjに等しい}
# ans = \sum_{i=0}^9 \sum_{j=0}^9 cij * cji
cij = [[0 for _ in range(10)] for _ in range(10)]
for k in range(1, n):
k0 = int(str(k)[0])
kn = int(str(k)[-1])
if k0 != 0 and kn != 0:
cij[k0][kn] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += cij[i][j] * cij[j][i]
print(ans)
|
# 掛け算で求める，までは正しかった
# 式がよく分からない
# https://scrapbox.io/pocala-kyopro/D_-_Handstand_2 この考え方もやった
n = int(input())
if n <= 9:
print(n)
exit()
# cij = #{1 <= k <= N | kの先頭の桁の数はi，末尾の桁の数はjに等しい}
# ans = \sum_{i=0}^9 \sum_{j=0}^9 cij * cji
cij = [[0 for _ in range(10)] for _ in range(10)]
for k in range(1, n + 1):
k0 = int(str(k)[0])
kn = int(str(k)[-1])
if k0 != 0 and kn != 0:
cij[k0][kn] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += cij[i][j] * cij[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,197
| 598,198
|
u047102107
|
python
|
p02792
|
N = int(input())
A = [[0]*10 for i in range(10)]
for i in range(1, N+1):
A[int(str(i)[0])][int(str(i)[-1])] += 1
print(A)
ans = 0
for i in range(10):
for j in range(10):
ans += A[i][j] * A[j][i]
print(ans)
|
N = int(input())
A = [[0]*10 for i in range(10)]
for i in range(1, N+1):
A[int(str(i)[0])][int(str(i)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += A[i][j] * A[j][i]
print(ans)
|
[
"call.remove"
] | 598,199
| 598,200
|
u686036872
|
python
|
p02792
|
N = int(input())
A = [[0]*10 for i in range(10)]
for i in range(1, N+1):
A[int(str(i)[0])][int(str(i)[-1])] = 1
ans = 0
for i in range(10):
for j in range(10):
ans += A[i][j] * A[j][i]
print(ans)
|
N = int(input())
A = [[0]*10 for i in range(10)]
for i in range(1, N+1):
A[int(str(i)[0])][int(str(i)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += A[i][j] * A[j][i]
print(ans)
|
[
"assignment.value.change"
] | 598,201
| 598,200
|
u686036872
|
python
|
p02792
|
n = int(input())
X = ['']
for i in range(1, 6):
for j in range(10**i):
X.append(str(j).zfill(i))
cnt = 0
for a in range(1, n+1):
x = str(a)[0]
y = str(a)[-1]
if x == y:
cnt += 1
if y == '0':
continue
l, r = 0, len(X)
while r-l > 1:
c = (l+r)//2
if int(y+X[c]+x) <= n:
l = c
else:
r = c
cnt += r
print(cnt)
|
n = int(input())
X = ['']
for i in range(1, 6):
for j in range(10**i):
X.append(str(j).zfill(i))
cnt = 0
for a in range(1, n+1):
x = str(a)[0]
y = str(a)[-1]
if x == y:
cnt += 1
if y == '0':
continue
l, r = -1, len(X)-1
while r-l > 1:
c = (l+r)//2
if int(y+X[c]+x) <= n:
l = c
else:
r = c
cnt += r
print(cnt)
|
[
"assignment.value.change",
"expression.operation.unary.add"
] | 598,202
| 598,203
|
u997641430
|
python
|
p02792
|
N=int(input())
A=[[0]*9 for i in range(9)]
sum=0
for i in range(N):
s=str(i)
if(int(s[0])!=0 and int(s[-1])!=0):
A[int(s[0])-1][int(s[-1])-1]+=1
for i in range(9):
for j in range(9):
sum+=A[i][j]*A[j][i]
#print(A[i][i])
#print(A)
print(sum)
|
N=int(input())
A=[[0]*9 for i in range(9)]
sum=0
for i in range(1,N+1):
s=str(i)
if(int(s[0])!=0 and int(s[-1])!=0):
A[int(s[0])-1][int(s[-1])-1]+=1
for i in range(9):
for j in range(9):
sum+=A[i][j]*A[j][i]
#print(A[i][i])
#print(A)
print(sum)
|
[
"call.arguments.add"
] | 598,206
| 598,207
|
u471539833
|
python
|
p02792
|
n=int(input())
res=0
M=[[0 for _ in range(10)] for _ in range(10)]
for i in range(n):
a=i%10
b=int(str(i)[0])
M[a][b]+=1
for i in range(1,10):
for j in range(1,10):
res+=M[i][j]*M[j][i]
print(res)
|
n=int(input())
res=0
M=[[0 for _ in range(10)] for _ in range(10)]
for i in range(n+1):
a=i%10
b=int(str(i)[0])
M[a][b]+=1
for i in range(1,10):
for j in range(1,10):
res+=M[i][j]*M[j][i]
print(res)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,208
| 598,209
|
u064434060
|
python
|
p02792
|
N = int(input())
ans_lis = [[0] * 9 for i in range(9)]
for i in range(1,N+1):
t = str(i)
mae = int(t[0])
ushiro = int(t[-1])
if usiro == 0:
continue
ans_lis[mae-1][ushiro-1] += 1
ans = 0
for i in range(9):
for j in range(9):
ans += ans_lis[i][j] * ans_lis[j][i]
print(ans)
|
N = int(input())
ans_lis = [[0] * 9 for i in range(9)]
for i in range(1,N+1):
t = str(i)
mae = int(t[0])
ushiro = int(t[-1])
if ushiro == 0:
continue
ans_lis[mae-1][ushiro-1] += 1
ans = 0
for i in range(9):
for j in range(9):
ans += ans_lis[i][j] * ans_lis[j][i]
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 598,210
| 598,211
|
u944643608
|
python
|
p02792
|
N=int(input())
ans=0
c=[[0 for _ in range(10)] for _ in range(10)]
for n in range(1,N+1):
i=n%10
j=n
while 10<=k:
j=j//10
c[i][j]=c[i][j]+1
for i in range(10):
for j in range(10):
ans=ans+c[i][j]*c[j][i]
print(ans)
|
N=int(input())
ans=0
c=[[0 for _ in range(10)] for _ in range(10)]
for n in range(1,N+1):
i=n%10
j=n
while 10<=j:
j=j//10
c[i][j]=c[i][j]+1
for i in range(10):
for j in range(10):
ans=ans+c[i][j]*c[j][i]
print(ans)
|
[
"identifier.change",
"control_flow.loop.condition.change"
] | 598,226
| 598,227
|
u265506056
|
python
|
p02792
|
N = int(input()) + 1
ans_list = [[0 for i in range(10)] for j in range(10)]
for i in range(N):
s = str(i)
ans_list[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(0,10):
for j in range(0,10):
ans += ans_list[i][j]*ans_list[j][i]
print(ans)
|
N = int(input()) + 1
ans_list = [[0 for i in range(10)] for j in range(10)]
for i in range(1,N):
s = str(i)
ans_list[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(0,10):
for j in range(0,10):
ans += ans_list[i][j]*ans_list[j][i]
print(ans)
|
[
"call.arguments.add"
] | 598,232
| 598,233
|
u197922478
|
python
|
p02792
|
N = int(input())
ans_list = [[0 for i in range(10)] for i in range(10)]
for i in range(N):
s = str(i)
ans_list[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(0,10):
for j in range(0,10):
ans += ans_list[i][j]*ans_list[j][i]
print(ans)
|
N = int(input()) + 1
ans_list = [[0 for i in range(10)] for j in range(10)]
for i in range(1,N):
s = str(i)
ans_list[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(0,10):
for j in range(0,10):
ans += ans_list[i][j]*ans_list[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.add"
] | 598,234
| 598,233
|
u197922478
|
python
|
p02792
|
N = int(input())
c = [[0 for i in range(10)] for j in range(10)]
for i in range(N):
str_i = str(i)
c[int(str_i[0])][int(str_i[-1])] += 1
ans = 0
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 j in range(10)]
for i in range(N+1):
str_i = str(i)
c[int(str_i[0])][int(str_i[-1])] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += c[i][j]*c[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,235
| 598,236
|
u539969758
|
python
|
p02792
|
N = int(input())
C = [[0]*10 for _ in range(10)]
for n in range(1, N+1):
s = str(n)
C[int[s[0]]][int[s[-1]]] += 1
ans = 0
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)]
for n in range(1, N+1):
s = str(n)
C[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += C[i][j]*C[j][i]
print(ans)
|
[
"variable_access.subscript.index.change"
] | 598,251
| 598,252
|
u375616706
|
python
|
p02792
|
n = int(input())
c = [[0 for i in range(0, 10)] for j in range(0, 10)]
for i in range(1, n):
str_i = str(i)
c[int(str_i[0])][int(str_i[len(str_i)-1])] += 1
ans = 0
for i in range(0, 10):
for j in range(0, 10):
ans += c[i][j] * c[j][i]
print(ans)
|
n = int(input())
c = [[0 for i in range(0, 10)] for j in range(0, 10)]
for i in range(n):
str_i = str(i+1)
c[int(str_i[0])][int(str_i[len(str_i)-1])] += 1
ans = 0
for i in range(0, 10):
for j in range(0, 10):
ans += c[i][j] * c[j][i]
print(ans)
|
[
"call.arguments.change"
] | 598,257
| 598,258
|
u436982376
|
python
|
p02792
|
n=int(input())
def pair(x):
a=x%10
b=int(str(x)[0])
return (a,b)
dic={}
for i in range(1,n):
p=pair(i)
if(dic.get(p)==None):dic[p]=1
else:dic[p]+=1
ans=0
for i in range(1,n):
a,b=pair(i)
p=(b,a)
if(not dic.get(p)==None):ans+=dic[p]
print(ans)
|
n=int(input())
def pair(x):
a=x%10
b=int(str(x)[0])
return (a,b)
dic={}
for i in range(1,n+1):
p=pair(i)
if(dic.get(p)==None):dic[p]=1
else:dic[p]+=1
ans=0
for i in range(1,n+1):
a,b=pair(i)
p=(b,a)
if(not dic.get(p)==None):ans+=dic[p]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,278
| 598,279
|
u614162316
|
python
|
p02792
|
n=int(input())
ans=0
def c(i,j):
ret=0
for k in range(1,n+1):
if str(k)[0]==str(i) and str(k)[-1]==str(j):
ret+=1
return ret
for i in range(1,10):
for j in range(i,10):
if i==j:
ans+=2*c(i,j)*c(j,i)
else:
ans+=c(i,j)*c(j,i)
print(ans)
|
n=int(input())
ans=0
def c(i,j):
ret=0
for k in range(1,n+1):
if str(k)[0]==str(i) and str(k)[-1]==str(j):
ret+=1
return ret
for i in range(1,10):
for j in range(i,10):
if i==j:
ans+=c(i,j)*c(j,i)
else:
ans+=2*c(i,j)*c(j,i)
print(ans)
|
[] | 598,286
| 598,287
|
u707124227
|
python
|
p02792
|
n=int(input())
t=[[0 for i in range(10)]for j in range(10)]
for i in range(1,n):
i=str(i)
t[int(i[0])][int(i[-1])]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=t[i][j]*t[j][i]
print(ans)
|
n=int(input())
t=[[0 for i in range(10)]for j in range(10)]
for i in range(1,n+1):
i=str(i)
t[int(i[0])][int(i[-1])]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=t[i][j]*t[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,290
| 598,291
|
u026788530
|
python
|
p02792
|
N = int(input())
A = [[0]*10 for _ in range(10)]
for i in range(N):
a = i%10 #1の位
b = i // (10**(len(str(i))-1))
if a!= 0:
A[a][b] += 1
t = 0
for i in range(1,10):
s = A[i][i]
if s != 0:
t += int(s + (s*(s-1)))
for i in range(1,9):
for j in range(i+1,10):
t += A[i][j] * A[j][i]*2
print(t)
|
N = int(input())
A = [[0]*10 for _ in range(10)]
for i in range(1,N+1):
a = i%10 #1の位
b = i // (10**(len(str(i))-1))
if a!= 0:
A[a][b] += 1
t = 0
for i in range(1,10):
s = A[i][i]
if s != 0:
t += int(s + (s*(s-1)))
for i in range(1,9):
for j in range(i+1,10):
t += A[i][j] * A[j][i]*2
print(t)
|
[
"call.arguments.add"
] | 598,292
| 598,293
|
u418420470
|
python
|
p02792
|
N=int(input())
M=[[0]*10 for _ in range(10)]
for i in range(1,N+1):
S=str(i)
M[int(S[0])][int(S[-1])]+=1
for i in range(10):
for j in range(10):
ans+=M[i][j]*M[j][i]
print(ans)
|
N=int(input())
M=[[0]*10 for _ in range(10)]
for i in range(1,N+1):
S=str(i)
M[int(S[0])][int(S[-1])]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=M[i][j]*M[j][i]
print(ans)
|
[
"assignment.add"
] | 598,301
| 598,302
|
u784022244
|
python
|
p02792
|
N=int(input())
M=[[0]*10 for _ in range(10)]
for i in range(1,N+1):
S=str(i)
f=int(S[0])
b=int(S[-1])
M[f][s]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=M[i][j]*M[j][i]
print(ans)
|
N=int(input())
M=[[0]*10 for _ in range(10)]
for i in range(1,N+1):
S=str(i)
f=int(S[0])
b=int(S[-1])
M[f][b]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=M[i][j]*M[j][i]
print(ans)
|
[
"identifier.change",
"variable_access.subscript.index.change"
] | 598,303
| 598,304
|
u784022244
|
python
|
p02792
|
N=int(input())
M=[[0]*10 for _ in range(10)]
for i in range(1,N+1):
S=str(N)
f=int(S[0])
b=int(S[-1])
M[f][s]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=M[i][j]*M[j][i]
print(ans)
|
N=int(input())
M=[[0]*10 for _ in range(10)]
for i in range(1,N+1):
S=str(i)
f=int(S[0])
b=int(S[-1])
M[f][b]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=M[i][j]*M[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"variable_access.subscript.index.change"
] | 598,305
| 598,304
|
u784022244
|
python
|
p02792
|
N = int(input())
N_s = int(str(N)[0])
N_e = int(str(N)[-1])
if len(str(N)) > 2:
N_mid = int(str(N)[1:-1])
else:
N_mid = 0
def search(s, e):
ans = 0
for i in range(1, len(str(N))+1):
if i == 1:
if s == e and s <= N:
ans += 1
continue
else:
if i != len(str(N)):
ans += 10**(i-2)
else:
if N_s > s:
ans += 10**(i-2)
elif N_s == s:
if N_e > e:
ans += N_mid + 1
else:
ans += N_mid
return ans
ret = 0
for i in range(1, 10):
for j in range(1, 10):
ret += search(i, j) * search(j, i)
print(ret)
|
N = int(input())
N_s = int(str(N)[0])
N_e = int(str(N)[-1])
if len(str(N)) > 2:
N_mid = int(str(N)[1:-1])
else:
N_mid = 0
def search(s, e):
ans = 0
for i in range(1, len(str(N))+1):
if i == 1:
if s == e and s <= N:
ans += 1
continue
else:
if i != len(str(N)):
ans += 10**(i-2)
else:
if N_s > s:
ans += 10**(i-2)
elif N_s == s:
if N_e >= e:
ans += N_mid + 1
else:
ans += N_mid
return ans
ret = 0
for i in range(1, 10):
for j in range(1, 10):
ret += search(i, j) * search(j, i)
print(ret)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,322
| 598,323
|
u855710796
|
python
|
p02791
|
a = int(input())
b = list(map(int,input().split()))
N = a+1
ans = 0
for i in range(a):
c = b[i]
if c>=N:
ans += 1
N = c
print(ans)
|
a = int(input())
b = list(map(int,input().split()))
N = a+1
ans = 0
for i in range(a):
c = b[i]
if c<N:
ans += 1
N = c
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,334
| 598,335
|
u772062359
|
python
|
p02791
|
a = int(input())
b = list(map(int,input().split()))
N = a+1
ans = 0
for i in range(a):
c = b[i]
if c>N:
ans += 1
N = c
|
a = int(input())
b = list(map(int,input().split()))
N = a+1
ans = 0
for i in range(a):
c = b[i]
if c<N:
ans += 1
N = c
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 598,336
| 598,335
|
u772062359
|
python
|
p02791
|
n = int(input())
p = [int(i) for i in input().split()]
t = p[0]
ans = 0
for i in range(n):
if t >= p[i]:
ans += 1
else:
t = p[i]
print(ans)
|
n = int(input())
p = [int(i) for i in input().split()]
t = p[0]
ans = 0
for i in range(n):
if t >= p[i]:
ans += 1
t = p[i]
print(ans)
|
[] | 598,355
| 598,356
|
u677121387
|
python
|
p02791
|
import math as mt
n=int(input())
a=list(map(int,input().split()))
ans=1001001
res=0
for i in range(n):
if ans>a[i]:
res+=1
ans=min(ans,res)
print(res)
|
import math as mt
n=int(input())
a=list(map(int,input().split()))
ans=1001001
res=0
for i in range(n):
if ans>a[i]:
res+=1
ans=min(ans,a[i])
print(res)
|
[
"assignment.value.change",
"call.arguments.change"
] | 598,361
| 598,362
|
u309753263
|
python
|
p02791
|
N=int(input())
P = list(map(int,input().split()))
ans=0
m=10*10
for i in range(N):
if min(m,p[i])==P[i]:
ans+=1
m=P[i]
print(ans)
|
N=int(input())
P = list(map(int,input().split()))
ans=0
m=10**10
for i in range(N):
if min(m,P[i])==P[i]:
ans+=1
m=P[i]
print(ans)
|
[
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 598,365
| 598,364
|
u635070303
|
python
|
p02791
|
n=int(input())
l=list(map(int,input().split()))
ans=0
tmp=0
for i in range(1,n):
if tmp>=l[i]:
tmp=l[i]
ans+=1
print(ans)
|
n=int(input())
l=list(map(int,input().split()))
ans=0
tmp=l[0]
for i in range(n):
if tmp>=l[i]:
tmp=l[i]
ans+=1
print(ans)
|
[
"call.arguments.change"
] | 598,371
| 598,372
|
u703214333
|
python
|
p02791
|
n=int(input())
l=list(map(int,input().split()))
ans=0
tmp=0
for i in range(1,n):
if tmp<=l[i]:
tmp=l[i]
ans+=1
print(ans)
|
n=int(input())
l=list(map(int,input().split()))
ans=0
tmp=l[0]
for i in range(n):
if tmp>=l[i]:
tmp=l[i]
ans+=1
print(ans)
|
[
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,373
| 598,372
|
u703214333
|
python
|
p02791
|
N = int(input())
# P = np.array(input().split(' '), dtype = int)
P = list(map(int, input().split(' ')))
p_min = P[0]
ans = 0
for p in P:
if p <= p_min:
ans += 1
print(ans)
|
N = int(input())
# P = np.array(input().split(' '), dtype = int)
P = list(map(int, input().split(' ')))
p_min = P[0]
ans = 0
for p in P:
if p <= p_min:
p_min = p
ans += 1
print(ans)
|
[
"assignment.add"
] | 598,374
| 598,375
|
u894521144
|
python
|
p02791
|
N = int(input())
P = input().split()
P = [int(p) for p in P]
ans = N
min_p = P[0]
for p in P[1:N]:
if min_p > p:
min_P = p
else:
ans -=1
print(ans)
|
N = int(input())
P = input().split()
P = [int(p) for p in P]
ans = N
min_p = P[0]
for p in P[1:N]:
if min_p > p:
min_p = p
else:
ans -=1
print(ans)
|
[
"assignment.variable.change",
"identifier.change"
] | 598,376
| 598,377
|
u971096161
|
python
|
p02791
|
N = int(input)
P = [int(x) for x in input().split()]
pmin = max(P)
cnt = 0
for p in P:
if p <= pmin:
cnt += 1
pmin = p
print(cnt)
|
N = int(input())
P = [int(x) for x in input().split()]
pmin = max(P)
cnt = 0
for p in P:
if p <= pmin:
cnt += 1
pmin = p
print(cnt)
|
[
"call.add"
] | 598,382
| 598,383
|
u415905784
|
python
|
p02791
|
N = int(input())
lst = list(map(int,input().split()))
cnt = 1
m = lst[0]
for i in lst:
if i <= m:
cnt +=1
m = i
print(cnt)
|
N = int(input())
lst = list(map(int,input().split()))
cnt = 0
m = lst[0]
for i in lst:
if i <= m:
cnt +=1
m = i
print(cnt)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 598,384
| 598,385
|
u796708718
|
python
|
p02791
|
n = int(input())
li = list(map(int,input().split()))
i = 0
j = 0
a = 10**6
for i in range(i,n-1):
a = min(a,li[i])
if a == li[i]:
j = j + 1
print(j)
|
n = int(input())
li = list(map(int,input().split()))
i = 0
j = 0
a = 10**6
for i in range(i,n):
a = min(a,li[i])
if a == li[i]:
j = j + 1
print(j)
|
[
"expression.operation.binary.remove"
] | 598,392
| 598,393
|
u950129527
|
python
|
p02791
|
n = int(input())
li = list(map(int,input().split()))
i = 0
j = 0
a = 10**5
for i in range(i,n-1):
a = min(a,li[i])
if a == li[i]:
j = j + 1
print(j)
|
n = int(input())
li = list(map(int,input().split()))
i = 0
j = 0
a = 10**6
for i in range(i,n):
a = min(a,li[i])
if a == li[i]:
j = j + 1
print(j)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 598,394
| 598,393
|
u950129527
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
min_p = P[0]
cnt = 0
for p in P:
if p < min_p:
min_p = p
cnt += 1
print(cnt)
|
N = int(input())
P = list(map(int, input().split()))
min_p = P[0]
cnt = 0
for p in P:
if p <= min_p:
min_p = p
cnt += 1
print(cnt)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,395
| 598,396
|
u040016087
|
python
|
p02791
|
n=int(input())
p=list(map(int,input().split()))
ans=p[0]
cnt=1
for i in range(1,n):
if p[i]<a:
cnt+=1
a=p[i]
print(cnt)
|
n=int(input())
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in range(1,n):
if p[i]<a:
cnt+=1
a=p[i]
print(cnt)
|
[
"assignment.variable.change",
"identifier.change"
] | 598,397
| 598,398
|
u027675217
|
python
|
p02791
|
n=int(input())
p=list(map(int,input().split()))
a=1000000000
cnt=1
for i in range(1,n):
if p[i]<=a:
cnt+=1
a=p[i]
print(cnt)
|
n=int(input())
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in range(1,n):
if p[i]<a:
cnt+=1
a=p[i]
print(cnt)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,399
| 598,398
|
u027675217
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
a = P[0]
cnt = 1
for i in P:
if a > P:
a = P
count += 1
print(count)
|
N = int(input())
P = list(map(int, input().split()))
a = P[0]
cnt = 1
for i in P:
if a > i:
a = i
cnt += 1
print(cnt)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 598,400
| 598,401
|
u982471399
|
python
|
p02791
|
def main():
import sys
N = int(input())
input_2 = sys.stdin.readline
P_list = list(map(int,input_2().split()))
print(P_list)
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num)
if __name__ == "__main__":
main()
|
def main():
import sys
N = int(input())
input_2 = sys.stdin.readline
P_list = list(map(int,input_2().split()))
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num)
if __name__ == "__main__":
main()
|
[
"call.remove"
] | 598,402
| 598,403
|
u891504219
|
python
|
p02791
|
def main():
N = int(input())
P_list = list(map(int,input().split()))
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num)
if __name__ == __main__:
main()
|
def main():
N = int(input())
P_list = list(map(int,input().split()))
i_num = 0
min_P = P_list[0]
for p in P_list:
if p <= min_P:
min_P = p
i_num += 1
print(i_num)
if __name__ == "__main__":
main()
|
[
"control_flow.branch.if.condition.change"
] | 598,404
| 598,405
|
u891504219
|
python
|
p02791
|
import bisect
import numpy as np
def main():
N = int(input())
P = list(map(int, input().split()))
ans = 1
f = P[0]
for i in range(1, N):
f_o = P[i]
if f >= f_o:
ans+=1
f = f_o
return 0
if __name__ == '__main__':
main()
|
import bisect
import numpy as np
def main():
N = int(input())
P = list(map(int, input().split()))
ans = 1
f = P[0]
for i in range(1, N):
f_o = P[i]
if f >= f_o:
ans+=1
f = f_o
print(ans)
return 0
if __name__ == '__main__':
main()
|
[
"call.add"
] | 598,413
| 598,414
|
u981332890
|
python
|
p02791
|
N = int(input())
P = list(map(int, input().split()))
ans = 0
min = P[0]
for i in P:
if min > i:
min = i
elif i > min:
ans += 1
print(ans)
|
N = int(input())
P = list(map(int, input().split()))
ans = 0
min = P[0]
for i in P:
if min >= i:
min = i
ans += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 598,420
| 598,421
|
u140480594
|
python
|
p02791
|
N = int(input())
i = list(map(int, input().split()))
min = i[0]
count = 1
for n in range(N-1):
if min >= i[n]:
min = i[n]
count +=1
else: pass
print(count)
|
N = int(input())
i = list(map(int, input().split()))
min = i[0]
count = 1
for n in range(N-1):
if min >= i[n+1]:
min = i[n+1]
count +=1
else: pass
print(count)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 598,443
| 598,444
|
u010870870
|
python
|
p02791
|
N = int(input())
i = list(map(int, input().split()))
min = i[0]
count = 1
for n in range(N-1):
if min > i[n]:
min = i[n]
count +=1
else: pass
print(count)
|
N = int(input())
i = list(map(int, input().split()))
min = i[0]
count = 1
for n in range(N-1):
if min >= i[n+1]:
min = i[n+1]
count +=1
else: pass
print(count)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 598,445
| 598,444
|
u010870870
|
python
|
p02791
|
n=int(input())
l=[int(i) for i in input().split()]
l1=[]
c=0
l1.append(l[0])
for i in range(1,n):
l1.append(min(l[i-1],l[i]))
for i in range(n):
if(l[i]==l1[i]):
c+=1
print(c)
|
n=int(input())
l=[int(i) for i in input().split()]
l1=[]
c=0
l1.append(l[0])
for i in range(1,n):
l1.append(min(l1[i-1],l[i]))
for i in range(n):
if(l[i]==l1[i]):
c+=1
print(c)
|
[
"identifier.change",
"call.arguments.change"
] | 598,448
| 598,449
|
u901144784
|
python
|
p02792
|
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
#mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
n=int(input())
ans1=0
ans2=0
for i in range(n):
a=int(str(i)[0])
b=i%10
if b==0:
continue
k=len(str(i))
if k==1:
ans2+=1
elif a>b:
ans1+=(10**(k-1)-1)//9
elif a<b:
ans1+=(10**(k-2)-1)//9
else:
ans1+=(10**(k-2)-1)//9+1+(int(str(i)[1:])-a)//10
ans2+=1
print(ans1*2+ans2)
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
#mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
n=int(input())
ans1=0
ans2=0
for i in range(1,n+1):
a=int(str(i)[0])
b=i%10
if b==0:
continue
k=len(str(i))
if k==1:
ans2+=1
elif a>b:
ans1+=(10**(k-1)-1)//9
elif a<b:
ans1+=(10**(k-2)-1)//9
else:
ans1+=(10**(k-2)-1)//9+1+(int(str(i)[1:])-a)//10
ans2+=1
print(ans1*2+ans2)
if __name__ == "__main__":
main()
|
[
"call.arguments.add"
] | 598,458
| 598,459
|
u477977638
|
python
|
p02792
|
n = int(input())
d = [[0]*10 for i in range(10)]
for i in range(1, n+1):
i_ = str(i)
x = int(i_[0])
y = int(i_[-1])
d[x][y] += 1
print(d)
ans = 0
for i in range(10):
for j in range(10):
ans += d[i][j]*d[j][i]
print(ans)
|
n = int(input())
d = [[0]*10 for i in range(10)]
for i in range(1, n+1):
i_ = str(i)
x = int(i_[0])
y = int(i_[-1])
d[x][y] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += d[i][j]*d[j][i]
print(ans)
|
[
"call.remove"
] | 598,464
| 598,465
|
u186838327
|
python
|
p02792
|
# import bisect
# # import heapq
# # from copy import deepcopy
# # from collections import deque
# # from collections import Counter
# # from itertools import accumulate
# # from itertools import permutations
# import numpy as np
# # import math
# a,b,c = map(int, input().split())
# p = list(map(int, input().split()))
n = int(input())
count = 0
a = [[0] * 10 for i in range(10)]
# print(a)
# print(b)
for i in range(n):
head = int(str(i)[0])
tail = int(str(i)[-1])
# if i == 18:
# print(head,tail)
a[head][tail] += 1
for i in range(n):
if i % 10 == 0:
continue
head = int(str(i)[0])
tail = int(str(i)[-1])
count += a[tail][head]
print(count)
|
# import bisect
# # import heapq
# # from copy import deepcopy
# # from collections import deque
# # from collections import Counter
# # from itertools import accumulate
# # from itertools import permutations
# import numpy as np
# # import math
# a,b,c = map(int, input().split())
# p = list(map(int, input().split()))
n = int(input())
count = 0
a = [[0] * 10 for i in range(10)]
# print(a)
# print(b)
for i in range(n +1):
head = int(str(i)[0])
tail = int(str(i)[-1])
# if i == 18:
# print(head,tail)
a[head][tail] += 1
for i in range(n+1):
if i % 10 == 0:
continue
head = int(str(i)[0])
tail = int(str(i)[-1])
count += a[tail][head]
print(count)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,471
| 598,472
|
u557565572
|
python
|
p02792
|
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
dp = [0]*(n+1)
for i in range(1,n+1):
s = str(i)
if s[0] == s[-1]:
dp[int(s[0])] += 1
elif s[-1] == "0":
continue
else:
ima = int(s[0])*10 + int(s[-1])
dp[ima] += 1
ans = 0
for i in range(1,min(100,n+1)):
s = str(i)
if s[0] == s[-1]:
ans += dp[int(s[0])]**2
dp[int(s[0])] = 0
elif s[-1] == "0":
continue
else:
ima = int(s[0])*10 + int(s[-1])
ima2 = int(s[-1])*10 + int(s[0])
ans += dp[ima] * dp[ima2] *2
dp[ima] = 0
dp[ima2] = 0
print(ans)
|
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
dp = [0]*max(101,(n+1))
for i in range(1,n+1):
s = str(i)
if s[0] == s[-1]:
dp[int(s[0])] += 1
elif s[-1] == "0":
continue
else:
ima = int(s[0])*10 + int(s[-1])
dp[ima] += 1
ans = 0
for i in range(1,min(100,n+1)):
s = str(i)
if s[0] == s[-1]:
ans += dp[int(s[0])]**2
dp[int(s[0])] = 0
elif s[-1] == "0":
continue
else:
ima = int(s[0])*10 + int(s[-1])
ima2 = int(s[-1])*10 + int(s[0])
ans += dp[ima] * dp[ima2] *2
dp[ima] = 0
dp[ima2] = 0
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 598,475
| 598,476
|
u872887731
|
python
|
p02792
|
n=int(input())
cnt=[[0 for i in range(10)] for j in range(n)]
for i in range(1,n+1):
s=str(i)
head=int(s[0])
tail=int(s[-1])
cnt[head][tail]+=1
ans=0
for h in range(0,10):
for t in range(0,10):
ans+=cnt[h][t]*cnt[t][h]
print(ans)
|
n=int(input())
cnt=[[0 for i in range(10)] for j in range(10)]
for i in range(1,n+1):
s=str(i)
head=int(s[0])
tail=int(s[-1])
cnt[head][tail]+=1
ans=0
for h in range(0,10):
for t in range(0,10):
ans+=cnt[h][t]*cnt[t][h]
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 598,479
| 598,480
|
u130900604
|
python
|
p02792
|
n=int(input())
c=[[0]*10 for i in range(n)]
for i in range(1,n+1):
t=str(i)
c[int(t[0])][int(t[-1])]+=1
ans=0
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 i in range(10)]
for i in range(1,n+1):
t=str(i)
c[int(t[0])][int(t[-1])]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=c[i][j]*c[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 598,481
| 598,482
|
u130900604
|
python
|
p02792
|
n = int(input())
ans = 0
a = [[[] for i in range(10)] for j in range(10)]
for i in range(n):
a[int(str(i)[0])][int(str(i)[-1])].append(i)
for i in range(1, 10):
for j in range(1, 10):
ans += len(a[i][j]) * len(a[j][i])
print(ans)
|
n = int(input())
ans = 0
a = [[[] for i in range(10)] for j in range(10)]
for i in range(1, n + 1):
a[int(str(i)[0])][int(str(i)[-1])].append(i)
for i in range(1, 10):
for j in range(1, 10):
ans += len(a[i][j]) * len(a[j][i])
print(ans)
|
[
"call.arguments.add"
] | 598,488
| 598,489
|
u651109406
|
python
|
p02792
|
n=int(input())
D={}
for i in range(n):
s=(str(i)[0],str(i)[-1])
if s in D:
D[s]+=1
else:
D[s]=1
ans=0
for i in D:
t=(i[1],i[0])
if t in D:
ans+=D[t]*D[i]
print(ans)
|
n=int(input())
D={}
for i in range(1,n+1):
s=(str(i)[0],str(i)[-1])
if s in D:
D[s]+=1
else:
D[s]=1
ans=0
for i in D:
t=(i[1],i[0])
if t in D:
ans+=D[t]*D[i]
print(ans)
|
[
"call.arguments.add"
] | 598,502
| 598,503
|
u573754721
|
python
|
p02792
|
N = int(input())
Cij = [[0 for _ in range(N)] for _ in range(N)]
for i in range(1,N+1):
a, b = int(str(i)[0]), int(str(i)[-1])
Cij[a][b] += 1
print(sum(Cij[i][j]*Cij[j][i] for i in range(N) for j in range(N)))
|
N = int(input())
Cij = [[0 for _ in range(10)] for _ in range(10)]
for i in range(1,N+1):
a, b = int(str(i)[0]), int(str(i)[-1])
Cij[a][b] += 1
print(sum(Cij[i][j]*Cij[j][i] for i in range(10) for j in range(10)))
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 598,506
| 598,507
|
u078932560
|
python
|
p02792
|
n = int(input())
c = [[0 for i in range(10)] for j in range(10)]
for i in range(n):
x = str(n + 1)
c[int(x[0])][int(x[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans)
|
n = int(input())
c = [[0 for i in range(10)] for j in range(10)]
for i in range(n):
x = str(i + 1)
c[int(x[0])][int(x[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 598,510
| 598,511
|
u104005543
|
python
|
p02792
|
n = int(input())
c = [[0 for i in range(10)] for j in range(10)]
for i in range(n):
x = str(n + 1)
c[int(x[0])][int(x[-1])] += 1
ans = 0
for i in range(n):
for j in range(n):
ans += c[i][j] * c[j][i]
print(ans)
|
n = int(input())
c = [[0 for i in range(10)] for j in range(10)]
for i in range(n):
x = str(i + 1)
c[int(x[0])][int(x[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.range.bounds.upper.change"
] | 598,512
| 598,511
|
u104005543
|
python
|
p02792
|
N = int(input())
c = [[0] for i in range(10)]
for i in range(1, N+1):
s = str(i)
c[int(s[0])][int(s[-1])] += 1
ans = 0
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 i in range(10)]
for i in range(1, N+1):
s = str(i)
c[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans)
|
[
"assignment.change"
] | 598,517
| 598,518
|
u363995337
|
python
|
p02792
|
n = int(input())
cnt = [[0] * 10 for i in range(10)]
for i in range(1,n+1):
cnt[int(str(i)[0])][int(str(i)[-1])] += 1
print(cnt)
ans = 0
for i in range(10):
for j in range(10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
|
n = int(input())
cnt = [[0] * 10 for i in range(10)]
for i in range(1,n+1):
cnt[int(str(i)[0])][int(str(i)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
|
[
"call.remove"
] | 598,527
| 598,528
|
u872538555
|
python
|
p02792
|
N = int(input())
c = [[0]*10 for _ in range(10)]
for k in range(N):
c[int(str(k)[0])][int(str(k)[-1])]+=1
ans = 0
for k in range(81):
i = k // 9 + 1
j = k % 9 + 1
ans += c[i][j] * c[j][i]
print(ans)
|
N = int(input())
c = [[0]*10 for _ in range(10)]
for k in range(1,N+1):
c[int(str(k)[0])][int(str(k)[-1])]+=1
ans = 0
for k in range(81):
i = k // 9 + 1
j = k % 9 + 1
ans += c[i][j] * c[j][i]
print(ans)
|
[
"call.arguments.add"
] | 598,529
| 598,530
|
u093861603
|
python
|
p02792
|
d=[0]*100
for i in range(int(input())+1):
s=str(i)
d[int(s[0])*10+int(s[-1])]+=1
print(sum(d[i]*d[i%10*10+i//10]for i in range(100)))
|
d=[0]*100
for i in range(int(input())):
s=str(i+1)
d[int(s[0])*10+int(s[-1])]+=1
print(sum(d[i]*d[i%10*10+i//10]for i in range(100)))
|
[
"expression.operation.binary.remove"
] | 598,535
| 598,536
|
u729133443
|
python
|
p02792
|
import numpy as np
# get N
#N = int(input())
N =200000
countup = np.zeros(100, dtype=int)
for x in range(1,N+1):
sx = str(x)
A = int(sx[0])
B = int(sx[-1])
countup[A*10+B] += 1
ans = 0
for x in range(1,N+1):
sx = str(x)
A = int(sx[0])
B = int(sx[-1])
ans += countup[B*10+A]
print(ans)
|
import numpy as np
# get N
N = int(input())
countup = np.zeros(100, dtype=int)
for x in range(1,N+1):
sx = str(x)
A = int(sx[0])
B = int(sx[-1])
countup[A*10+B] += 1
ans = 0
for x in range(1,N+1):
sx = str(x)
A = int(sx[0])
B = int(sx[-1])
ans += countup[B*10+A]
print(ans)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 598,537
| 598,538
|
u014779044
|
python
|
p02792
|
n = int(input())
d = defaultdict(int)
for i in range(1, n+1):
x = str(i)
d[(int(x[0]), int(x[-1]))] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += d[(i, j)] * d[(j, i)]
print(ans)
|
from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(1, n+1):
x = str(i)
d[(int(x[0]), int(x[-1]))] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += d[(i, j)] * d[(j, i)]
print(ans)
|
[] | 598,553
| 598,554
|
u417365712
|
python
|
p02792
|
from collections import defaultdict
N = int(input())
res = 0
freq = defaultdict(int)
for i in range(1, N):
si = str(i)
freq['{}{}'.format(si[0], si[-1])] += 1
for i in range(1, N):
si = str(i)
res += freq['{}{}'.format(si[-1], si[0])]
print(res)
|
from collections import defaultdict
N = int(input())
res = 0
freq = defaultdict(int)
for i in range(1, N+1):
si = str(i)
freq['{}{}'.format(si[0], si[-1])] += 1
for i in range(1, N+1):
si = str(i)
res += freq['{}{}'.format(si[-1], si[0])]
print(res)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,555
| 598,556
|
u276204978
|
python
|
p02792
|
n=input()
intn=int(n)
ln=len(n)
if intn<10:
print(n)
quit()
def count(i,j):
res=0
if i==j:
res+=1
if ln==2:
if 10*i+j<=n:
res+=1
else:
res+=(10**(ln-2)-1)//9
if i<int(n[0]):
res+=10**(ln-2)
elif i==int(n[0]):
tn=int(n[1:-1])
if j<=intn%10:
res+=tn+1
else:
res+=tn
return res
res=0
for i in range(1,10):
for j in range(1,10):
res+=count(i,j)*count(j,i)
print(res)
|
n=input()
intn=int(n)
ln=len(n)
if intn<10:
print(n)
quit()
def count(i,j):
res=0
if i==j:
res+=1
if ln==2:
if 10*i+j<=intn:
res+=1
else:
res+=(10**(ln-2)-1)//9
if i<int(n[0]):
res+=10**(ln-2)
elif i==int(n[0]):
tn=int(n[1:-1])
if j<=intn%10:
res+=tn+1
else:
res+=tn
return res
res=0
for i in range(1,10):
for j in range(1,10):
res+=count(i,j)*count(j,i)
print(res)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 598,563
| 598,564
|
u780475861
|
python
|
p02792
|
N = int(input())
arr = [0]*100
for num in range(1,N):
arr[int(str(num)[0]+str(num)[-1])] += 1
print(sum([arr[i*10+j]*arr[j*10+i] for i in range(10) for j in range(10)]))
|
N = int(input())
arr = [0]*100
for num in range(1,N+1):
arr[int(str(num)[0]+str(num)[-1])] += 1
print(sum([arr[i*10+j]*arr[j*10+i] for i in range(10) for j in range(10)]))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,569
| 598,570
|
u268181283
|
python
|
p02792
|
N = int(input())
c = [[0]*10 for i in range(10)]
for i in range(1,N+1):
a = N % 10
b = 0
while N > 0:
b = N
N = N // 10
c[a][b] += 1
ans = 0
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 i in range(10)]
for i in range(1,N+1):
a = i % 10
b = 0
while i > 0:
b = i
i = i // 10
c[a][b] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j]*c[j][i]
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 598,571
| 598,572
|
u875449556
|
python
|
p02792
|
N = int(input())
import numpy as np
X = np.arange(N+1)
A = X.copy()
for i in [1,10,100,1000,10000]:
A[i:i*10] = X[i:i*10] // i
B = X % 10
C = np.zeros((10,10), dtype=int)
for i in range(1,N+1):
C[A[i], B[i]] += 1
count = 0
for i in range(10):
for j in range(10):
count += C[i][j] * C[j][i]
print(count)
|
N = int(input())
import numpy as np
X = np.arange(N+1)
A = X.copy()
for i in [1,10,100,1000,10000,100000]:
A[i:i*10] = X[i:i*10] // i
B = X % 10
C = np.zeros((10,10), dtype=int)
for i in range(1,N+1):
C[A[i], B[i]] += 1
count = 0
for i in range(10):
for j in range(10):
count += C[i][j] * C[j][i]
print(count)
|
[] | 598,573
| 598,574
|
u663093503
|
python
|
p02792
|
N = int(input())
# P = list(map(int, input().split()))
if N <= 10:
print(N)
exit()
dic = {}
for i in range(11,100):
if i % 10 == 0:
continue
if i % 11 == 0:
dic[i] = 1
else:
dic[i] = 0
for i in range(11, N):
if i % 10 == 0:
continue
tmp = str(i)[0] + str(i)[-1]
dic[int(tmp)] += 1
res = 0
for current, num in dic.items():
if current % 11 == 0:
res += num * num
else:
tmp = int(str(current)[::-1])
res += num * dic[tmp]
print(res)
|
N = int(input())
# P = list(map(int, input().split()))
if N <= 10:
print(N)
exit()
dic = {}
for i in range(11,100):
if i % 10 == 0:
continue
if i % 11 == 0:
dic[i] = 1
else:
dic[i] = 0
for i in range(11, N+1):
if i % 10 == 0:
continue
tmp = str(i)[0] + str(i)[-1]
dic[int(tmp)] += 1
res = 0
for current, num in dic.items():
if current % 11 == 0:
res += num * num
else:
tmp = int(str(current)[::-1])
res += num * dic[tmp]
print(res)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,577
| 598,578
|
u905711033
|
python
|
p02792
|
import sys
N = int(input())
if N < 10:
print(N)
sys.exit()
if N < 100:
cnt = 0
for i in range(1,N+1):
if i < 10:
cnt += 1
if (i*10)+i <= N:
cnt += 1
else:
s = str(i)
sa,sb = s[0],s[-1]
if sb == '0':
continue
ss = sb+sa
if int(ss) <= N:
cnt += 1
if sa == sb:
cnt += 1
print(cnt)
sys.exit()
k = len(str(N))
auto = 0
for i in range(k-1):
auto += 10**i
auto2 = (auto-10**(k-2)) + (int(str(N)[1:]) // 10)
auto3 = auto - 10**(k-2)
m = str(N)[0]
mm = str(N)[-1]
def solve(a,b):
ans = 0
if a == b:
ans += 1
if a < m:
return ans + auto
elif a == m:
if b <= mm:
return ans + auto2
else:
return ans + auto2 -1
else:
return ans + auto3
cnt = 0
for i in range(1,N+1):
s = str(i)
if s[-1] == '0':
continue
if i < 10:
cnt += solve(s,s)
else:
sa,sb = s[0],s[-1]
cnt += solve(sb,sa)
print(cnt)
|
import sys
N = int(input())
if N < 10:
print(N)
sys.exit()
if N < 100:
cnt = 0
for i in range(1,N+1):
if i < 10:
cnt += 1
if (i*10)+i <= N:
cnt += 1
else:
s = str(i)
sa,sb = s[0],s[-1]
if sb == '0':
continue
ss = sb+sa
if int(ss) <= N:
cnt += 1
if sa == sb:
cnt += 1
print(cnt)
sys.exit()
k = len(str(N))
auto = 0
for i in range(k-1):
auto += 10**i
auto2 = (auto-10**(k-2)) + (int(str(N)[1:]) // 10)
auto3 = auto - 10**(k-2)
m = str(N)[0]
mm = str(N)[-1]
def solve(a,b):
ans = 0
if a == b:
ans += 1
if a < m:
return ans + auto
elif a == m:
if b <= mm:
return ans + auto2 + 1
else:
return ans + auto2
else:
return ans + auto3
cnt = 0
for i in range(1,N+1):
s = str(i)
if s[-1] == '0':
continue
if i < 10:
cnt += solve(s,s)
else:
sa,sb = s[0],s[-1]
cnt += solve(sb,sa)
print(cnt)
|
[
"expression.operation.binary.remove"
] | 598,583
| 598,584
|
u314050667
|
python
|
p02792
|
n = int(input())
strn = str(n)
keta = len(strn)
n_head = int(strn[0])
n_tail = int(strn[-1])
naka = strn[1:-1]
if len(naka) == 0:
nakan = 0
else:
nakan = int(naka)
ans = 0
if keta <= 2:
for i in range(1,n+1):
for j in range(1,n+1):
head1 = int(str(i)[0])
tail1 = int(str(i)[-1])
head2 = int(str(j)[0])
tail2 = int(str(j)[-1])
if head1 == tail2 and head2 == tail1:
ans += 1
print(i,j)
print(ans)
else:
hoj = []
tmp = 1
mog = 1
for i in range(keta):
hoj.append(mog)
tmp = tmp*10
mog = mog + tmp
#print(hoj)
for i in range(1,n+1):
head = int(str(i)[0])
tail = int(str(i)[-1])
if tail == 0:
continue
if tail < n_head:
ans += hoj[keta-2]
elif tail > n_head:
ans += hoj[keta-3]
else:
ans += hoj[keta-3]
if head <= n_tail:
ans += nakan + 1
else:
ans += max(nakan ,0)
if head == tail:
ans += 1
#print(i,ans)
print(ans)
|
n = int(input())
strn = str(n)
keta = len(strn)
n_head = int(strn[0])
n_tail = int(strn[-1])
naka = strn[1:-1]
if len(naka) == 0:
nakan = 0
else:
nakan = int(naka)
ans = 0
if keta <= 2:
for i in range(1,n+1):
for j in range(1,n+1):
head1 = int(str(i)[0])
tail1 = int(str(i)[-1])
head2 = int(str(j)[0])
tail2 = int(str(j)[-1])
if head1 == tail2 and head2 == tail1:
ans += 1
#print(i,j)
print(ans)
else:
hoj = []
tmp = 1
mog = 1
for i in range(keta):
hoj.append(mog)
tmp = tmp*10
mog = mog + tmp
#print(hoj)
for i in range(1,n+1):
head = int(str(i)[0])
tail = int(str(i)[-1])
if tail == 0:
continue
if tail < n_head:
ans += hoj[keta-2]
elif tail > n_head:
ans += hoj[keta-3]
else:
ans += hoj[keta-3]
if head <= n_tail:
ans += nakan + 1
else:
ans += max(nakan ,0)
if head == tail:
ans += 1
#print(i,ans)
print(ans)
|
[
"call.remove"
] | 598,595
| 598,596
|
u352623442
|
python
|
p02792
|
#a, b = map(int, input().split())
n = int(input())
l = [[0 for i in range(10)] for j in range(10)]
ans = 0
for i in range(n):
s = str(i)
t = len(s)
u = int(s[0])
v = int(s[len(s)-1])
if u == 0:
continue
if v == 0:
continue
if u == v:
ans += 1
z = 2 * l[v][u]
ans += z
l[u][v] += 1
print(ans)
|
#a, b = map(int, input().split())
n = int(input())
l = [[0 for i in range(10)] for j in range(10)]
ans = 0
for i in range(n):
s = str(i+1)
t = len(s)
u = int(s[0])
v = int(s[len(s)-1])
if u == 0:
continue
if v == 0:
continue
if u == v:
ans += 1
z = 2 * l[v][u]
ans += z
l[u][v] += 1
print(ans)
|
[
"assignment.change"
] | 598,599
| 598,600
|
u262801165
|
python
|
p02792
|
N = int(input())
BegEndTbl = []
for _ in range(10):
BegEndTbl.append([0] * 10)
print(BegEndTbl)
ans = 0
for i in range(1, N + 1):
left = int(str(i)[0])
right = i % 10
if left == right:
ans += 1
ans += BegEndTbl[right][left] * 2
BegEndTbl[left][right] += 1
print(ans)
|
N = int(input())
BegEndTbl = []
for _ in range(10):
BegEndTbl.append([0] * 10)
ans = 0
for i in range(1, N + 1):
left = int(str(i)[0])
right = i % 10
if left == right:
ans += 1
ans += BegEndTbl[right][left] * 2
BegEndTbl[left][right] += 1
print(ans)
|
[
"call.remove"
] | 598,601
| 598,602
|
u795245552
|
python
|
p02792
|
from math import gcd
# from datetime import date, timedelta
# from heapq import *
import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline
def lcm(a, b):
return a * b / math.gcd(a, b)
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def is_prime(n):
if n == 1:
return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
def modpow(a, n, mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
def modinv(a, mod):
return modpow(a, mod - 2, mod)
def cnk(a, b):
MOD = 10**9+7
ret = 1
for i in range(b):
ret *= (a-i)
ret %= MOD
ret = ret * modinv(i+1, MOD) % MOD
return ret
def main():
# n = int(input())
# a = list(map(int, input().split()))
# v = a[0]
# for i in range(1, n):
# v = lcm(v, a[i])
# ans = 0
# v %= MOD
# for i in range(n):
# ans += v * modinv(a[i], MOD) % MOD
# ans %= MOD
# print(ans)
n = int(input())
d = defaultdict(int)
for i in range(1,n+1):
if i < 10:
d[(i, i)] += 1
else:
d[(int(str(i)[-1]), int(str(i)[0]))] += 1
ans = 0
for i in range(1, n):
if i < 10:
ans +=d[(i, i)]
else:
if int(str(i)[-1]) == int(str(i)[0]):
ans += d[(int(str(i)[0]), int(str(i)[-1]))]
else:
ans += d[(int(str(i)[0]), int(str(i)[-1]))]
print(ans)
# ans = 0
# for i in range(1,n+1):
# # if set(str(i)) == 1:
# # continue
# ss = str(i)[::-1]
# if int(ss) <= n and str(ss)[0] != "0":
# ans += 1
# print(i,str(i)[::-1])
# print(ans)
# for i in range(1, 10):
# t = 0
# s = ""
# for j in range(6):
# s += str(i)
# if int(s) > n:
# break
# t += 1
# if t == 1:
# continue
# k = 1
# for j in range(1, t + 1):
# k*=j
# ans += k
# # print(k)
# print(ans)
if __name__ == '__main__':
main()
|
from math import gcd
# from datetime import date, timedelta
# from heapq import *
import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline
def lcm(a, b):
return a * b / math.gcd(a, b)
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def is_prime(n):
if n == 1:
return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
def modpow(a, n, mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
def modinv(a, mod):
return modpow(a, mod - 2, mod)
def cnk(a, b):
MOD = 10**9+7
ret = 1
for i in range(b):
ret *= (a-i)
ret %= MOD
ret = ret * modinv(i+1, MOD) % MOD
return ret
def main():
# n = int(input())
# a = list(map(int, input().split()))
# v = a[0]
# for i in range(1, n):
# v = lcm(v, a[i])
# ans = 0
# v %= MOD
# for i in range(n):
# ans += v * modinv(a[i], MOD) % MOD
# ans %= MOD
# print(int(ans))
n = int(input())
d = defaultdict(int)
for i in range(1,n+1):
if i < 10:
d[(i, i)] += 1
else:
d[(int(str(i)[-1]), int(str(i)[0]))] += 1
ans = 0
for i in range(1, n+1):
if i < 10:
ans +=d[(i, i)]
else:
if int(str(i)[-1]) == int(str(i)[0]):
ans += d[(int(str(i)[0]), int(str(i)[-1]))]
else:
ans += d[(int(str(i)[0]), int(str(i)[-1]))]
print(ans)
if __name__ == '__main__':
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,603
| 598,604
|
u644778646
|
python
|
p02792
|
n=int(input())
a=[[0]*9 for i in range(9)]
for i in range(n):
x,y =int(str(i)[0]), int(str(i)[-1])
if y>0:
a[x-1][y-1]+=1
count=0
for i in range(9):
for j in range(9):
if i>j:
continue
if i==j:
count+=a[i][j]**2
else:
count+=a[i][j]*a[j][i]*2
print(count)
|
n=int(input())
a=[[0]*9 for i in range(9)]
for i in range(1,n+1):
x,y =int(str(i)[0]), int(str(i)[-1])
if y>0:
a[x-1][y-1]+=1
count=0
for i in range(9):
for j in range(9):
if i>j:
continue
if i==j:
count+=a[i][j]**2
else:
count+=a[i][j]*a[j][i]*2
print(count)
|
[
"call.arguments.add"
] | 598,605
| 598,606
|
u064408584
|
python
|
p02792
|
n = int(input())
if n < 10:
print(n)
exit()
memo = dict()
def func(s,f):
ans = 0
for i in range(1,n):
if str(i)[0] == f and str(i)[-1] == s:
ans += 1
memo[s+" "+f] = ans
res = 0
for i in range(1,n+1):
s = str(i)[0]
f = str(i)[-1]
if s + " " + f in memo:
res += memo[s + " " + f]
else:
func(s,f)
res += memo[s + " " + f]
print(res)
|
n = int(input())
if n < 10:
print(n)
exit()
memo = dict()
def func(s,f):
ans = 0
for i in range(1,n+1):
if str(i)[0] == f and str(i)[-1] == s:
ans += 1
memo[s+" "+f] = ans
res = 0
for i in range(1,n+1):
s = str(i)[0]
f = str(i)[-1]
if s + " " + f in memo:
res += memo[s + " " + f]
else:
func(s,f)
res += memo[s + " " + f]
print(res)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,609
| 598,610
|
u372144784
|
python
|
p02792
|
def main():
strn = input()
n = int(strn)
if n < 10:
print(n)
return
m = [0] * 81
for i in range(1, n + 1):
a = int(str(i)[0])
b = int(str(i)[-1])
# print(a, b)
if b == 0:
continue
else:
key = 9 * (a - 1) + b - 1
# print(key)
m[key] += 1
ans = 0
print(m)
for i in range(1, 10):
for j in range(1, 10):
key = 9 * (i - 1) + j - 1
oppose = 9 * (j - 1) + i - 1
ans += m[key] * m[oppose]
print(ans)
if __name__ == "__main__":
main()
|
def main():
strn = input()
n = int(strn)
if n < 10:
print(n)
return
m = [0] * 81
for i in range(1, n + 1):
a = int(str(i)[0])
b = int(str(i)[-1])
# print(a, b)
if b == 0:
continue
else:
key = 9 * (a - 1) + b - 1
# print(key)
m[key] += 1
ans = 0
# print(m)
for i in range(1, 10):
for j in range(1, 10):
key = 9 * (i - 1) + j - 1
oppose = 9 * (j - 1) + i - 1
ans += m[key] * m[oppose]
print(ans)
if __name__ == "__main__":
main()
|
[
"call.remove"
] | 598,613
| 598,614
|
u361841553
|
python
|
p02792
|
def main():
strn = input()
n = int(strn)
if n < 10:
print(n)
return
m = [0] * 81
for i in range(n):
a = int(str(i)[0])
b = int(str(i)[-1])
# print(a, b)
if b == 0:
continue
else:
key = 9 * (a - 1) + b - 1
# print(key)
m[key] += 1
ans = 0
# print(m)
for i in range(1, 10):
for j in range(1, 10):
key = 9 * (i - 1) + j - 1
oppose = 9 * (j - 1) + i - 1
ans += m[key] * m[oppose]
print(ans)
if __name__ == "__main__":
main()
|
def main():
strn = input()
n = int(strn)
if n < 10:
print(n)
return
m = [0] * 81
for i in range(1, n + 1):
a = int(str(i)[0])
b = int(str(i)[-1])
# print(a, b)
if b == 0:
continue
else:
key = 9 * (a - 1) + b - 1
# print(key)
m[key] += 1
ans = 0
# print(m)
for i in range(1, 10):
for j in range(1, 10):
key = 9 * (i - 1) + j - 1
oppose = 9 * (j - 1) + i - 1
ans += m[key] * m[oppose]
print(ans)
if __name__ == "__main__":
main()
|
[
"call.arguments.add"
] | 598,615
| 598,614
|
u361841553
|
python
|
p02792
|
N=int(input())
Atamasiri = [[0 for i in range(10)] for j in range(10)]#Atamasiri[atama][siri]
cursaijou = 1
for n in range(1,N+1):
if n>=cursaijou*10:
cursaijou *= 10
atama = n//cursaijou
siri = n%10
Atamasiri[atama][siri] += 1
ans = 0
print(Atamasiri)
for head in range(10):
for ketsu in range(10):
ans += Atamasiri[head][ketsu]*Atamasiri[ketsu][head]
print(ans)
|
N=int(input())
Atamasiri = [[0 for i in range(10)] for j in range(10)]#Atamasiri[atama][siri]
cursaijou = 1
for n in range(1,N+1):
if n>=cursaijou*10:
cursaijou *= 10
atama = n//cursaijou
siri = n%10
Atamasiri[atama][siri] += 1
ans = 0
for head in range(10):
for ketsu in range(10):
ans += Atamasiri[head][ketsu]*Atamasiri[ketsu][head]
print(ans)
|
[
"call.remove"
] | 598,616
| 598,617
|
u268516119
|
python
|
p02792
|
N = int(input())
DP = [[0 for _ in range(10)] for _ in range(10)]
for i in range(1, N):
DP[int(str(i)[0])][int(str(i)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += DP[i][j] * DP[j][i]
print(ans)
|
N = int(input())
DP = [[0 for _ in range(10)] for _ in range(10)]
for i in range(1, N+1):
DP[int(str(i)[0])][int(str(i)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += DP[i][j] * DP[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,620
| 598,621
|
u261260430
|
python
|
p02792
|
n = int(input())
c = [[0] * 10 for i in range(10)]
for i in range(n):
start = int(str(i)[0])
stop = int(str(i)[-1])
c[start][stop] += 1
r = 0
for i in range(10):
for j in range(10):
r += c[i][j] * c[j][i]
#iとjがどちらも0の場合は問題設定と合致しないので引く
print(r - 1)
|
n = int(input())
c = [[0] * 10 for i in range(10)]
for i in range(1, n+1):
start = int(str(i)[0])
stop = int(str(i)[-1])
c[start][stop] += 1
r = 0
for i in range(10):
for j in range(10):
r += c[i][j] * c[j][i]
#iとjがどちらも0の場合は問題設定と合致しないので引く
print(r)
|
[
"call.arguments.add",
"expression.operation.binary.remove"
] | 598,624
| 598,625
|
u293497732
|
python
|
p02792
|
s = int(input())
num = [[0 for i in range(10)] for j in range(10)]
ans = 0
for _ in range(n):
i = _ + 1
if i < 10:
num[i][i] += 1
elif i % 10 != 0:
moji = str(i)
num[int(moji[0])][int(moji[len(moji)-1])] += 1
else:
pass
for i in range(1, 10):
for j in range(1, 10):
ans += num[i][j] * num[j][i]
print(ans)
|
n = int(input())
num = [[0 for i in range(10)] for j in range(10)]
ans = 0
for _ in range(n):
i = _ + 1
if i < 10:
num[i][i] += 1
elif i % 10 != 0:
moji = str(i)
num[int(moji[0])][int(moji[len(moji)-1])] += 1
else:
pass
for i in range(1, 10):
for j in range(1, 10):
ans += num[i][j] * num[j][i]
print(ans)
|
[
"assignment.variable.change",
"identifier.change"
] | 598,634
| 598,635
|
u428132025
|
python
|
p02792
|
strN = input()
N = int(strN)
p = {i: {j: 0 for j in range(1, 10)} for i in range(1, 10)}
for k in range(1, N):
strk = str(k)
i = int(strk[0])
j = int(strk[-1])
if i == 0 or j == 0:
continue
p[i][j] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += p[i][j] * p[j][i]
print(ans)
|
strN = input()
N = int(strN)
p = {i: {j: 0 for j in range(1, 10)} for i in range(1, 10)}
for k in range(1, N+1):
strk = str(k)
i = int(strk[0])
j = int(strk[-1])
if i == 0 or j == 0:
continue
p[i][j] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += p[i][j] * p[j][i]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,638
| 598,639
|
u963682312
|
python
|
p02792
|
import math
a=int(input())
ans=0
c=[[0 for i in range(10)] for j in range(10)]
for i in range(1,a):
aa=str(i)
c[int(aa[0])][int(aa[-1])]+=1
for i in range(10):
for j in range(10):
ans+=c[i][j]*c[j][i]
print(ans)
|
import math
a=int(input())
ans=0
c=[[0 for i in range(10)] for j in range(10)]
for i in range(1,a+1):
aa=str(i)
c[int(aa[0])][int(aa[-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,640
| 598,641
|
u233588813
|
python
|
p02792
|
N = int(input())
num = [[0 for j in range(10)]for i in range(10)]
for i in range(N):
NN = i
kouho = []
while NN>=1:
kouho.append(int(NN%10))
NN = NN/10
if len(kouho) == 0:
continue
low_bit = int(kouho[0])
high_bit = int(kouho[-1])
if (not low_bit or not high_bit):
continue
num[low_bit][high_bit] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += num[i][j] * num[j][i]
print(ans)
|
N = int(input())
num = [[0 for j in range(10)]for i in range(10)]
for i in range(1,N+1):
NN = i
kouho = []
while NN>=1:
kouho.append(int(NN%10))
NN = NN/10
if len(kouho) == 0:
continue
low_bit = int(kouho[0])
high_bit = int(kouho[-1])
if (not low_bit or not high_bit):
continue
num[low_bit][high_bit] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += num[i][j] * num[j][i]
print(ans)
|
[
"call.arguments.add"
] | 598,648
| 598,649
|
u494058663
|
python
|
p02792
|
N = int(input())
count = 0
baf = 0
if N <= 10:
for i in range(1, N+1):
for j in range(1, N+1):
stri = str(i)
strj = str(j)
if stri[0] == strj[-1] and strj[0] == stri[-1]:
#print(i, j)
count += 1
else:
num = (N // 10) ** 2
if N % 10 == 0:
print(num + 8)
else:
#print(num + 8)
#print(num)
for i in range(N // 10 * 10 ,N+1):
for j in range(1, N+1):
stri = str(i)
strj = str(j)
if stri[0] == strj[-1] and strj[0] == stri[-1]:
#print(i, j)
count += 1
#print(count)
count *= 2
for i in range(N // 10 * 10 + 1, N+1):
for j in range(N // 10 * 10 + 1, N+1):
stri = str(i)
strj = str(j)
if stri[0] == strj[-1] and strj[0] == stri[-1]:
#print(i, j)
count -= 1
#print(count)
print(num+count + 8)
|
N = int(input())
count = 0
baf = 0
if N <= 10:
for i in range(1, N+1):
for j in range(1, N+1):
stri = str(i)
strj = str(j)
if stri[0] == strj[-1] and strj[0] == stri[-1]:
#print(i, j)
count += 1
print(count)
else:
num = (N // 10) ** 2
if N % 10 == 0:
print(num + 8)
else:
#print(num + 8)
#print(num)
for i in range(N // 10 * 10 ,N+1):
for j in range(1, N+1):
stri = str(i)
strj = str(j)
if stri[0] == strj[-1] and strj[0] == stri[-1]:
#print(i, j)
count += 1
#print(count)
count *= 2
for i in range(N // 10 * 10 + 1, N+1):
for j in range(N // 10 * 10 + 1, N+1):
stri = str(i)
strj = str(j)
if stri[0] == strj[-1] and strj[0] == stri[-1]:
#print(i, j)
count -= 1
#print(count)
print(num+count + 8)
|
[
"call.add"
] | 598,652
| 598,653
|
u133566678
|
python
|
p02792
|
N = int(input())
memory = dict()
result = 0
for i in range(10):
for j in range(10):
memory[(i,j,)] = 0
for i in range(1, N):
if i >= 100000:
memory[(i//100000, i%10,)] += 1
elif i >= 10000:
memory[(i//10000, i%10,)] += 1
elif i >= 1000:
memory[(i//1000, i%10,)] += 1
elif i >= 100:
memory[(i//100, i%10,)] += 1
elif i >= 10:
memory[(i//10, i%10,)] += 1
else:
memory[(i, i,)] += 1
for i in range(10):
for j in range(10):
result += memory[(i,j,)] * memory[(j,i,)]
print(result)
|
N = int(input())
memory = dict()
result = 0
for i in range(10):
for j in range(10):
memory[(i,j,)] = 0
for i in range(1, N + 1):
if i >= 100000:
memory[(i//100000, i%10,)] += 1
elif i >= 10000:
memory[(i//10000, i%10,)] += 1
elif i >= 1000:
memory[(i//1000, i%10,)] += 1
elif i >= 100:
memory[(i//100, i%10,)] += 1
elif i >= 10:
memory[(i//10, i%10,)] += 1
else:
memory[(i, i,)] += 1
for i in range(10):
for j in range(10):
result += memory[(i,j,)] * memory[(j,i,)]
print(result)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,654
| 598,655
|
u864202285
|
python
|
p02792
|
#!/usr/bin/env python3
import sys
import collections
def solve(N: int):
c = collections.defaultdict(int)
if N == 1:
print(1)
return
for i in range(1, N):
target = str(i)
c[target[0], target[-1]] += 1
result = 0
for i in range(0, 10):
for j in range(0, 10):
i = str(i)
j = str(j)
result += c[i, j] * c[j, i]
print(result)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
import collections
def solve(N: int):
c = collections.defaultdict(int)
if N == 1:
print(1)
return
for i in range(1, N+1):
target = str(i)
c[target[0], target[-1]] += 1
result = 0
for i in range(0, 10):
for j in range(0, 10):
i = str(i)
j = str(j)
result += c[i, j] * c[j, i]
print(result)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,658
| 598,659
|
u628583308
|
python
|
p02792
|
N=int(input())
d=[[0]*10 for i in range(10)]
#10x10のグリッドを作る
#9x9パターンに分類されるため、各数字をグリッドに振り分ける
for i in range(N):
n=str(i)
d[int(n[0])][int(n[-1])]+=1
#組み合わせの数は[Aの数]x[Bの数] 先頭か語尾に0が付くものはカウントしない
r=0
for i in range(9):
for j in range(9):
r+=d[i+1][j+1]*d[j+1][i+1]
print(r)
|
N=int(input())
d=[[0]*10 for i in range(10)]
#10x10のグリッドを作る
#9x9パターンに分類されるため、各数字をグリッドに振り分ける
for i in range(1,N+1):
n=str(i)
d[int(n[0])][int(n[-1])]+=1
#組み合わせの数は[Aの数]x[Bの数] 先頭か語尾に0が付くものはカウントしない
r=0
for i in range(9):
for j in range(9):
r+=d[i+1][j+1]*d[j+1][i+1]
print(r)
|
[
"call.arguments.add"
] | 598,660
| 598,661
|
u343977188
|
python
|
p02792
|
def main():
n = int(input())
table = [0] * 100
for i in range(n):
i_str = str(i)
table[int(i_str[0]) * 10 + int(i_str[-1])] += 1
num = 0
for i in range(1, 10):
for j in range(1, 10):
num += table[i*10 + j] * table[j*10 + i]
print(num)
if __name__ == '__main__':
main()
|
def main():
n = int(input())
table = [0] * 100
for i in range(n+1):
i_str = str(i)
table[int(i_str[0]) * 10 + int(i_str[-1])] += 1
num = 0
for i in range(1, 10):
for j in range(1, 10):
num += table[i*10 + j] * table[j*10 + i]
print(num)
if __name__ == '__main__':
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,664
| 598,665
|
u355649707
|
python
|
p02792
|
n = int(input())
number = [[0]*10 for _ in range(10)]
for _ in range(1, n+1):
s=str(i)
i=int(s[0])
j=int(s[-1])
number[i][j] += 1
count = 0
for i in range(10):
for j in range(10):
count += number[i][j]*number[j][i]
print(count)
|
n = int(input())
number = [[0]*10 for _ in range(10)]
for _ in range(1, n+1):
s=str(_)
i=int(s[0])
j=int(s[-1])
number[i][j] += 1
count = 0
for i in range(10):
for j in range(10):
count += number[i][j]*number[j][i]
print(count)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 598,668
| 598,669
|
u500415792
|
python
|
p02792
|
N = int(input())
table = [[0]*10 for _ in range(10)]
for i in range(1, N+1):
s = str(i)
e1 = int(s[0])
e2 = int(s[1])
table[e1][e2] += 1
res = 0
for i in range(1, 10):
for j in range(1, 10):
res += table[i][j]*table[j][i]
print(res)
|
N = int(input())
table = [[0]*10 for _ in range(10)]
for i in range(1, N+1):
s = str(i)
e1 = int(s[0])
e2 = int(s[-1])
table[e1][e2] += 1
res = 0
for i in range(1, 10):
for j in range(1, 10):
res += table[i][j]*table[j][i]
print(res)
|
[
"expression.operation.unary.add",
"call.arguments.change"
] | 598,675
| 598,676
|
u259861571
|
python
|
p02792
|
from collections import defaultdict
def getLeft(num):
while num > 10:
num = int(num / 10)
return num
def getRight(num):
return num % 10
n = int(input())
a = defaultdict(int)
for number in range(1,n+1):
left = getLeft(number)
right = getRight(number)
a[(left,right)] += 1
res = 0
for i in range(0,10):
for j in range(0,10):
res += a[(i,j)] * a[(j,i)]
print(res)
|
from collections import defaultdict
def getLeft(num):
while num >= 10:
num = int(num / 10)
return num
def getRight(num):
return num % 10
n = int(input())
a = defaultdict(int)
for number in range(1,n+1):
left = getLeft(number)
right = getRight(number)
a[(left,right)] += 1
res = 0
for i in range(0,10):
for j in range(0,10):
res += a[(i,j)] * a[(j,i)]
print(res)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 598,677
| 598,678
|
u979126665
|
python
|
p02792
|
def get_lmb(N):
while (N >= 10):
N = int(N/10)
return N
def get_rmb(N):
return N%10
def find_all():
from collections import defaultdict
dic = defaultdict(int)
N = int(input())
for i in range(1, N+1):
lmb, rmb = get_lmb(i), get_rmb(i)
dic[(lmb, rmb)] += 1
print(dic)
count = 0
for i in range(1, 10):
for j in range(1, 10):
count += dic[(i, j)] * dic[(j, i)]
# for i in range(1, 10):
# count += dic[(i, i)] * dic[(i, i)]
return count
print(find_all())
|
def get_lmb(N):
while (N >= 10):
N = int(N/10)
return N
def get_rmb(N):
return N%10
def find_all():
from collections import defaultdict
dic = defaultdict(int)
N = int(input())
for i in range(1, N+1):
lmb, rmb = get_lmb(i), get_rmb(i)
dic[(lmb, rmb)] += 1
# print(dic)
count = 0
for i in range(1, 10):
for j in range(1, 10):
count += dic[(i, j)] * dic[(j, i)]
# for i in range(1, 10):
# count += dic[(i, i)] * dic[(i, i)]
return count
print(find_all())
|
[
"call.remove"
] | 598,683
| 598,684
|
u628151901
|
python
|
p02792
|
n=int(input())
ans=0
dic={}
for i in range(1,n):
s=str(i)
d=(s[0],s[-1])
if d not in dic.keys():
dic[d] = 1
else:
dic[d] += 1
for a in dic.keys():
b = (a[1],a[0])
if b in dic.keys():
ans += dic[a]*dic[(a[1],a[0])]
print(ans)
|
n=int(input())
ans=0
dic={}
for i in range(1,n+1):
s=str(i)
d=(s[0],s[-1])
if d not in dic.keys():
dic[d] = 1
else:
dic[d] += 1
for a in dic.keys():
b = (a[1],a[0])
if b in dic.keys():
ans += dic[a]*dic[(a[1],a[0])]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,687
| 598,688
|
u951480280
|
python
|
p02792
|
N = int(input())
ans = 0
tmp = int(str(N)[1:-1])
NR = int(str(N)[-1])
for i in range(1,N+1):
L = int(str(i)[0])
R = int(str(i)[-1])
if R == 0:
continue
if L == R:
ans += 1
for j in range(1,6):
mini = (R*10**j) +L
maxi = ((R+1)*10**j) +L-10
if N < mini:
break
if maxi <= N:
ans += 10**(j-1)
continue
if L <= NR:
ans += tmp+1
else:
ans += tmp
break
print(ans)
|
N = int(input())
ans = 0
tmp = int("0"+str(N)[1:-1])
NR = int(str(N)[-1])
for i in range(1,N+1):
L = int(str(i)[0])
R = int(str(i)[-1])
if R == 0:
continue
if L == R:
ans += 1
for j in range(1,6):
mini = (R*10**j) +L
maxi = ((R+1)*10**j) +L-10
if N < mini:
break
if maxi <= N:
ans += 10**(j-1)
continue
if L <= NR:
ans += tmp+1
else:
ans += tmp
break
print(ans)
|
[
"assignment.change"
] | 598,689
| 598,690
|
u864013199
|
python
|
p02792
|
r = range(1, 10)
n = int(input())
a = [None] + [[0] * 10 for _ in r]
for i in r:
if i <= n:
a[i][j] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i][j] += min(k, (n - j) // 10 - k * i + 1)
k *= 10
print(sum(a[i][j] * a[j][i] for i in r for j in r))
|
r = range(1, 10)
n = int(input())
a = [None] + [[0] * 10 for _ in r]
for i in r:
if i <= n:
a[i][i] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i][j] += min(k, (n - j) // 10 - k * i + 1)
k *= 10
print(sum(a[i][j] * a[j][i] for i in r for j in r))
|
[
"identifier.change",
"variable_access.subscript.index.change"
] | 598,693
| 598,694
|
u021019433
|
python
|
p02792
|
n = int(input())
r = range(1, 10)
a = [[0] * 9 for _ in r]
for i in r:
if i <= n:
a[i - 1][i - 1] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i - 1][j - 1] += min(k, (n + 1 - j) // 10 - k * i)
k *= 10
print(sum(a[i][j] * a[j][i] for i in range(9) for j in range(9)))
|
n = int(input())
r = range(1, 10)
a = [[0] * 9 for _ in r]
for i in r:
if i <= n:
a[i - 1][i - 1] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i - 1][j - 1] += min(k, (n - j) // 10 - k * i + 1)
k *= 10
print(sum(a[i][j] * a[j][i] for i in range(9) for j in range(9)))
|
[
"expression.operation.binary.remove"
] | 598,696
| 598,697
|
u021019433
|
python
|
p02792
|
n = int(input())
r = range(1, 10)
a = [[0] * 9 for _ in r]
for i in r:
if i <= n:
a[i - 1][i - 1] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i - 1][j - 1] += min(k, (n - j + 9) // 10 - k * i)
k *= 10
print(sum(a[i][j] * a[j][i] for i in range(9) for j in range(9)))
|
n = int(input())
r = range(1, 10)
a = [[0] * 9 for _ in r]
for i in r:
if i <= n:
a[i - 1][i - 1] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i - 1][j - 1] += min(k, (n - j) // 10 - k * i + 1)
k *= 10
print(sum(a[i][j] * a[j][i] for i in range(9) for j in range(9)))
|
[
"expression.operation.binary.remove"
] | 598,698
| 598,697
|
u021019433
|
python
|
p02792
|
n = int(input())
r = range(1, 10)
a = [[0] * 9 for _ in r]
for i in r:
if i <= n:
a[i - 1][i - 1] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i - 1][j - 1] += min(k, (n + j + 9) // 10 - k * i)
k *= 10
print(sum(a[i][j] * a[j][i] for i in range(9) for j in range(9)))
|
n = int(input())
r = range(1, 10)
a = [[0] * 9 for _ in r]
for i in r:
if i <= n:
a[i - 1][i - 1] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i - 1][j - 1] += min(k, (n - j) // 10 - k * i + 1)
k *= 10
print(sum(a[i][j] * a[j][i] for i in range(9) for j in range(9)))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 598,699
| 598,697
|
u021019433
|
python
|
p02792
|
N = int(input())
cnts = [[0] * 10 for _ in range(10)]
ans = 0
for i in range(N):
if i % 10 == 0:
continue
s = str(i)
cnts[int(s[0])][int(s[-1])] += 1
for i in range(N):
if i % 10 == 0:
continue
s = str(i)
ans += cnts[int(s[-1])][int(s[0])]
print(ans)
|
N = int(input())
cnts = [[0] * 10 for _ in range(10)]
ans = 0
for i in range(N + 1):
if i % 10 == 0:
continue
s = str(i)
cnts[int(s[0])][int(s[-1])] += 1
for i in range(N + 1):
if i % 10 == 0:
continue
s = str(i)
ans += cnts[int(s[-1])][int(s[0])]
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 598,702
| 598,703
|
u726872801
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.