input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
print(('YNeos'[eval(input().replace(' ','>'))::2])) | a,b=input().split();print(('YNeos'[a!=b::2])) | p02789 |
a,b=list(map(int,input().split()))
print(("Yes" if a==b else "No")) | n,m=list(map(int,input().split()))
print(("Yes" if n==m else "No")) | p02789 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
N, M = list(map(int, input().split()))
if N == M:
print("Yes")
else:
... | n, m = list(map(int, input().split()))
if n == m:
print ('Yes')
else:
print ('No') | p02789 |
a,b=list(map(int,input().split()))
if a==b:
print('Yes')
else:
print('No') | n,m=list(map(int,input().split()))
if n==m:
print('Yes')
else:
print('No') | p02789 |
n, m = list(map(int, input().split()))
if m == n:
print("Yes")
else:
print("No") | n, m = list(map(int, input().split()))
if n != m:
print("No")
else:
print("Yes") | p02789 |
# -*- coding:utf-8 -*-
def histgram(mass, h, w):
table = [[0]*w for i in range(h)]
for i in range(h):
for j in range(w):
if mass[i][j] == '*':
table[i][j] = 0
else:
table[i][j] = table[i-1][j] + 1
return table
def get_rectangle_ar... | def histogram(mass, h, w):
table = [[0]*w for i in range(h)]
for i in range(h):
for j in range(w):
if mass[i][j] == '*':
table[i][j] = 0
else:
table[i][j] = table[i-1][j] + 1
return table
def get_rectangle_area(table, w):
maxv... | p00116 |
from itertools import product
while(True):
H,W = list(map(int,input().split()))
if not H: break
ma = 0
for i in range(H):
ma |= (int(input().replace(".","0").replace("*","1"),2) << ((H-i-1)*W))
flag = False
hw = [[h,w] for h,w in product(list(range(H,0,-1)),list(range(W,0,-1)))]
... | # ref: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=924554#1
from itertools import product
while(True):
H,W = list(map(int,input().split()))
if not H: break
ma = [list(map(int,input().replace(".","1").replace("*","0")))+[0] for _ in range(H)]
for i,j in product(list(range(1,H)),list(range(... | p00116 |
class Rect():
def __init__(self, x_range, y_range):
self.x_range = x_range
self.y_range = y_range
@property
def w(self):
return len(self.x_range)
@property
def h(self):
return len(self.y_range)
def __str__(self):
return "Rect... | from collections import deque
def ge(H,W):
q = deque([(0,0)])
while q:
x,y = q.popleft()
yield (x,y)
if y == 0 and x+1 < W:
q.append([x+1,y])
if y+1 < H:
q.append([x,y+1])
def solve(field,H,W):
space = [[0]*(W+1) for _ in range(H)]
fo... | p00116 |
def cut(squares):
ret = []
for s in squares:
for i,r in enumerate(ret):
if s[0] >= r[0] and s[1] >= r[1]:#replace
ret[i] = s
break
if s[0] <= r[0] and s[1] <= r[1]:#remove
break
else:
ret.append(s)#appe... | def re_push(stack,num):#re_push and return max
count = 0
pre = num
ma = 0
while True:
count += 1
cur = stack.pop()
if cur <= num:
ma = max(ma,(count-1) * pre)
stack += [cur]
stack += [num]*(count-1)
break
if cur ... | p00116 |
# Rectangular Searching
from collections import deque
while True:
h, w = list(map(int, input().split()))
if (h, w) == (0, 0):
break
g = []
for i in range(h):
g.append([1 if c == '.' else 0 for c in input()] + [0])
for i in range(1, h):
for j in range(w):
... | # Rectangular Searching
from collections import deque
while True:
h, w = list(map(int, input().split()))
if (h, w) == (0, 0):
break
g = []
for i in range(h):
g.append([1 if c == '.' else 0 for c in input()] + [0])
for i in range(1, h):
for j in range(w):
... | p00116 |
def f(k,j): return max(M[k],j-C[k])
while 1:
h,w = list(map(int, input().split()))
if h==w==0: break
H = list(range(h))
C = [0]*(h+1)
M = C[:]
a=[0]*w
for i in H:
x = input()
b=[0]*w
sp=-1
C = [-1]*(h+1)
for j in range(w):
if x[j]=="*":
c=0
elif x[j]... | while 1:
h,w = list(map(int, input().split()))
if h==w==0: break
H = list(range(h))
C = [0]*(h+1)
M = C[:]
a=[0]*w
for i in H:
x = input()
b=[0]*w
sp=-1
C = [-1]*(h+1)
for j in range(w):
if x[j]=="*": c=0
else: c=a[j]+1
b[j]=c
dw=c-sp
if d... | p00116 |
N = int(eval(input()))
ts = [int(eval(input())) for i in range(N)]
ts.sort()
ts.reverse()
ma = sum(ts) // 3 + 50
s = [[[0 for i in range(ma)] for j in range(ma)] for k in range(N + 1)]
for i in range(N):
for j in range(ma):
for k in range(ma):
p = [s[i][j][k] + ts[i]]
if(j ... | N = int(eval(input()))
ts = [int(eval(input())) for i in range(N)]
ma = sum(ts) // 3 + 50
s = [[[0 for i in range(ma)] for j in range(ma)] for k in range(N + 1)]
for i in range(N):
for j in range(ma):
for k in range(j, ma):
p = [s[i][j][k] + ts[i]]
if(j >= ts[i]):
... | p01868 |
n = int(eval(input()));l=[0 for _ in range(100)]
for i in range(1,n+1):
l[int(str(i)[0]+str(i)[-1])]+=1
print((sum([l[i*10+j]*l[j*10+i]for i in range(10) for j in range(10)]))) | l=[0 for _ in range(100)];r=list(range(10))
for i in range(1,int(eval(input()))+1):
s=str(i);l[int(s[0]+s[-1])]+=1
print((sum([l[i*10+j]*l[j*10+i]for i in r for j in r]))) | p02792 |
N = int(eval(input()))
count = [[0 for _ in range(9)] for _ in range(9)]
for i in range(1, N + 1):
if str(i)[0] != "0" and str(i)[-1] != "0":
count[int(str(i)[0]) - 1][int(str(i)[-1]) - 1] += 1
ans = 0
for i in range(0, 9):
for k in range(0, 9):
ans += count[i][k] * count[k][i]
print(an... | N = int(eval(input()))
nums = [0 for i in range(100)]
for i in range(1, N + 1):
i = str(i)
nums[int(i[0] + i[-1])] += 1
ans = 0
for i in range(1, 10):
for j in range(i, 10):
i = str(i)
j = str(j)
if i != j:
ans += nums[int(i + j)] * nums[int(j + i)] * 2
... | p02792 |
from itertools import product
def solve(string):
n = int(string)
t = [[0] * 10 for _ in range(10)]
for i in range(n + 1):
i = str(i)
t[int(i[0])][int(i[-1])] += 1
return str(sum(t[i][j] * t[j][i] for i, j in product(list(range(1, 10)), repeat=2)))
if __name__ == '__main__... | from itertools import product
"""
def solve(string):
n = int(string)
t = [[0] * 10 for _ in range(10)]
for i in range(n + 1):
i = str(i)
t[int(i[0])][int(i[-1])] += 1
# print(t)
# return str(sum(t[i][j] * t[j][i] for i, j in product(range(1, 10), repeat=2)))
"""
de... | p02792 |
from itertools import product
"""
def solve(string):
n = int(string)
t = [[0] * 10 for _ in range(10)]
for i in range(n + 1):
i = str(i)
t[int(i[0])][int(i[-1])] += 1
# print(t)
# return str(sum(t[i][j] * t[j][i] for i, j in product(range(1, 10), repeat=2)))
"""
de... | from itertools import product
def solve(string):
l = len(string)
*ns, = list(map(int, string))
n = int(string)
c = [0] + [10**i for i in range(6)]
t = sum(c[:l - 1])
t = [[t] * 10 for _ in range(10)]
if l > 1:
for i in range(10):
t[i][i] += 1
for i in r... | p02792 |
from itertools import product
def solve(string):
l = len(string)
*ns, = list(map(int, string))
n = int(string)
c = [0] + [10**i for i in range(6)]
t = sum(c[:l - 1])
t = [[t] * 10 for _ in range(10)]
if l > 1:
for i in range(10):
t[i][i] += 1
for i in r... | from itertools import product
def solve(string):
d = len(string)
if d == 1:
return string
s0, ss, sn = int(string[0]), int(string[1:-1] or 0), int(string[-1])
t = [[0] * 10] + [[int("1" * (d - 2) or 0)] * 10 for _ in range(9)]
for i in range(1, 10):
t[i][i] += 1
for ... | p02792 |
N = int(eval(input()))
if len(str(N))<4:
ans = 0
for i in range(1, N+1):
for j in range(1, N+1):
if str(i)[0]==str(j)[-1] and str(i)[-1]==str(j)[0]:
ans += 1
print(ans)
exit()
L = len(str(N))
n = int(str(N)[1:])
ans = 0
F = int(str(... | N = int(eval(input()))
cnt = [[0]*10 for _ in range(10)]
for i in range(1, N+1):
f = int(str(i)[0])
l = int(str(i)[-1])
cnt[f][l] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += cnt[i][j]*cnt[j][i]
print(ans) | p02792 |
N = int(eval(input()))
cnt = [[0] * 10 for _ 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)
| N = int(eval(input()))
dp = [[0] * 10 for _ in range(10)]
for x in range(1, N + 1):
j = x % 10
while x >= 10:
x //= 10
i = x % 10
dp[i][j] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += dp[i][j] * dp[j][i]
print(ans)
| p02792 |
n = int(eval(input()))
if n > 30:
x = n // 10
basenum = x * x + 8
addnum = 0
#print("{0} {1}".format(x* 10 + 1, n))
hassame = False
for i in range(x * 10 + 1, n+1):
#print(i)
for j in range(1, n+1):
#print(j)
if str(i)[0] == str(j)[-1] and str(i... | n = int(eval(input()))
if n < 10:
print(n)
else:
x = n // 10
basenum = x * x + 8
addnum = 0
# print("{0} {1}".format(x* 10 + 1, n))
hassame = False
for i in range(x * 10 + 1, n + 1):
# print(i)
for j in range(1, n + 1):
# print(j)
if str(i... | p02792 |
N=int(eval(input()))
C=[[0]*9 for i in range(9)]
count=0
for n in range(1,N+1):
if str(n)[-1]!="0":
left=int(str(n)[0])-1
right=int(str(n)[-1])-1
C[left][right]+=1
for i in range(1,10):
for j in range(1,10):
count+=C[i-1][j-1]*C[j-1][i-1]
print(count) | from sys import stdin
def main():
#入力
readline=stdin.readline
N=int(readline())
d=dict()
for i in range(1,N+1):
i=str(i)
head=i[0]
tail=i[-1]
if tail=="0":
continue
if (head,tail) not in d:
d[(head,tail)]=1
else:
... | p02792 |
import math
def makelist(n, m):
return [[0 for _ in range(m)] for _ in range(n)]
N = int(eval(input()))
sN = str(N)
l = len(sN)
ans = 0
for n in range(1, min(10, N+1)):
sn = str(n)
ans += 1
cnt = 1
for i in range(2, l):
ans += cnt
cnt *= 10
if l == 2:
... | import math
def makelist(n, m):
return [[0 for _ in range(m)] for _ in range(n)]
N = int(eval(input()))
dp = makelist(10, 10)
for n in range(1, N+1):
s = str(n)
dp[int(s[-1])][int(s[0])] += 1
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += dp[a][b] * dp[b][a]
p... | p02792 |
N = int(eval(input()))
mat = list()
for i in range(10):
mat.append([0] * 10)
for i in range(N):
A = int(str(i + 1)[0])
B = int(str(i + 1)[-1])
mat[A][B] += 1
ans = 0
for i in range(N):
A = int(str(i + 1)[0])
B = int(str(i + 1)[-1])
ans += mat[B][A]
print(ans)
| N = int(eval(input()))
mat = list()
for i in range(10):
mat.append([0] * 10)
for i in range(N):
A = int(str(i + 1)[0])
B = int(str(i + 1)[-1])
mat[A][B] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += mat[i][j] * mat[j][i]
print(ans)
| p02792 |
n = int(eval(input()))
table = [[0 for _ in range(9)] for _ in range(9)]
for i in range(1, n+1):
s = str(i)
f, l = s[0], s[-1]
if "0" in [f, l]: continue
table[int(f)-1][int(l)-1] += 1
ans = 0
for i in range(9):
for j in range(9):
ans += table[i][j] * table[j][i]
print(ans)
| n = int(eval(input()))
t = [[0] * 10 for _ in range(10)]
for i in range(1, n+1):
si = str(i)
t[int(si[0])][int(si[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += t[i][j] * t[j][i]
print(ans)
| p02792 |
N = int(eval(input()))
ans = 0
ary = [0]*100
for n in range(1, N+1):
s = str(n)
ary[int(s[0])*10+int(s[-1])] += 1
for i in range(10, 100):
s = str(i)
j = int(s[-1])*10+int(s[0])
ans += ary[i]*ary[j]
print(ans)
| N = int(eval(input()))
A = [[0]*10 for _ in range(10)]
ans = 0
for i in range(1, N+1):
s = str(i)
A[int(s[0])][int(s[-1])] += 1
for i in range(1, 10):
for j in range(1, 10):
ans += A[i][j]*A[j][i]
print(ans)
| p02792 |
import itertools
N = int(eval(input()))
Nketa = len(str(N))
range_count = [[0 for j in range(10)]for i in range(10)]
for p in range(1,N+1):
mae = int(str(p)[0])
ato = int(str(p)[-1])
range_count[mae][ato] += 1
count = 0
for j in range(1,N+1):
a_mae = int(str(j)[0])
a_ato =... | n = int(eval(input()))
all_count = 0
options = [str(i) for i in range(10)]
maeato = [[0 for i in range(10)] for j in range(10)]
for i in range(n+1):
checking = str(i)
maeato[int(checking[0])][int(checking[-1])]+=1
all_count = 0
for i in range(1,10):
for j in range(1,10):
for k in ran... | p02792 |
n = int(eval(input()))
m = len(str(n))
ans = 0
for i in range(n + 1):
A = str(i)
first = A[0]
end = A[-1]
if end == '0':
continue
if first == end:
ans += 1
if m >= 3:
for j in range(m - 2):
ans += 10 ** (j)
mini = int(end + '0' * ... | n=int(eval(input()))
l=[[0]*10 for i in range(10)]
for i in range(n):
t=str(i+1)
l[int(t[0])][int(t[-1])]+=1
a=0
for i in range(10):
for j in range(10):
a+=l[i][j]*l[j][i]
print(a) | p02792 |
N = int(eval(input()))
digit = len(str(N))
ans = 0
for a in range(1, 10):
for b in range(1, 10):
x, y = 0, 0
if a == b:
if a <= N:
x += 1
y += 1
if a*10+b <= N:
x += 1
if b*10+a <= N:
y += 1
... | N = int(eval(input()))
C = [[0] * 10 for i in range(10)]
for n in range(1, N+1):
i = int(str(n)[0])
j = int(str(n)[-1])
C[i][j] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += C[i][j]*C[j][i]
print(ans)
| p02792 |
c=[10*[0]for _ in range(10)]
n=int(eval(input()))
for i in range(1,n+1):
a=int(str(i)[0])
b=int(str(i)[-1])
c[a][b]+=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(eval(input()))
d=[10*[0]for _ in range(10)]
for i in range(1,n+1):d[int(str(i)[0])][int(str(i)[-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) | p02792 |
n = int(eval(input()))
dp = [[0] * 10 for _ in range(10)]
ans = 0
for i in range(1, n+1):
top = int(str(i)[0])
end = int(str(i)[-1])
ans += 2 * dp[end][top]
if top == end:
ans += 1
dp[top][end] += 1
print(ans) | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
dp = [[0] * 10 for _ in range(10)]
ans = 0
for i in range(1, N + 1):
s = str(i)
first = int(s[0])
second = int(s[-1])
... | p02792 |
N = int(eval(input()))
N_ = str(N)
f_N, l_N = int(N_[0]), int(N_[-1])
digit = len(N_)
if digit > 2:
inter_N = int(N_[1:digit-1])
cnt = 0
for num in range(1, N+1):
num = str(num)
f, l = int(num[-1]), int(num[0])
if f == 0:
continue
for i in range(1, digit+1):
if i == 1:
... | N = int(eval(input()))
cnt = [[0] * 10 for i in range(10)]
for n in range(1, N + 1):
cnt[int(str(n)[0])][int(str(n)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += cnt[i][j] * cnt[j][i]
print(ans) | p02792 |
N = int(eval(input()))
c = [[0 for i in range(9)] for i in range(9)]
for i in range(9):
for j in range(9):
for n in range(1, N+1):
if (n % 10) == j+1 and int(str(n)[0]) == i+1:
c[i][j] += 1
ans = 0
for i in range(9):
for j in range(9):
ans = ans + c[i][j]*c[j][i]
print... | N = int(eval(input()))
c = [[0 for i in range(10)] for i in range(10)]
for n in range(1, N+1):
i = int(str(n)[0])
j = n % 10
c[i][j] += 1
ans = 0
for i in range(10):
for j in range(10):
ans = ans + c[i][j]*c[j][i]
print(ans) | p02792 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left,... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left,... | p02792 |
n = int(eval(input()))
cnt = 0
for i in range(1, n+1):
i_str = str(i)
if len(i_str) == 1:
cnt += 1
continue
if len(i_str) == 2:
if int(i_str[0]) == int(i_str[1]):
cnt += 3
elif int(i_str[1]) != 0 and int(i_str[0]) > int(i_str[1]):
cnt += 2... | n = int(eval(input()))
c = [[0 for _ in range(10)] for __ in range(10)]
for i in range(1, n+1):
str_i = str(i)
head = int(str_i[0])
tail = int(str_i[-1])
c[head][tail] += 1
cnt = 0
for i in range(10):
for j in range(10):
cnt += c[i][j] * c[j][i]
print(cnt) | p02792 |
n = int(eval(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... | n = int(eval(input()))
dp = [[0]*10 for i in range(10)]
su = 0
for i in range(1,n+1):
a,b = str(i)[0],str(i)[-1]
dp[int(a)-1][int(b)-1] += 1
for i in range(10):
for j in range(10):
su += dp[i][j]*dp[j][i]
print(su) | p02792 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
impo... | p02792 |
def main():
N = int(eval(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(1, 10):
for j in range(1, 10):
ans += c[i][j]*c[j][i]
print(ans)
if __name__ == '__main_... | def main():
N = int(eval(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(1, 10):
for j in range(1, 10):
# if c[i][j]*c[j][i]:
# print(i, j, c[i][j]*c[j][i])... | p02792 |
def main():
N = int(eval(input()))
d = {}
for i in range(0,10):
for j in range(0,10):
d[i*10+j] = 0
for i in range(N+1):
s = str(i)
d[int(s[0])*10+int(s[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
... | def main():
N = int(eval(input()))
d = [0] * 100
for i in range(N+1):
s = str(i)
d[int(s[0])*10+int(s[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += d[i*10+j] *d[j*10+i]
print(ans)
if __name__ == '__main__':
... | p02792 |
n = int(eval(input()))
cnt = 0
ls = []
"""
def chk(a,b):
if a[len(a)-1] == '0' or b[len(b)-1] == '0':
return 0
elif a[0] == b[len(b)-1] and a[len(a)-1] == b[0] and a == b:
return 1
elif a[0] == b[len(b)-1] and a[len(a)-1] == b[0]:
return 2
else:
return 0
"""
... | n = int(eval(input()))
cnt = 0
ls = []
"""
def chk(a,b):
if a[len(a)-1] == '0' or b[len(b)-1] == '0':
return 0
elif a[0] == b[len(b)-1] and a[len(a)-1] == b[0] and a == b:
return 1
elif a[0] == b[len(b)-1] and a[len(a)-1] == b[0]:
return 2
else:
return 0
"""
... | p02792 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | from collections import Counter
N = int(eval(input()))
c = Counter()
for i in range(1, N+1):
a = str(i)
c[(a[0], a[-1])] += 1
ans = 0
for k, v in list(c.items()):
ans += v*c[(k[1], k[0])]
print(ans) | p02792 |
import sys
import collections
import bisect
def main():
n = int(eval(input()))
a = [str(i + 1)[0] + str(i + 1)[-1] for i in range(n)]
b = [str(i + 1)[-1] + str(i + 1)[0] for i in range(n)]
ac, bc = collections.Counter(a), collections.Counter(b)
print((sum(ac[i] * bc[i] for i in list(ac.k... | import sys
import collections
import bisect
def main():
n = int(eval(input()))
ac, bc = collections.Counter([str(i + 1)[0] + str(i + 1)[-1] for i in range(
n)]), collections.Counter([str(i + 1)[-1] + str(i + 1)[0] for i in range(n)])
print((sum(ac[i] * bc[i] for i in list(ac.keys()))))
... | p02792 |
def main():
N = int(eval(input()))
# ある数値nについて、n[0]..n[-1]とすると
# 1~n-1の中のある数値mに対して、n[0]==m[-1]&&n[-1]==m[0]となるようなmがいくつ存在するか調べたい
# n:1...3 -> m:3...1かつlen(n)>len(m)を満たすもの*2
# n:3...1 -> m:1...3かつlen(n)>=len(m)を満たすもの*2
# n:1...1 -> m:1...1かつlen(n)>=len(m)を満たすもの*2
# 下のパターンで、n[0]==n[-1]のと... | def main():
N = int(eval(input()))
# cnt[a][b] := 先頭がa,末尾がqである数の個数
cnt = [[0]*10 for i in range(10)]
for i in range(1,N+1):
s = str(i)
cnt[int(s[0])][int(s[-1])] += 1
ans = 0
for a in range(10):
for b in range(10):
ans += cnt[a][b]*cnt[b][a]
pri... | p02792 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def keta(n):
return len(str(n))
def make(n, l, r):
ans = 0
sn = str(n)
for i in range(5):
if keta(n) > 2+i:
ans += 10 ** i
elif keta(n) == 2 + i... | import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
from collections import defaultdict
def main():
n = int(input().strip())
d = defaultdict(int)
for i in range(1, n+1):
ds = str(i)
d[(ds[0], ds[-1])] += 1
ans =... | p02792 |
n = int(eval(input()))
book = [[0] * 9 for i in range(9)]
ans = 0
for i in range(1, n+1) :
reverse = 0
tmp = i
time = 0
flag = False
end = -1
while(tmp!=0) :
remind = tmp % 10
if time == 0 :
if remind == 0 :
flag = True
... | n = int(eval(input()))
book = [[0] * 9 for i in range(9)]
ans = 0
for i in range(1, n+1) :
pre = int(str(i)[0])
end = int(str(i)[-1])
if end != 0 :
book[pre-1][end-1] += 1
for i in range(9) :
for j in range(i, 9) :
if i == j :
ans += book[i][j] * book[j][i]... | p02792 |
N = int(eval(input()))
N_list = [str(i) for i in range(1, N + 1)]
nums = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']
count = 0
for i in nums:
for j in nums:
cij, cji = 0, 0
for k in N_list:
if k[0] == i and k[-1] == j:
cij += 1
if k[0] == j ... | N = int(eval(input()))
Cij = [0] * 100
for i in range(1, N + 1):
Cij[int(str(i)[0] + str(i)[-1])] += 1
count = 0
for i in range(10):
for j in range(10):
count += Cij[i * 10 + j] * Cij[j * 10 + i]
print(count) | p02792 |
from itertools import product
N = int(eval(input()))
N_ =str(N)
n_o=len(N_)
# ans:条件を満たす組みの個数
ans=0
def get_ans(A):
ans=0
A_=str(A)
a_s=A_[0]
a_e=A_[-1]
# print(a_s,a_e)
if int(a_e) == 0:
return 0
if a_s == a_e:
ans+=1
for b_o in range(2,n_... | N = int(eval(input()))
C=[[0]*10 for _ in range(10)]
for n in range(1,N+1):
n=str(n)
n_s=int(n[0])
n_e=int(n[-1])
C[n_s][n_e]+=1
ans=0
for c_1 in range(10):
for c_2 in range(10):
ans += C[c_1][c_2]*C[c_2][c_1]
print(ans) | 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(eval(input()))
ans1=0
ans2=0
for i in range(1,n+1):
a=int(str(i)[0])
... | import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
li=[[0]*10 for i in range(10)]
n=int(eval(input()))
for i in range(1,n+1):
i=str(i)
li[int(i[0])][int(i[-1])]+=1
ans=0... | p02792 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
dic = {}
for i in range(1, N+1):
tmp = str(i)
s, e = int(tmp[0]), int(tmp[-1])
if (s, e) in dic:
dic[(s, e)] += 1
else:
dic[(s, e)] = 1
ans = 0
for (i... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
dic = {}
for i in range(10):
for j in range(10):
dic[(i, j)] = 0
for i in range(1, N+1):
tmp = str(i)
s, e = int(tmp[0]), int(tmp[-1])
dic[(s, e)] += 1
ans = 0
for ... | p02792 |
N=int(eval(input()))
c_list = []
for i in range(10):
temp_list = []
for j in range(10):
temp_count = 0
for n in range(1, N+1):
if n%10==j and n//(10**(len(str(n))-1) )==i:
temp_count += 1
temp_list.append(temp_count)
c_list.append(temp_list)
s... | N=int(eval(input()))
N_digit = len(str(N))
if N_digit==1:
print(N)
exit()
N_head = N//(10**(N_digit-1))
N_tail = N%10
count = 0
for A in range(1, N+1):
A_digit = len(str(A))
A_head = A//(10**(A_digit-1))
A_tail = A%10
if A_tail==0:
continue
if A_head==A_tail... | p02792 |
n = int(eval(input()))
ans = 0
numbers = [[0] * 10 for _ in range(10)]
for i in range(1, n+1):
ss = str(i)
numbers[int(ss[0])][int(ss[-1])] += 1
for j in range(1, n+1):
ss = str(j)
ans += numbers[int(ss[-1])][int(ss[0])]
print(ans)
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
res = 0
numbers = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
ss = str(i)
numbers[int(ss[0])][int(ss[-1])] += 1... | p02792 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
cnt = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
head = int(str(i)[0])
tale = int(str(i)[-1])
cnt[head][ta... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
cnt = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
i = str(i)
head = int(i[0])
foot = int(i[-1])
cn... | p02792 |
S=eval(input())
TT=[[0]*10 for _ in range(10)]
N=int(S)
for i in range(1,N+1):
ii=str(i)
a=int(ii[0])
b=int(ii[-1])
TT[a][b]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=TT[i][j]*TT[j][i]
print(ans) | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
def ht(x):
t=x%10
string=str(x)
h=int(string[0])
retu... | p02792 |
N= int(eval(input()))
lead_N = int(str(N)[0])
end_N = int(str(N)[len(str(N)) - 1])
ans = 0
#print(str(100)[len(str(100)) - 1])
for i in range(1, N + 1):
lead = int(str(i)[0])
end = int(str(i)[len(str(i)) - 1])
# 一桁
if lead == end:
ans += 1
#2桁以上ループ lead + 中間 + end
for j in range((len(str(N... | N= int(eval(input()))
lead_N = int(str(N)[0])
end_N = int(str(N)[-1])
ans = 0
for i in range(1, N + 1):
lead = int(str(i)[0])
end = int(str(i)[-1])
# 一桁
if lead == end:
ans += 1
#2桁以上ループ lead + 中間 + end
for j in range((len(str(N)) - 2) + 1):
if end == 0 or (end > lead_N and j == (len(s... | p02792 |
def II(): return int(eval(input()))
N=II()
tbl=[0]*101
for i in range(1,N+1):
i=str(i)
tbl[int(str(i[0]+i[-1]))]+=1
ans=0
for i in range(1,N+1):
i=str(i)
ans+=tbl[int(str(i[-1]+i[0]))]
print(ans)
| def II(): return int(eval(input()))
N=II()
tbl=[0]*101
for i in range(1,N+1):
i=str(i)
tbl[int(i[0]+i[-1])]+=1
ans=0
for i in range(1,N+1):
i=str(i)
ans+=tbl[int(i[-1]+i[0])]
print(ans)
| p02792 |
def II(): return int(eval(input()))
N=II()
tbl=[0]*101
for i in range(1,N+1):
i=str(i)
tbl[int(i[0]+i[-1])]+=1
ans=0
for i in range(1,N+1):
i=str(i)
ans+=tbl[int(i[-1]+i[0])]
print(ans)
| def II(): return int(eval(input()))
N=II()
def solve(n):
tbl=[0]*100
ans=0
for i in range(1,n+1):
i=str(i)
tbl[int(i[0]+i[-1])]+=1
for i in range(1,n+1):
i=str(i)
ans+=tbl[int(i[-1]+i[0])]
return ans
a=solve(N)
print(a) | p02792 |
from collections import defaultdict
N = int(eval(input()))
def fl(x):
f = 0
l = x % 10
while x != 0:
f = x
x = x // 10
return (f, l)
d = defaultdict(int)
for i in range(1, N+1):
d[fl(i)] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += d[... | from collections import defaultdict
N = int(eval(input()))
def pair(n):
l = n % 10
while n != 0:
f = n
n = n // 10
return (f, l)
d = defaultdict(int)
for i in range(1, N + 1):
d[pair(i)] += 1
ans = 0
for key, value in list(d.items()):
tmp1 = value
l, f = k... | p02792 |
from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readline
def check(min_, max_, x):
if max_ <= x:
return 10**max(0, len(str(min_))-2)
elif min_ <= x:
ret = max(1, int(str(x)[1:-1]) if len(... | from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readline
def check(min_, max_, x):
if max_ <= x:
# return 10**max(0, len(str(min_))-2)
return int((max_ - min_)/10) + 1
elif min_ <= x:
... | p02792 |
from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readline
def check(min_, max_, x):
if max_ <= x:
# return 10**max(0, len(str(min_))-2)
return int((max_ - min_)/10) + 1
elif min_ <= x:
... | from sys import stdin
input = stdin.readline
def check(min_, max_, x):
if x < min_:
return 0
else:
return int((min(max_, x) - min_)/10) + 1
def main():
N = int(eval(input()))
if len(str(N)) == 1:
print(N)
return
sum_ = 0
for l in range(1, 10):
for r in range(l, 10... | p02792 |
n=int(eval(input()))
count=[[0 for i in range(10)] for j in range(9)]
ans=0
for i in range(1,n+1):
num=list(str(i))
l,r=eval(num[0]),eval(num[-1])
#print(str(l)+" "+str(r))
#print(l+r)
count[l-1][r]+=1
#print(count)
for i in range(1,10):
for j in range(1,10):
if i==j:
... | n=int(eval(input()))
count=[[0 for i in range(10)] for j in range(9)]
ans=0
num=1
zero=0
for i in range(1,n+1):
if (10**(zero+1))<=num:
zero+=1
a=i//10
r=i-a*10
l=i//(10**zero)
count[l-1][r]+=1
num+=1
#print(count)
for i in range(1,10):
for j in range(1,10):
i... | p02792 |
n = int(eval(input()))
ab = {}
for i in range(1, n+1):
t = str(i)
if (t[0], t[-1]) in ab:
ab[(t[0], t[-1])] += 1
else:
ab[(t[0], t[-1])] = 1
#print(ab)
ans = 0
for i in range(1, n+1):
t = str(i)
if (t[-1], t[0]) in ab:
ans += ab[(t[-1], t[0])]
print(ans)
| from collections import defaultdict
n = int(eval(input()))
counter = defaultdict(int)
for i in range(1, n+1):
t = str(i)
counter[(t[0], t[-1])] += 1
ans = 0
for i in range(1, n+1):
t = str(i)
ans += counter[(t[-1], t[0])]
print(ans)
| p02792 |
n = int(eval(input()))
c=[[0]*10 for i in range(10)]
for k in range(1,n+1):
k=str(k)
i=int(k[0])
j=int(k[-1])
c[i][j]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=c[i][j]*c[j][i]
print(ans) | MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)
def main():
N = int(eval(input()))
presuf = [[0] * 10 for _ in range(10)]
for i in range(1,N + 1):
pre = int(str(i)[0])
suf = i%10
presuf[pre][suf] += 1
ans = 0
for i in range(10)... | p02792 |
from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 7)
@lru_cache(maxsize=None)
def check(l, r, n, k=1):
t = l + '0' * k + r
e = l + '9' * k + r
if int(e) <= n:
return pow(10, k) + check(l, r, n, k + 1)
if int(t) <= n < int(e):
x = int(str(n)[1:-1])... | # 解説放送
def main():
from collections import defaultdict
n = int(eval(input()))
d = defaultdict(int)
for x in range(1, n + 1):
if x % 10 == 0:
continue
tail = x % 10
head = 0
while x:
head = x
x //= 10
d[hea... | p02792 |
n=int(eval(input()))
ans=0
dic={}
for i in range(1,n+1):
s=str(i)
d=(s[0],s[-1])
if d not in list(dic.keys()):
dic[d] = 1
else:
dic[d] += 1
for a in list(dic.keys()):
b = (a[1],a[0])
if b in list(dic.keys()):
ans += dic[a]*dic[(a[1],a[0])]
print(ans) | n=int(eval(input()))
ans=0
Dic={}
for i in range(1,n+1):
s=str(i)
d=(s[0],s[-1])
if d in list(Dic.keys()):
Dic[d]+=1
else:
Dic[d]=1
for a in list(Dic.keys()):
b=(a[1],a[0])
if b in list(Dic.keys()):
ans+=Dic[a]*Dic[b]
print(ans)
| p02792 |
n=int(eval(input()))
D={}
for i in range(1,n+1):
s=(str(i)[0],str(i)[-1])
if s not 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(eval(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)
| p02792 |
n=int(eval(input()))
D={}
DD={}
for i in range(1,n+1):
s=(str(i)[0],str(i)[-1])
t=(str(i)[-1],str(i)[0])
if s not in D:
D[s]=1
else:
D[s]+=1
if t not in DD:
DD[t]=1
else:
DD[t]+=1
ans=0
for i in D:
if i in DD:
ans+=D[i]*DD[i]
print(ans)
| n=int(eval(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 aj,bj in D:
if (bj,aj) in D:
ans+=D[(aj,bj)]*D[(bj,aj)]
print(ans) | p02792 |
N = int(eval(input()))
mem = [[0]*10 for _ in range(10)]
for i in range(1,N+1):
a = int(str(i)[0])
b = int(str(i)[-1])
mem[a][b] += 1
ans = 0
for i in range(1,N+1):
a = int(str(i)[0])
b = int(str(i)[-1])
ans += mem[b][a]
print(ans)
| N = int(eval(input()))
mem=[[0] * 10 for _ in range(10)]
for i in range(1, N+1):
s = str(i)
mem[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += mem[i][j] * mem[j][i]
print(ans) | p02792 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_c... | #!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_c... | p02792 |
import sys
from collections import deque
from heapq import heapify, heappop, heappush
from itertools import combinations, permutations
from bisect import bisect, bisect_left
def solve():
input = sys.stdin.readline
N = int(eval(input()))
strN = str(N)
maxDig = len(strN)
count = 0
for... | import sys
def solve():
N = int(eval(input()))
D = dict()
for i in range(1, N + 1):
front = i % 10
back = i
while back >= 10: back //= 10
if front > 0:
if (front, back) in D: D[(front, back)] += 1
else: D[(front, back)] = 1
Ans = 0
... | p02792 |
import sys
def solve():
N = int(eval(input()))
D = dict()
for i in range(1, N + 1):
front = i % 10
back = i
while back >= 10: back //= 10
if front > 0:
if (front, back) in D: D[(front, back)] += 1
else: D[(front, back)] = 1
Ans = 0
... | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
dictType = dict()
for i in range(1, 10):
for j in range(1, 10): dictType[(i, j)] = 0
for i in range(1, N + 1):
bottom = i % 10
if bottom == 0: continue
top = i
while top >= ... | p02792 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
keta = len(str(N))
if keta == 1:
print(N)
sys.exit()
ans = {}
for i in [1,2,3,4,5,6,7,8,9]:
for j in [1,2,3,4,5,6,7,8,9]:
ans[(i, j)] = 0
for i in range(1, N+1):
maxdigit = int(str(i)[0])
mindigit = int(str(i)[-1])
... | import sys
input = sys.stdin.readline
n = int(eval(input()))
from collections import defaultdict
d = defaultdict(int) # d[(a, b)] : 先頭a, 末尾b
for i in range(1, n + 1):
i_str = str(i)
d[(i_str[0], i_str[-1])] += 1
ans = 0
for i in range(1, 10):
for j in range(10):
ans += d[(str(... | p02792 |
n = int(eval(input()))
t = [[0 for j in range(10)] for i in range(10)]
for i in range(1,n+1):
s = str(i)
t[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += t[i][j]*t[j][i]
print(ans) | n = int(eval(input()))
c = [[0 for j in range(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(1,10):
for j in range(1,10):
ans += c[i][j]*c[j][i]
print(ans) | p02792 |
n=int(eval(input()))
a=[[0]*10 for i in range(10)]
for i in range(1,n+1):
a[int(str(i)[0])][i%10]+=1
def N(x,y): # no of x...y < n
return a[x][y]
ans=0
for x in range(1,10):
ans+=N(x,x)*N(x,x)
for y in range(x+1,10):
ans+=N(x,y)*N(y,x)*2
print(ans) | n=int(eval(input()))
a=[[0]*10 for i in range(10)]
for i in range(1,n+1):
a[int(str(i)[0])][i%10]+=1
ans=0
for x in range(1,10):
ans+=a[x][x]**2
for y in range(x+1,10):
ans+=a[y][x]*a[x][y]*2
print(ans) | p02792 |
mod = 1e9+7
def add(a, b):
c = a + b
if c >= mod:
c -= mod
return c
def main():
m = {}
N = int(input())
for i in range(1, N+1):
s = str(i)
first = s[0]
last = s[-1]
key = first + last
m[key] = m.get(key, 0) + 1
ans ... | mod = 1e9+7
def add(a, b):
c = a + b
if c >= mod:
c -= mod
return c
def main():
m = {}
N = int(input())
for i in range(1, N+1):
s = str(i)
first = s[0]
last = s[-1]
key = first + last
m[key] = m.get(key, 0) + 1
ans ... | p02792 |
from collections import defaultdict
def main():
N = int(eval(input()))
combs = [(S[0], S[-1]) for S in map(str, list(range(1, N+1)))]
d = defaultdict(int)
for pre, suf in combs:
if suf != "0":
d[(pre, suf)] += 1
d[(suf, pre)]
ans = 0
for key, val in ... | from collections import defaultdict
def main():
N = int(eval(input()))
combs = [(S[0], S[-1]) for S in map(str, list(range(1, N+1)))]
d = defaultdict(int)
for pre, suf in combs:
d[(pre, suf)] += 1
d[(suf, pre)]
ans = 0
for key, val in list(d.items()):
pre, s... | p02792 |
d=[0]*100
for i in range(int(eval(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)))) | d=[0]*100
for i in range(int(eval(input()))):s=str(i+1);d[int(s[0]+s[-1])]+=1
print((sum(d[i]*d[i%10*10+i//10]for i in range(100)))) | p02792 |
N = int(eval(input()))
li = [[0 for j in range(9)] for i in range(9)]
for i in range(1,N+1):
start = str(i)[0]
end = str(i)[-1]
if start != '0' and end != '0':
li[int(start)-1][int(end)-1] += 1
ans = 0
for i in range(1,N+1):
start = str(i)[0]
end = str(i)[-1]
if start !=... | n = int(eval(input()))
a = [[0 for i in range(10)] for j in range(10)]
for i in range(1,n+1):
s = str(i)
a[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += a[i][j]*a[j][i]
print(ans)
| p02792 |
N = int(eval(input()))
mem = [[0]*10 for i in range(10)]
for i in range(1,N+1):
a = int(str(i)[0])
b = int(str(i)[-1])
mem[a][b] += 1
ans = 0
for i in range(1,N+1):
a = int(str(i)[0])
b = int(str(i)[-1])
ans += mem[b][a]
print(ans) | N = int(eval(input()))
d = [[0]*10 for i in range(10)]
for n in range(1,N+1):
s = str(n)
d[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += d[i][j] * d[j][i]
print(ans) | p02792 |
N = int(eval(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(eval(input()))
dp = [[0]*10 for _ in range(10)]
for n in range(1,N+1):
s = str(n)
dp[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += dp[i][j] * dp[j][i]
print(ans) | p02792 |
#python3
from collections import defaultdict
from collections import namedtuple
P = namedtuple('P', ['front', 'end'])
def f(x):
return P(str(x)[0], str(x)[-1])
def main():
n = int(eval(input()))
freq = defaultdict(int)
for i in range(1, n+1):
p = f(i)
freq[p]+=1
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import defaultdict
def f(x):
return (int(str(x)[0]), int(str(x)[-1]))
def main():
N = int(readline())
df = defaultdict(int)
for i in range(1, N+1):
... | p02792 |
n=int(eval(input()))
lists=[[ [] for j in range(10)]for i in range(10)]
for i in range(1,n+1):
a=str(i)
lists[int(str(a[0]))][int(str(a[-1]))].append(i)
c=0
for i in range(1,10):
for j in range(1,10):
c+=len(lists[i][j])*len(lists[j][i])
print(c)
| n=int(eval(input()))
lists=[[ 0 for j in range(10)]for i in range(10)]
for i in range(1,n+1):
a=str(i)
lists[int(a[0])][int(a[-1])]+=1
c=0
for i in range(1,10):
for j in range(1,10):
c+=lists[i][j]*lists[j][i]
print(c)
| p02792 |
N=int(eval(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)
| N=int(eval(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) | p02792 |
n = int(eval(input()))
ans=0
for i in range(1,n+1):
a=str(i)[0]
b=str(i)[-1]
for digit in range(1,7):
if digit == 1:
if a==b:
ans+=1
elif b!='0':
mn = int(b+'0'*(digit-2)+a)
mx = int(b+'9'*(digit-2)+a)
if mn>n:
... | n = int(eval(input()))
ans=0
mp=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
a=int(str(i)[0])
b=int(str(i)[-1])
mp[a][b]+=1
for i in range(10):
for j in range(10):
ans+=mp[i][j]*mp[j][i]
print(ans)
| p02792 |
n = int(eval(input()))
c = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
p = int(str(i)[0])
q = int(str(i)[-1])
c[p][q] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i][j] * c[j][i]
print(ans) | n = int(eval(input()))
C = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
C[int(str(i)[0])][i % 10] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += C[i][j] * C[j][i]
print(ans) | p02792 |
from collections import defaultdict
N = int(eval(input()))
ans = 0
c = defaultdict(int)
for i in range(1, N+1):
s = int(str(i)[0])
t = int(str(i)[-1])
if s != 0 and t != 0:
c[(s, t)] += 1
for i in range(1, 10):
for j in range(1, 10):
ans += c[(i, j)] * c[(j, i)]
print(ans)
| from collections import defaultdict
N = int(eval(input()))
d = defaultdict(int)
for i in range(1, N+1):
s, t = str(i)[0], str(i)[-1]
if s != 0 and t != 0:
if s > t:
s, t = s, t
d[(s, t)] += 1
ans = 0
for i in range(1, 11):
for j in range(1, 11):
i = str(i)
j = str(j)
... | p02792 |
# !/usr/bin/python3
"""
https://atcoder.jp/contests/abc152/tasks/abc152_d
Low Elements.
"""
def solve(n):
res = 0
for num in range(n+1):
start = int(str(num)[0])
end = int(str(num)[-1])
for i in range(10):
for j in range(10):
if i == start ... | # !/usr/bin/python3
"""
https://atcoder.jp/contests/abc152/tasks/abc152_d
Low Elements.
"""
def solve(n):
res = 0
for num in range(n+1):
start = int(str(num)[0])
end = int(str(num)[-1])
for i in range(1, 10):
for j in range(1, 10):
if i == ... | p02792 |
n = int(eval(input()))
letters_mapping = {num: {num2:[] for num2 in range(10)} for num in range(10)}
for num in range(1, n + 1):
first_letter = str(num)[0]
last_letter = str(num)[-1]
letters_mapping[int(first_letter)][int(last_letter)].append(num)
count = 0
for i, v in list(letters_mapping.items(... | n = int(eval(input()))
a = [[0 for i in range(10)] for j in range(10)]
for i in range(1, n+1):
s = str(i)
if s[-1] != '0':
a[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += a[i][j] * a[j][i]
print(ans) | p02792 |
N = int(eval(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
... | #https://atcoder.jp/contests/abc152/submissions/9607915
N = int(eval(input()))
lis = [[0]*10 for _ in range(10)]
for i in range(1,N+1):
s = str(i)
lis[int(s[0])][int(s[-1])] += 1
ans = 0
#A,Bになりうる数字の数をカウントして掛け算
for i in range(10):
for j in range(10):
ans += lis[i][j]*lis[j][i]
print... | p02792 |
n=int(eval(input()))
A=[[0 for i in range(9)] for j in range(9)]
for i in range(1,n+1):
if i%10!=0:
num=str(i)
A[int(num[0])-1][int(num[-1])-1] +=1
cnt=0
for i in range(9):
for j in range(9):
cnt +=A[i][j]*A[j][i]
print(cnt) | n=int(eval(input()))
A=[[0 for i in range(10)] for j in range(10)]
for i in range(1,n+1):
num=str(i)
A[int(num[0])][int(num[-1])] +=1
ans=0
for i in range(1,10):
for j in range(1,10):
ans +=A[i][j]*A[j][i]
print(ans) | p02792 |
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n=n0()
length=len(str(n))
ans=0
for i in range(1,10):
if n<i:
break
s=0
f... | def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n=n0()
length=len(str(n))
ans=0
for i in range(1,10):
if n<i:
break
s=0
f... | p02792 |
N = int(eval(input()))
number = [[0]*10 for i in range(10)]
for i in range(1, N+1):
s = str(i)
id1 = int(s[0])
id2 = int(s[-1])
number[id1][id2] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += number[i][j]*number[j][i]
print(ans)
| n = int(eval(input()))
Number = [[0]*10 for l in range(10)]
for i in range(1,n+1):
s = str(i)
j = int(s[0])
k = int(s[-1])
Number[j][k] += 1
count = 0
for i in range(10):
for j in range(10):
count += Number[i][j] *Number[j][i]
print(count) | p02792 |
N=int(eval(input()))
from collections import defaultdict
dic=defaultdict(int)
for i in range(1,N+1):
n=str(i)
dic[(int(n[0]),int(n[-1]))]+=1
ans=0
for i in range(1,10):
for j in range(1,10):
ans+=dic[(i,j)]*dic[(j,i)]
print(ans) | from collections import defaultdict as d
dic=d(int)
for i in range(1,int(eval(input()))+1):
dic[(int(str(i)[0]),i%10)]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=dic[(i,j)]*dic[(j,i)]
print(ans) | p02792 |
n = int(eval(input()))
dp = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
s = str(i)
x = int(s[0])
y = int(s[-1])
dp[x][y] += 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(eval(input()))
dp = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
s = str(i)
dp[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += dp[i][j] * dp[j][i]
print(ans) | p02792 |
#!/usr/bin/env python3
import sys
import math
INF = float("inf")
def solve(N: int):
debug = False
SN = str(N)
keta = int(math.log10(N)+1)
count = 0
for i in range(1, N+1):
first = str(i)[0]
last = str(i)[-1]
if last == "0": # 考えない
contin... | #!/usr/bin/env python3
import sys
import math
INF = float("inf")
def solve(N: int):
table = [[0]*10 for _ in range(10)]
for i in range(1, N+1):
first = int(str(i)[0])
last = int(str(i)[-1])
table[first][last] += 1
count = 0
for i in range(10):
for j in... | p02792 |
from collections import defaultdict
d = defaultdict(int)
n = int(eval(input()))
for i in range(1, n+1):
start = str(i)[0]
end = str(i)[-1]
d[(start, end)] += 1
L = list(d.items())
ans = 0
for (start, end), i in L:
ans += i * d[(end, start)]
print(ans) | from collections import defaultdict
#索引数
d = defaultdict(int)
n = int(eval(input()))
#数え上げ
for i in range(1, n+1):
start = str(i)[0]
end = str(i)[-1]
d[(start, end)] += 1
#リスト化
L = list(d.items())
ans = 0
for (start, end), i in L:
ans += i * d[(end, start)]
print(ans) | p02792 |
def main():
N = int(eval(input()))
freq = {}
for i in range(1, N+1):
pair = str(i)[0] + str(i)[-1]
if pair in list(freq.keys()):
freq[pair] += 1
else:
freq[pair] = 1
ans = 0
for i in range(1, N+1):
pair_rev = str(i)[-1] + str(i... | def main():
N = int(eval(input()))
freq = {}
for i in range(1, N+1):
pair = str(i)[0] + str(i)[-1]
freq.setdefault(pair, 0)
freq[pair] += 1
ans = 0
for i in range(1, N+1):
pair_rev = str(i)[-1] + str(i)[0]
if pair_rev in list(freq.keys()):
... | p02792 |
def main():
N = int(eval(input()))
freq = {}
for i in range(1, N+1):
pair = str(i)[0] + str(i)[-1]
freq.setdefault(pair, 0)
freq[pair] += 1
ans = 0
for i in range(1, N+1):
pair_rev = str(i)[-1] + str(i)[0]
if pair_rev in list(freq.keys()):
... | def main():
N = int(eval(input()))
freq = {}
for i in range(1, N+1):
pair = str(i)[0] + str(i)[-1]
freq.setdefault(pair, 0)
freq[pair] += 1
ans = 0
freq_keys = list(freq.keys())
for i in range(1, N+1):
pair_rev = str(i)[-1] + str(i)[0]
i... | p02792 |
# ABC 152 D
si = lambda: eval(input())
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
snm = lambda: list(map(str, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
c=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
sl=str(i)
sl_s=int(sl[0])
sl... | n=int(eval(input()))
c=[[0]*10 for i in range(10)]
for a in range(1,n+1):
a=str(a)
c[int(a[-1])][int(a[0])]+=1
ans=0
for i in range(1,10):
for j in range(1,10):
ans+=c[i][j]*c[j][i]
print(ans)
| p02792 |
n=int(eval(input()))
v=[0]*100
ans=0
for i in range(1,n+1):
x=int(str(i)[0])
y=int(str(i)[-1])
v[x*10+y]+=1
for i in range(len(v)):
x=int(str(i)[0])
y=int(str(i)[-1])
ans+=v[i]*v[10*y+x]
print(ans) | n=int(eval(input()))
x=[0]*101
ans=0
for i in range(1,n+1):
v=str(i)
w=int(v[0]+v[-1])
x[w]+=1
for i in range(101):
if x[i]!=0:
v=str(i)
w=int(v[-1]+v[0])
ans+=x[i]*x[w]
print(ans) | p02792 |
N = int(eval(input()))
D = {i: [0] for i in range(100)}
for i in range(1, N+1):
if i % 10 != 0:
s = str(i)
D[int(s[0])*10+int(s[-1])][0] += 1
D[int(s[0])*10+int(s[-1])].append(i)
S = 0
for i in range(10):
for j in range(10):
S += D[i*10+j][0] * D[j*10+i][0]
print(S) | N = int(eval(input()))
D = {i: 0 for i in range(100)}
for i in range(1, N+1):
if i % 10 != 0:
s = str(i)
D[int(s[0])*10+int(s[-1])] += 1
S = 0
for i in range(10):
for j in range(10):
S += D[i*10+j] * D[j*10+i]
print(S) | p02792 |
from sys import stdin
n = int(stdin.readline().rstrip())
li = [[0 for i in range(10)]for j in range(10)]
for k in range(1,n+1):
atama = int(str(k)[0])
ushiro = int(str(k)[-1])
li[atama][ushiro] += 1
point = 0
for l in range(1,10):
for m in range(1,10):
point += li[l][m]*li[m]... | from collections import defaultdict
n = int(eval(input()))
dic = defaultdict(int)
for i in range(1,n+1):
s = str(i)
dic[int(s[0]),int(s[-1])] += 1
point = 0
for i in range(1,10):
for j in range(1,10):
point += dic[i,j]*dic[j,i]
print(point) | p02792 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.