input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import itertools
N,X,Y=list(map(int, input().split()))
l=list(range(1,N+1))
for k in range(1, N):
cnt=0
for p in itertools.combinations(l, 2):
a=p[1]-p[0]
b=abs(p[1]-Y)+abs(p[0]-X)+1
if k==min(a,b):cnt+=1
print(cnt) | import itertools
N,X,Y=list(map(int, input().split()))
l=list(range(1,N+1))
cnt=[0]*(N-1)
for p in itertools.combinations(l, 2):
a=p[1]-p[0]
b=abs(p[1]-Y)+abs(p[0]-X)+1
cnt[min(a,b)-1]+=1
for k in cnt:
print(k) | p02726 |
import itertools
N,X,Y=list(map(int, input().split()))
l=list(range(1,N+1))
cnt=[0]*(N-1)
for p in itertools.combinations(l, 2):
a=p[1]-p[0]
b=abs(p[1]-Y)+abs(p[0]-X)+1
cnt[min(a,b)-1]+=1
for k in cnt:
print(k) | N,X,Y=list(map(int, input().split()))
ans=[0]*(N-1)
for i in range(1,N):
for j in range(i+1, N+1):
ans[min(j-i, abs(j-Y)+abs(i-X)+1)-1]+=1
for a in ans:
print(a) | p02726 |
n,x,y=list(map(int,input().split()))
ans=[0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
dist1=j-i
dist2=abs(x-i)+abs(y-j)+1
dist3=abs(y-i)+abs(x-j)+1
d=min(dist1,dist2,dist3)
ans[d]+=1
for i in range(1,n):
print((ans[i])) | N,X,Y = list(map(int, input().split()))
cnt = [0]*N
for i in range(1,N+1):
for j in range(i+1,N+1):
if abs(X-i)+abs(j-Y)+1 < j-i:
cnt[abs(X-i)+abs(j-Y)+1] += 1
else:
cnt[j-i] += 1
for i in range(1,N):
print((int(cnt[i])))
| p02726 |
n,x,y = list(map(int,input().split()))
def largest(a,b,c):
if a <= b:
if a<= c:
return a
else:
return c
else:
if b<=c:
return b
else:
return c
def absol(d):
if d < 0:
return -d
else:
return d
def dist(i,j):
return largest(j-i, abs... | n,x,y = list(map(int,input().split()))
def dist(i,j):
return min(j-i, abs(x-i) + abs(y-j) + 1, abs(x-j) + abs(y-i) + 1)
listlist = [0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
distance = dist(i,j)
listlist[distance-1] = listlist[distance-1] + 1
for k in listlist:
print(k)
| p02726 |
from collections import defaultdict
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
d = defaultdict(int)
for i in range(n-1):
for j in range(i+1, n):
path = min([j-i, abs(x-i)+abs(y-j)+1, abs(x-j)+abs(y-i)+1])
d[path] += 1
for i in range(1, n):
print((d[i]))
| from collections import defaultdict
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
d = defaultdict(int)
for i in range(n-1):
for j in range(i+1, n):
path = min(j-i, abs(x-i)+abs(y-j)+1)
d[path] += 1
for i in range(1, n):
print((d[i]))
| p02726 |
N,X,Y = (int(i) for i in input().split())
NUM = [0] * (N-1)
for i in range(1,N):
for j in range(i+1,N+1):
num = min(abs(i-j), abs(X-i)+1+abs(Y-j), abs(Y-i) + 1 + abs(X-j))
if (num < N):
NUM[num-1] += 1
for i in range(len(NUM)):
print((NUM[i]))
| def main():
n, x, y = (int(i) for i in input().split())
num_list = [0] * (n - 1)
for i in range(1, n):
for j in range(i + 1, n + 1):
num = min(abs(i - j), abs(x - i) + 1 + abs(y - j), abs(y - i) + 1 + abs(x - j))
if (num < n):
num_list[num - 1] += 1
... | p02726 |
N, X, Y = list(map(int, input().split()))
for k in range(1,N):
ans = 0
for i in range(1,N):
for j in range(i,N+1):
min_dis = min((j-i), abs(X-i)+1+abs(j-Y))
if min_dis == k:
ans += 1
print(ans)
| N, X, Y = list(map(int, input().split()))
memo = [0] *(N)
for i in range(1, N):
for j in range(i, N + 1):
min_dis = min((j - i), abs(X - i) + 1 + abs(j - Y))
memo[min_dis] += 1
for k in range(1,N):
print((memo[k]))
| p02726 |
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
n,X,Y = list(map(int,input().split()))
d = [[float("inf")]*n for i in range(n)]
#d[u][v] : 辺uvのコスト(存在しないときはi... | N,X,Y = list(map(int,input().split()))
X -= 1
Y -= 1
ans = [0]*(N)
d = [[N]*N for i in range(N)]
for i in range(N):
for j in range(i,N):
if i<=X and Y<=j:
d[i][j] = X-i+j-Y+1
else:
d[i][j] = min(abs(i-X)+abs(Y-j)+1,j-i)
for i in range(N):
for j in ... | p02726 |
n,x,y = list(map(int,input().split()))
ko = [0 for i in range(10**4)]
for i in range(1,n):
for j in range(i+1,n+1):
c1 = j-i
if i<=x and y<=j:
c2 = (x-i)+1+(j-y)
elif i<=x and j<y:
c2 = (x-i)+1+(y-j)
elif x<i and y<=j:
c2 = (i-x)+1+(j-y)
else:
c2 = (i-x)+1+(y-j)... | n,x,y = list(map(int,input().split()))
ko = [0 for i in range(10**4)]
for i in range(1,n):
for j in range(i+1,n+1):
c1 = j-i
c2 = abs(x-i)+1+abs(y-j)
ko[min(c1,c2)] += 1
# print(i,j,j-i,c1,c2,ko[:10])
for i in range(1,n):
print((ko[i])) | p02726 |
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
if __name__ == '__main__':
n,x,y = list(map(int, input().split()))
costList = [0]*n
for i in range(1, n):
for j in range(... | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
if __name__ == '__main__':
n,x,y = list(map(int, input().split()))
costList = [0]*n
for i in range(1, n):
for j in range(... | p02726 |
n,x,y = list(map(int,input().split()))
k = [0]*(n)
for i in range(1,n):
for j in range(i+1,n+1):
if i < x and j <= x:
k[j-i] += 1
elif i >= y and j > y:
k[j-i] += 1
elif x <= i < y and x< j <= y:
ind = min(j-i,i-x+y-j+1)
k[ind] += 1
elif i < x and x < j <= y:
... | n,x,y = list(map(int,input().split()))
k = [0]*(n)
for i in range(1,n):
for j in range(i+1,n+1):
ind = min(j-i,abs(x-i) + abs(j-y) + 1)
k[ind] += 1
for i in range(1,n):
print((k[i])) | p02726 |
# -*- 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 functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
... | # -*- 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
... | p02726 |
# -*- 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 decimal
... | p02726 |
n , x , y = list(map(int,input().split()))
p = [[0 for i in range(j+1)] for j in range(n)]
for i in range(1,n+1):
for j in range(1,i+1):
p[i-1][j-1] = min(abs(i-j),abs(i-x)+1+abs(j-y),abs(j-x)+1+abs(i-y))
for i in range(1,n):
ans = 0
for j in range(n):
ans += p[j].count(i)
pri... | n , x , y = list(map(int,input().split()))
p = [0 for i in range(n)]
for i in range(1,n+1):
for j in range(1,i+1):
p[min(abs(i-j),abs(i-x)+1+abs(j-y),abs(j-x)+1+abs(i-y))] += 1
for i in range(1,n):
print((p[i])) | p02726 |
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,x,y = [int(i) for i in readline().split()]
INF = 1001001001
from collections import deque
def push(v,d):
if dist[v] != INF:
return
dist[v] = d
q.append(v)
x -= 1
y -= 1
ans = [0]*n
for sv in range(n):
... | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,x,y = [int(i) for i in readline().split()]
ans = [0] * n
for a in range(1, n+1):
for b in range(a+1, n+1):
d = b - a
d2 = abs(x-a) + abs(y-b) + 1
d = d if d < d2 else d2
ans[d] += 1
for i in rang... | p02726 |
def dijkstra(s,n,w,cost):
#始点sから各頂点への最短距離
#n:頂点数, w:辺の数, cost[u][v] : 辺uvのコスト(存在しないときはinf)
d = [float("inf")] * n
used = [False] * n
d[s] = 0
while True:
v = -1
#まだ使われてない頂点の中から最小の距離のものを探す
for i in range(n):
if (not used[i]) and (v == -1):
... | n, x, y = map(int, input().split())
ans = [0 for _ in range(n-1)]
for i in range(1, n):
for j in range(i+1, n+1):
d = min(j-i, abs(x-i) + abs(y-j) + 1)
ans[d-1] += 1
print(*ans, sep='\n')
| p02726 |
N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
nallpath = N*(N-1)//2
distance = [0] * nallpath
indx = 0
for j in range(N-1):
for i in range(j+1,N):
if i <= X:
distance[indx] = i - j
elif j >= Y:
distance[indx] = i - j
elif j <= X and Y<= i:
... | N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
npath = [0] * (N-1)
indx = 0
for j in range(N-1):
for i in range(j+1,N):
if i <= X:
distance = i - j
elif j >= Y:
distance = i - j
elif j <= X and Y<= i:
distance = i - j - (Y-X-1)
... | p02726 |
def main():
from collections import deque
N, X, Y = (int(i) for i in input().split())
X -= 1
Y -= 1
edge = [[] for _ in range(N)]
for i in range(N-1):
edge[i].append(i+1)
edge[i+1].append(i)
edge[X].append(Y)
edge[Y].append(X)
def bfs(s):
d = [-1... | def main():
N, X, Y = (int(i) for i in input().split())
cnt = [0]*N
for i in range(1, N+1):
for j in range(i+1, N+1):
d = min(abs(i-j), abs(i-X)+1+abs(j-Y), abs(i-X)+abs(X-Y)+abs(j-Y))
cnt[d] += 1
for d in cnt[1:]:
print(d)
if __name__ == '__main__':
... | p02726 |
from collections import defaultdict
N, X, Y = list(map(int, input().split()))
X -= 1; Y -= 1
pat = defaultdict(int)
for i in range(N):
for j in range(i+1, N):
d = min([abs(i-j), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X)])
pat[d] += 1
for i in range(1, N):
print((pat[i])) |
N, X, Y = list(map(int, input().split()))
X -= 1; Y -= 1
pat = [0]*(N-1)
for i in range(N):
for j in range(i+1, N):
d = min(abs(i-j), abs(X-i)+1+abs(j-Y))
pat[d-1] += 1
for i in range(N-1):
print((pat[i])) | p02726 |
# coding: utf-8
import collections
# 標準入力 <int><int>
N, X, Y = list(map(int, input().split()))
br = []
for i in range(N - 1):
for j in range(i + 1, N):
br.append(min(j - i, abs(X - (i + 1)) + 1 + abs(Y - (j + 1)), abs(Y - (i + 1)) + 1 + abs(X - (j + 1))))
c = collections.Counter(br)
for k, v ... | # coding: utf-8
import collections
# 標準入力 <int><int>
N, X, Y = list(map(int, input().split()))
br = []
for i in range(N - 1):
for j in range(i + 1, N):
"""
#print("(" , i+1, j+1, ")", j-i, abs(X - (i + 1)) + 1 + abs(Y - (j + 1)), abs(Y - (i + 1)) + 1 + abs(X - (j + 1)))
"""
br.append... | p02726 |
n,x,y=list(map(int,input().split()))
#a<b
def dis(a,b):
return min (b-a,abs(a-x)+1+abs(b-y))
for k in range(1,n):
count=0
#i<j
for i in range(1,n):
for j in range(i+1,n+1):
if dis(i,j)==k:
count+=1
print(count) | n,x,y=map(int,input().split())
#a<b
def dis(a,b):
return min (b-a,abs(a-x)+1+abs(b-y))
# for k in range(1,n):
# count=0
# #i<j
# for i in range(1,n):
# for j in range(i+1,n+1):
# if dis(i,j)==k:
# count+=1
# print(count)
ans=[0]*(n-1)
#i<j
for i in range(1,n):
for j in r... | p02726 |
n,x,y=map(int,input().split())
#a<b
def dis(a,b):
return min (b-a,abs(a-x)+1+abs(b-y))
# for k in range(1,n):
# count=0
# #i<j
# for i in range(1,n):
# for j in range(i+1,n+1):
# if dis(i,j)==k:
# count+=1
# print(count)
ans=[0]*(n-1)
#i<j
for i in range(1,n):
for j in r... | n,x,y=list(map(int,input().split()))
#a<b
def dis(a,b):
return min (b-a,abs(a-x)+1+abs(b-y))
# for k in range(1,n):
# count=0
# #i<j
# for i in range(1,n):
# for j in range(i+1,n+1):
# if dis(i,j)==k:
# count+=1
# print(count)
ans=[0]*(n-1)
#i<j
for i in range(1,n):
for ... | p02726 |
N, X, Y = list(map(int, input().split()))
dp = [[N+10] * N for i in range(N)]
for i in range(N-1):
dp[i][i+1] = 1
for i in range(1, N):
dp[i][i-1] = 1
dp[X-1][Y-1] = 1
dp[Y-1][X-1] = 1
for k in range(N):
for i in range(N):
for j in range(N):
dp[i][j] = min(dp[i][j], dp... | N, X, Y = list(map(int, input().split()))
mind = [[N] * N for i in range(N)]
for i in range(N):
for j in range(i+1, N):
mind[i][j] = min(abs(j-i), abs((X-1)-i)+1+abs(j-(Y-1)), abs((Y-1)-i)+1+abs(j-(X-1)))
mindcnt = [0] * N
for i in range(N):
for j in range(i+1, N):
d = mind[i][... | p02726 |
N, X, Y = list(map(int, input().split()))
dic = {}
def Warshall_Floyd(N):
for k in range(N):
for i in range(N):
for j in range(N):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
d = [[float("inf")] * N for i in range(N)]
for i in range(N-1):
d[i][i... | N, X, Y = list(map(int, input().split()))
d = {}
for i in range(1, N):
for j in range(i+1, N+1):
m = min(j-i, abs(X-i) + 1 + abs(Y-j))
if d.get(m) is None:
d[m] = 1
else:
d[m] += 1
for i in range(1, N):
if d.get(i) is None:
print((0))
... | p02726 |
N, X, Y = list(map(int, input().split()))
dist_list = []*N
for i in range(N):
for j in range(i+1, N):
a = j - i
b = abs(i+1 - X) + abs(j+1 -Y) + 1
if a > b:
dist_list.append(b)
else:
dist_list.append(a)
for k in range(N-1):
print((dist_list.... | N, X, Y = list(map(int, input().split()))
dist_list = [0]*N
for i in range(N-1):
for j in range(i+1, N):
a = j - i
b = abs(i+1 - X) + abs(j+1 -Y) + 1
dist_list[min(a,b)] += 1
for k in range(N-1):
print((dist_list[k+1]))
| p02726 |
N, X, Y = list(map(int, input().split()))
dist = [0]*N
for i in range(N):
for k in range(i,N):
if i == X - 1 and k == Y - 1:
dist[1] += 1
continue
if X - 1 <= k <= Y - 1 and i <= X - 1:
tmp = min(k-i,(X-1)-i+1+(Y-1-k))
dist[tmp] += 1
... | N, X, Y = list(map(int, input().split()))
dist = [0]*N
for i in range(N):
for k in range(i+1,N):
if i == X - 1 and k == Y - 1:
dist[1] += 1
continue
if X - 1 <= k <= Y - 1 and i <= X - 1:
tmp = min(k-i,(X-1)-i+1+(Y-1-k))
dist[tmp] += 1
... | p02726 |
N,X,Y = list(map(int,input().split()))
D = [[0 for i in range(N)] for j in range(N)]
for i in range(N):
for j in range(i,N):
D[i][j] = j-i
D[X-1][Y-1] = 1
for i in range(N):
for j in range(i,N):
c,d = max(i,X-1),min(i,X-1)
e,f = max(Y-1,j),min(j,Y-1)
a = min(D[i][j],D[d... | N,X,Y = list(map(int,input().split()))
D = [[0 for i in range(N)] for j in range(N)]
for i in range(N):
for j in range(i+1,N):
D[i][j] = j-i
D[X-1][Y-1] = 1
A = [0]*(N-1)
for i in range(N):
for j in range(i+1,N):
c,d = max(i,X-1),min(i,X-1)
e,f = max(Y-1,j),min(j,Y-1)
... | p02726 |
import collections
N, X, Y = list(map(int, input().split()))
x = X-1
y = Y-1
dist = dict()
for i in range(N-1):
for j in range(i+1, N):
dist_ = min(abs(j-i), abs(x-i) + 1 + abs(j-y), abs(y-i) +1 + abs(j - x))
dist[i, j] = dist_
out = collections.Counter(list(dist.values()))
for i in ra... | N, X, Y = list(map(int, input().split()))
x = X-1
y = Y-1
dist = [0] * N
for i in range(N-1):
for j in range(i+1, N):
dist_ = min(abs(j-i), abs(x-i) + 1 + abs(j-y), abs(y-i) +1 + abs(j - x))
dist[dist_] += 1
for i in range(N-1):
print((dist[i+1]))
| p02726 |
N, X, Y = list(map(int, input().split(' ')))
X -= 1
Y -= 1
dist_map = {}
def search(origin):
dist = []
# X, Yの辺がない場合
for i in range(N):
dist.append(abs(origin - i))
# X, Yの辺がある場合
if dist[X] < dist[Y]:
dist[Y] = dist[X] + 1
elif dist[Y] < dist[X]:
dist[X] = dist[Y] + 1
for i in ... | N, X, Y = list(map(int, input().split(' ')))
X -= 1
Y -= 1
dist_map = {}
def search(origin):
dist = []
# X, Yの辺がない場合
for i in range(N):
dist.append(abs(origin - i))
# X, Yの辺がある場合
if dist[X] < dist[Y]:
dist[Y] = dist[X] + 1
elif dist[Y] < dist[X]:
dist[X] = dist[Y] + 1
for i in ... | p02726 |
N,X,Y = list(map(int,input().split()))
li = [0]*(N-1)
for i in range(0,N-1):
for j in range(i+1,N):
dis = min(j-i,abs(j-(X-1))+1+abs(i-(Y-1)),abs(i-(X-1))+1+abs(j-(Y-1)))
li[dis-1] += 1
for ans in li:
print(ans) | N,X,Y = list(map(int,input().split()))
li = [0]*(N-1)
for i in range(0,N-1):
for j in range(i+1,N):
dis = min(j-i,abs(i-(X-1))+1+abs(j-(Y-1)))
li[dis-1] += 1
for ans in li:
print(ans) | p02726 |
N,X,Y = list(map(int,input().split(' ')))
ls = {}
for i in range(1,N):
for j in range(i+1,N+1):
l = min(abs(j-i),abs(i-X)+1+abs(j-Y),abs(i-Y)+1+abs(j-X))
if l not in list(ls.keys()):
ls[l] = 1
else:
ls[l] = ls[l] + 1
for i,(k,v) in enumerate(sorted(list(ls.items()),key=lambda x:x[0])):
print(v... | N,X,Y = list(map(int,input().split(' ')))
ls = [0 for i in range(N-1)]
for i in range(1,N):
for j in range(i+1,N+1):
l = min(j-i,abs(i-X)+1+abs(j-Y))
ls[l-1] = ls[l-1] + 1
for i in range(N-1):
print((ls[i])) | p02726 |
from collections import deque
if __name__ == '__main__':
n, x, y = list(map(int, input().split()))
ans = [0] * (n+1)
g = [[i+1, i-1] for i in range(n+1)]
g[0].clear()
g[1].pop(1)
g[n].pop(0)
g[x].append(y)
g[y].append(x)
for i in range(1,n+1):
q = deque... | from collections import deque
n, x, y = list(map(int, input().split()))
ans = [0] * (n+1)
g = [[i+1, i-1] for i in range(n+1)]
#g[0].clear() pypyにclearなし
g[1].pop(1)
g[n].pop(0)
g[x].append(y)
g[y].append(x)
for i in range(1,n+1):
q = deque()
time = 0
visit = [False] * (n+1)
q.app... | p02726 |
def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
answer = [0 for i in range(N+1)]
for i in range(0, N):
for j in range(i+1, N):
answer[min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))] += 1
for i in range(1, N):
print((answer[i... | def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
answer = [0 for i in range(N+1)]
for i in range(0, N):
for j in range(i+1, N):
answer[min(abs(j-i), abs(X-i)+1+abs(j-Y))] += 1
for i in range(1, N):
print((answer[i]))
if __name__ ... | p02726 |
N,X,Y=list(map(int,input().split()))
L=[]
for i in range(1,N):
for j in range(i+1,N+1):
l=min(j-i,abs(X-i)+1+abs(j-Y),abs(Y-i)+1+abs(j-X))
L.append(l)
for i in range(1,N):
print((L.count(i))) | N,X,Y=list(map(int,input().split()))
L=[0]*(N)
for i in range(1,N):
for j in range(i+1,N+1):
l=min(j-i,abs(X-i)+1+abs(j-Y))
L[l]+=1
for i in range(1,N):
print((L[i])) | p02726 |
from collections import deque
def bfs(start, end):
Q = deque()
Q.append(start)
dist[start] = 0
while Q:
v = Q.popleft()
for nv in G[v]:
if dist[nv] != -1:
continue
Q.append(nv)
dist[nv] = dist[v] + 1
if... | N,X,Y=list(map(int,input().split()))
ans=[0 for i in range(1,N)]
for i in range(1,N):
for j in range(i+1,N+1):
k=min(abs(j-i),abs(X-i)+1+abs(Y-j),abs(Y-i)+1+abs(X-j))
ans[k-1]+=1
for i in ans:
print(i) | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n):
for j in range(i + 1, n + 1):
if i < x:
if j < x:
d = j - i
elif x <= j <= y:
d = min(j - i, y - j + x - i + 1)
else:
d = j - y + x - ... | n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n):
for j in range(i + 1, n + 1):
ans[min(j - i, abs(i - x) + abs(j - y) + 1)] += 1
print(('\n'.join(map(str, ans[1:]))))
| p02726 |
N,X,Y = list(map(int,input().split()))
Alist = [[0 for i in range(N)] for j in range(N)]
for i in range(N):
for j in range(i,N):
Alist[i][j] = j-i
Alist[X-1][Y-1] = 1
for i in range(N):
for j in range(i,N):
Alist[i][j] = min(Alist[i][j],abs(X-1-i)+abs(Y-1-j)+1)
p = [0 for i in range(N)]... | N,X,Y = list(map(int,input().split()))
Alist = [[0 for i in range(N)] for j in range(N)]
p = [0 for i in range(N)]
for i in range(N):
for j in range(i,N):
k = min(j-i,abs(X-1-i)+abs(Y-1-j)+1)
p[k] = p[k] + 1
for s in range(1,N):
print((p[s])) | p02726 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
n,x,y = i_l()
x -= 1
y -= 1
a = []
for i in range(n):
for j in range(i+1, n):
a.append(min(abs(i-j), abs(x-i)... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
n,x,y = i_l()
x -= 1
y -= 1
a = [0]*n
for i in range(n):
for j in range(i+1, n):
b = min(abs(i-j), abs(x-i)+1... | p02726 |
import collections
import heapq
class Dijkstra():
def __init__(self):
self.e = collections.defaultdict(list)
def add(self, u, v, d, directed=False):
"""
#0-indexedでなくてもよいことに注意
#u = from, v = to, d = cost
#directed = Trueなら、有向グラフである
"""
if ... | n, x, y = list(map(int,input().split()))
ans = [0] * (n+10)
for i in range(1, n+1):
for j in range(i+1, n+1):
distance = min(abs(j-i), abs(x-i) + 1 + abs(y-j), abs(y-i) + 1 + abs(x-j))
ans[distance] += 1
for i in range(1, n):
print((ans[i])) | p02726 |
N, X, Y = list(map(int, input().split()))
t = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
t[min(j - i, abs(X - i) + 1 + abs(Y - j)) - 1] += 1
print(('\n'.join(map(str, t))))
| N, X, Y = list(map(int, input().split()))
t = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
t[min(j - i, abs(X - i) + 1 + abs(Y - j)) - 1] += 1
print(('\n'.join(map(str, t))))
#print(*result, sep='\n')
| p02726 |
n,x,y=[int(j) for j in input().split()]
l=[[0]*n for i in range(n)]
ans=[0]*n
x-=1
y-=1
s=y-x-1
for i in range(n):
for j in range(n):
if i<j:
ans[min(j-i,abs(i-x)+abs(j-y)+1,)]+=1
print(('\n'.join(map(str,ans[1:]))))
| n,x,y=[int(j) for j in input().split()]
ans=[0]*n
for i in range(1,1+n):
for j in range(i+1,1+n):
t=min(j-i,abs(x-i)+abs(y-j)+1)
ans[t]+=1
print(('\n'.join(map(str,ans[1:])))) | p02726 |
N, X, Y = list(map(int, input().split(' ')))
res = [0] * (N)
for i in range(N):
for j in range(i+1, N):
dist = min(abs(i - j), abs(i - X + 1) + 1 + abs(j - Y + 1), abs(i-Y+1) + 1 + abs(j-X+1))
res[dist] += 1
for i in range(1, N):
print((res[i]))
| N, X, Y = list(map(int, input().split(' ')))
res = [0] * (N)
for i in range(N):
for j in range(i+1, N):
dist = min(abs(i - j), abs(i - X + 1) + 1 + abs(j - Y + 1))
res[dist] += 1
for i in range(1, N):
print((res[i]))
| p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0] * n
for i in range(n):
for j in range(i+1, n):
if i <= x and y <= j:
dist = j - i - (y - x) + 1
else:
dist = min(j - i, abs(i-x) + abs(j-y) + 1)
ans[dist] += 1
for i in range(1,n):
... | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0] * n
for i in range(n):
for j in range(i+1, n):
dist = min(j - i, abs(i-x) + abs(j-y) + 1)
ans[dist] += 1
for i in range(1,n):
print((ans[i]))
| p02726 |
N, X, Y = list(map(int, input().split()))
ans = [0] * (N - 1)
for i in range(N):
for j in range(i + 1, N):
dist = min(abs(i - j), abs((X - 1) - i) + abs((Y - 1) - j) + 1, abs((Y - 1) - i) + abs((X - 1) - j) + 1)
ans[dist - 1] += 1
# print("i:{}, j:{}, dist:{}".format(i, j, dist))
fo... | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans = [0] * (N - 1)
for i in range(N):
for j in range(i + 1, N):
dist = min(abs(i - j), abs(X - i) + abs(Y - j) + 1, abs(Y - i) + abs(X - j) + 1)
ans[dist - 1] += 1
# print("i:{}, j:{}, dist:{}".format(i, j, dist))
for k in... | p02726 |
from collections import Counter
N,X,Y = list(map(int, input().split()))
X -= 1
Y -= 1
L = []
for i in range(N-1):
for j in range(i+1,N):
L.append(min(abs(i-j),abs(X-i)+abs(Y-j)+1,abs(Y-i)+abs(X-j)+1))
D = Counter(L)
for k in range(1,N):
print((D[k])) | N,X,Y = map(int, input().split())
D = [0] * N
for i in range(1,N):
for j in range(i+1,N+1):
D[min(abs(i-j),abs(X-i)+abs(Y-j)+1,abs(Y-i)+abs(X-j)+1)] += 1
print (*D[1:], sep="\n")
| p02726 |
N,X,Y = map(int, input().split())
D = [0] * N
for i in range(1,N):
for j in range(i+1,N+1):
D[min(abs(i-j),abs(X-i)+abs(Y-j)+1,abs(Y-i)+abs(X-j)+1)] += 1
print (*D[1:], sep="\n")
| N,X,Y = map(int, input().split())
D = [0] * N
for i in range(1,N):
for j in range(i+1,N+1):
D[min(abs(i-j),abs(X-i)+abs(Y-j)+1)] += 1
print (*D[1:], sep="\n")
| p02726 |
N, X, Y = list(map(int, input().split()))
ans = [0] * (N - 1)
for i in range(1, N + 1, 1):
for j in range(i + 1, N + 1, 1):
tmp = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(X - j) + 1 + abs(i - Y) # このパターンは
)
ans[tmp - 1] += 1
for a ... | N, X, Y = list(map(int, input().split()))
ans = [0] * (N - 1)
for i in range(1, N + 1, 1):
for j in range(i + 1, N + 1, 1):
tmp = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y)
)
ans[tmp - 1] += 1
for a in ans:
print(a) | p02726 |
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):... | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):... | p02726 |
# coding: utf-8
N, X, Y = list(map(int, input().split()))
list = []
for i in range(1,N):
for j in range(i+1,N+1):
list.append(min(j-i, abs(X-i)+1+abs(Y-j)))
for k in range(1,N):
print((list.count(k))) | # coding: utf-8
N, X, Y = list(map(int, input().split()))
ans = [0]*N
for i in range(1,N):
for j in range(i+1,N+1):
l = min(j-i, abs(X-i)+1+abs(Y-j))
ans[l] += 1
for k in range(1,N):
print((ans[k])) | p02726 |
import sys
input = sys.stdin.buffer.readline
from itertools import chain
from collections import Counter
def floyd_warshall(V, dist): # 動的計画法。頂点 k まで経由することが可能な場合の最短距離という部分問題を考えて、k = 0 から漸化式的に計算する
for k in range(V):
for i in range(V):
for j i... | N, X, Y = map(int, input().split())
X -= 1
Y -= 1
dist = [0]*(N-1)
for i in range(N):
for j in range(i+1, N):
dist[min(j-i, abs(X-i) + 1 + abs(Y-j))-1] += 1
print(*dist, sep="\n")
| p02726 |
def main():
import sys
input = sys.stdin.readline
from collections import deque
n,x,y = list(map(int,input().split()))
ans = [0]*(n)
E = [[] for i in range(n)]
E[0].append(1)
E[n-1].append(n-2)
for i in range(1,n-1):
E[i].append(i-1)
E[i].append(i+1)
E... | n,x,y = list(map(int,input().split()))
ans = [0]*(n)
for i in range(1,n):
for j in range(i+1,n+1):
d = min(j-i,abs(x-i)+abs(y-j)+1)
ans[d] += 1
for i in ans[1:]:
print(i) | p02726 |
from heapq import *
from collections import Counter
import itertools
n, x, y = list(map(int,input().split()))
edges = [[] for _ in range(n)]
def dijkstra(s, edges):
d = [float('inf')] * n
d[s] = 0
heap = [(0, s)]
while heap:
c, node = heappop(heap)
for cost, v in edges[n... | from heapq import *
from collections import Counter
import itertools
n, x, y = list(map(int,input().split()))
edges = [[] for _ in range(n)]
def dijkstra(s, edges):
d = [float('inf')] * n
d[s] = 0
heap = [(0, s)]
while heap:
c, node = heappop(heap)
for cost, v in edges[n... | p02726 |
from collections import Counter
def flatten(array):
return [item for sublist in array for item in sublist]
n, x, y = list(map(int, input().split()))
c = [[10**4]*n for i in range(n)]
for i in range(n):
c[i-1][i] = 1
c[i][i-1] = 1
c[-1][0] = 10**4
c[0][-1] = 10**4
c[x-1][y-1] = 1
c[y-1][x-1] ... | #!/usr/bin/env python3
n, x, y = map(int, input().split())
a = abs
d = [0] * n
for i in range(1, n+1):
for j in range(i + 1, n+1):
d[min(j-i, a(x-i)+a(y-j)+1, a(x-j)+a(y-i)+1)] += 1
print(*d[1:], sep="\n")
| p02726 |
from collections import deque
def count_pair(k):
cnt = 0
for i in range(1, N+1):
visited = [-1]*(N+1)
visited[i] = 0
s = 0
q = deque([[i]])
while s != k:
p = []
A = q.popleft()
for a in A:
if a == X and vis... | N, X, Y = list(map(int, input().split()))
t = [0]*N
for i in range(1, N):
for j in range(i+1, N+1):
t[min(j-i, abs(X-i)+1+abs(j-Y))] += 1
for k in range(1, N):
print((t[k])) | p02726 |
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) ... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i ... | p02726 |
#!/usr/bin/python3
(n, x, y) = list(map(int, input().split()))
cs = [0 for i in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(abs(j - i), abs(x - i) + 1 + abs(j - y), abs(y - i) + 1 + abs(j - x))
if d == (abs(y - i) + 1 + abs(j - x)):
print((i, j,... | #!/usr/bin/python3
(n, x, y) = list(map(int, input().split()))
cs = [0 for i in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(abs(j - i), abs(x - i) + 1 + abs(j - y))
cs[d] += 1
for i in range(1, n):
print((cs[i])) | p02726 |
#!/usr/bin/python3
(n, x, y) = list(map(int, input().split()))
cs = [0 for i in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(abs(j - i), abs(x - i) + 1 + abs(j - y))
cs[d] += 1
for i in range(1, n):
print((cs[i])) |
(n, x, y) = list(map(int, input().split()))
cs = [0 for i in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(abs(j - i), abs(x - i) + 1 + abs(j - y))
cs[d] += 1
for i in range(1, n):
print((cs[i])) | p02726 |
from sys import stdin
def main():
n, x, y = map(int, stdin.readline().split())
x -= 1
y -= 1
summary = [0] * (n - 1)
for i in range(n):
for j in range(i + 1, n):
d = min(j - i, abs(i - x) + abs(j - y) + 1, abs(i - y) + abs(j - x) + 1)
summary[d - 1] += ... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, x, y = map(int, input().split())
ans = [0] * (n - 1)
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
d = min(j - i, abs(i - x) + abs(j - y) + 1, abs(i - y) + abs(j - x) + 1)
... | p02726 |
#!/usr/bin/env python3
# coding: utf-8
# import pprint
# import numpy as np
# import code
import functools
def debug(arg):
if __debug__:
pass
else:
import sys
debug = lambda *x: None
print(arg, file=sys.stderr)
n, x, y = (int(x) for x in input().split())
d = dic... | #!/usr/bin/env python3
# coding: utf-8
# import pprint
# import numpy as np
# import code
import functools
if __debug__:
def debug(arg):
pass
else:
import sys
def debug(arg):
debug = lambda *x: None
print(arg, file=sys.stderr)
n, x, y = (int(x) for x in input().spli... | p02726 |
N, X, Y = map(int, input().split())
def dist(fr, to):
return min(
to - fr,
abs(to - Y) + 1 + abs(fr - X),
abs(fr - Y) + 1 + abs(to - X)
)
cnt = [0] * N
ans = 0
for fr in range(1, N + 1):
for to in range(fr + 1, N + 1):
cnt[dist(fr, to)] += 1
print(*(cnt[1:... | N, X, Y = map(int, input().split())
ans = [0] * N
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
d = min(
j - i,
abs(i - X) + 1 + abs(j - Y),
abs(j - X) + 1 + abs(i - Y)
)
ans[d] += 1
print(*ans[1:], sep='\n')
| p02726 |
from collections import Counter
import itertools
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
n, x, y = list(map(int, input().split()))
d = [[float("inf... | from collections import Counter
import itertools
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
n, x, y = list(map(int, input().split()))
d = [[n]*n for i... | p02726 |
from collections import Counter
import itertools
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
n, x, y = list(map(int, input().split()))
d = [[n]*n for i... | import collections
n, x, y = list(map(int, input().split()))
d = [[0]*(i+1) for i in range(n)]
x -= 1
y -= 1
for i in range(n):
for j in range(i+1):
d[i][j] = min(i-j, abs(x-j)+abs(y-i)+1)
L = []
for i in range(n):
for dd in d[i]:
L.append(dd)
C = collections.Counter(L)
for i in ran... | p02726 |
def warshall_floyd(d, n):
for k in range(n):
for i in range(n):
for j in range(n):
if (d[i][k] == 0 or d[k][j] == 0):
continue
if (i == j):
continue
if (d[i][j] == 0):
d[i][j] = d... | n, x, y = list(map(int, input().split()))
result = [0] * n
for i in range(1,n):
for j in range(i+1, n+1):
result[min([(j - i), (abs(i - x) + 1 + abs(j - y))])] += 1
for i in range(1,n):
print((result[i]))
| p02726 |
N,X,Y =list(map(int,input().split()))
count = [0] * (N-1)
for i in range(1,N):
for j in range(i+1,N+1):
dist = min(j-i, abs(X-i)+1+abs(Y-j))
count[dist-1] +=1
for i in range(N-1):
print((count[i])) | N,X,Y =list(map(int,input().split()))
count = [0] * (N-1)
for i in range(1,N):
for j in range(i+1,N+1):
dist = min(j-i, abs(X-i)+1+abs(Y-j))
count[dist-1] +=1
print(("\n".join(map(str,count)))) | p02726 |
# Using BFS
import queue
from collections import defaultdict
import sys
def input():
return sys.stdin.readline()
def push(v, d, dist, q, INF=1e10):
if dist[v] != INF:
return
dist[v] = d
q.put(v)
def main():
n, x, y = list(map(int, input().split()))
# modify the v... | # Using BFS
from collections import defaultdict, deque
import sys
def input():
return sys.stdin.readline()
def push(v, d, dist, q, INF=1e10):
if dist[v] != INF:
return
dist[v] = d
q.append(v)
def main():
n, x, y = list(map(int, input().split()))
# modify the value... | p02726 |
N, X, Y = list(map(int, input().split()))
dist = [[0 for _ in range(N)] for _ in range(N)]
ans = [0 for _ in range(N)]
for i in range(N):
for j in range(i, N):
tmp1 = abs(i - X + 1) + abs(j - Y + 1) + 1
tmp2 = abs(i - Y + 1) + abs(j - X + 1) + 1
min_dist = min(abs(i - j), tmp1, tm... | N, X, Y = list(map(int, input().split()))
ans = [0 for _ in range(N)]
for i in range(N):
for j in range(i+1, N):
tmp1 = abs(i - X + 1) + abs(j - Y + 1) + 1
tmp2 = abs(i - Y + 1) + abs(j - X + 1) + 1
min_dist = min(abs(i - j), tmp1, tmp2)
ans[min_dist - 1] += 1
for i i... | p02726 |
n,x,y=list(map(int,input().split()))
num=[0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
d=int(min(j-i,abs(x-j-1)+1+abs(y-1-i),abs(y-1-j)+1+abs(x-1-i)))
num[d-1]+=1
for i in range(n-1):
print((num[i])) | n,x,y=list(map(int,input().split()))
ans=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
ans[int(min(j-i,abs(x-i)+abs(y-j)+1))]+=1
for i in range(1,n):
print((ans[i])) | p02726 |
# -*- coding: utf-8 -*-
# D - Line++
# 標準入力の取得
N,X,Y = list(map(int, input().split()))
# 求解
# (i, j)間の最短距離はmin{|j-i|, |X-i|+1+|j-Y|, |Y-i|+1+|j-X|}であるため、
# (i, j)が決まれば、最短距離はO(1)で決まる。したがって、全(i, j)について、最短距離を求める。
k_list = [0 for i in range(1,N)]
for i in range(1, N):
for j in range(i+1, N+1):
min_p... | # -*- coding: utf-8 -*-
# D - Line++
# 標準入力の取得
N,X,Y = list(map(int, input().split()))
# 求解
# (i, j)間の最短距離はmin{|j-i|, |X-i|+1+|j-Y|, |Y-i|+1+|j-X|}であるため、
# (i, j)が決まれば、最短距離はO(1)で決まる。したがって、全(i, j)について、最短距離を求める。
k_list = [0 for i in range(1,N)]
for i in range(1, N):
diff_X_i = abs(X - i)
diff_Y_i = ab... | p02726 |
# -*- coding: utf-8 -*-
# D - Line++
# 標準入力の取得
N,X,Y = list(map(int, input().split()))
# 求解
# (i, j)間の最短距離はmin{|j-i|, |X-i|+1+|j-Y|, |Y-i|+1+|j-X|}であるため、
# (i, j)が決まれば、最短距離はO(1)で決まる。したがって、全(i, j)について、最短距離を求める。
k_list = [0 for i in range(1,N)]
for i in range(1, N):
diff_X_i = abs(X - i)
diff_Y_i = ab... | # -*- coding: utf-8 -*-
# D - Line++
# 標準入力の取得
N,X,Y = list(map(int, input().split()))
# 求解
# (i, j)間の最短距離はmin{|j-i|, |X-i|+1+|j-Y|}であるため、
# (i, j)が決まれば、最短距離はO(1)で決まる。したがって、全(i, j)について、最短距離を求める。
k_list = [0 for i in range(1,N)]
for i in range(1, N):
for j in range(i+1, N+1):
min_path = min([abs(... | p02726 |
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append... | p02726 |
# -*- coding: utf-8 -*-
N, X, Y = map(int, input().split())
mid = (X + Y + 1) * 0.5
# GUCHOKU
ans = [0] * N
for i in range(1, N):
for j in range(i, N + 1):
# (i, j)について距離を調べる
# if j >= mid:
# dis = X - i + 1 + abs(j - Y)
# else:
# j - i
dis... | # -*- coding: utf-8 -*-
N, X, Y = map(int, input().split())
mid = (X + Y + 1) * 0.5
# GUCHOKU
ans = [0] * N
for i in range(1, N):
for j in range(i, N + 1):
dis = min(abs(i - X) + abs(j - Y) + 1, j - i)
ans[dis] += 1
print(*ans[1:], sep='\n')
| p02726 |
import collections
def main():
N,X,Y = list(map(int, input().split()))
# 扱いやすいようにX,Yはインデックス表記にしておく
X -= 1
Y -= 1
# i<jを満たす(i,j)について6通りの場合分けして全最短距離を求められる
shortest = [[-1]*N for _ in range(N)]
for i in range(N):
k1 = abs(X-i)
for j in range(i+1,N):
k2 = a... | import collections
def main():
N,X,Y = list(map(int, input().split()))
# 扱いやすいようにX,Yはインデックス表記にしておく
X -= 1
Y -= 1
# i<jを満たす(i,j)について6通りの場合分けして全最短距離を求められる
shortest = [[-1]*N for _ in range(N)]
coll = collections.Counter()
for i in range(N):
k1 = abs(X-i)
for j in... | p02726 |
N, X, Y = [int(n) for n in input().split(' ')]
cnt = [0]*N
for i in range(1, N): # 1~N-1
for j in range(i+1, N+1): # 2~N
p = []
p += [j - i]
if i <= X:
if j >= Y:
p += [X-i + j-Y + 1]
else:
p += [X-i + Y-j + 1]
... | N, X, Y = [int(n) for n in input().split(' ')]
cnt = [0]*N
for i in range(1, N): # 1~N-1
for j in range(i+1, N+1): # 2~N
if i <= X:
if j >= Y:
p = min(X-i + j-Y + 1, j - i)
else:
p = min(X-i + Y-j + 1, j - i)
else:
i... | p02726 |
from collections import Counter
def min_distance(i,j):
return min(abs(i-j),abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))
n,x,y=list(map(int,input().split()))
x=x-1
y=y-1
dp=[]
for i in range(n):
for j in range(n):
dp.append(min_distance(i,j))
dic=Counter(dp)
for i in range(1,n):
... | from collections import Counter
def min_distance(i,j):
return min(abs(i-j),abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))
n,x,y=list(map(int,input().split()))
x=x-1
y=y-1
dp=[]
for i in range(n-1):
for j in range(i+1,n):
dp.append(min_distance(i,j))
dic=Counter(dp)
for i in range(1... | p02726 |
from collections import deque
from collections import Counter
def main():
N,X,Y = list(map(int,input().split()))
counter = Counter()
for i in range(1,N+1):
distance = [float("inf")]*(N+1)
q = deque()
q.append(i)
distance[i] = 0
while q:
p = ... | from collections import Counter
def main():
N,X,Y = list(map(int,input().split()))
counter = Counter()
for i in range(1,N):
for j in range(i+1,N+1):
d = min(j-i,abs(X-i)+abs(Y-j)+1)
counter[d]+=1
for i in range(1,N):
print((counter[i]))
if __name__... | p02726 |
N,X,Y = map(int,input().split())
X,Y = X-1,Y-1
from collections import deque
DP = [[-1]*N for _ in range(N)]
ans = [0]*N
for i in range(N):
for j in range(i+1,N):
x = j - (i+1)
y = j
if j <= X or Y <= i:
DP[i][j] = j - i
elif i <= X and Y <= j:
... | N,X,Y = map(int,input().split())
X,Y = X-1,Y-1
ans = [0]*N
for i in range(N):
for j in range(i+1,N):
if j <= X or Y <= i:
a = j - i
elif i <= X and Y <= j:
a = X-i + 1 + j-Y
elif i <= X and j <= Y:
a = min(j-i,X-i + 1 + Y-j)
elif X <... | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0] * (n-1)
for i in range(n-1):
for j in range(i+1, n):
d = min(j-i, abs(i-x+1)+abs(j-y+1)+1)
ans[d-1] += 1
for a in ans:
print(a)
| n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(n-1):
for j in range(i+1, n):
d = min(j-i, abs(i-x+1)+abs(j-y+1)+1)
ans[d] += 1
ans=ans[1:]
for a in ans:
print(a)
| p02726 |
N,X,Y=list(map(int,input().split()))
count=[0]*(N-1)
for i in range(1,N+1):
for j in range(i+1,N+1):
d=[]
d.append(abs(j-i))
d.append(abs(X-i)+1+abs(j-Y))
d.append(abs(Y-i)+1+abs(j-X))
count[min(d)-1]+=1
for k in count:
print(k) | N,X,Y=list(map(int,input().split()))
count=[0]*(N-1)
for i in range(1,N):
for j in range(i+1,N+1):
num=min(abs(j-i),abs(X-i)+1+abs(j-Y),abs(Y-i)+1+abs(j-X))
#d=[]
#d.append(abs(j-i))
#d.append(abs(X-i)+1+abs(j-Y))
#d.append(abs(Y-i)+1+abs(j-X))
coun... | p02726 |
from queue import Queue
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
q = Queue()
ans = [0] * N
def BFS(x, cnt):
if dist[x] != (N + 1):
return
cnt += 1
dist[x] = cnt
if x + 1 < N:
q.put((x + 1, cnt))
if x - 1 >= 0:
q.put((x - 1, cnt))... | from collections import deque
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
q = deque()
ans = [0] * N
def BFS(x, cnt):
if dist[x] != (N + 1):
return
cnt += 1
dist[x] = cnt
if x + 1 < N:
q.append((x + 1, cnt))
if x - 1 >= 0:
q.append((... | p02726 |
#!/usr/bin/env python3
N, X, Y = [int(str) for str in input().strip().split()]
INF = 100000
d = [[INF] * N for _ in range(N)]
for i in range(N - 1):
d[i][i + 1] = 1
d[i + 1][i] = 1
d[X - 1][Y - 1] = 1
d[Y - 1][X - 1] = 1
for k in range(N):
for i in range(N):
for j in range(N):
... | #!/usr/bin/env python3
N, X, Y = [int(str) for str in input().strip().split()]
X -= 1
Y -= 1
dists = [0] * N
for i in range(N - 1):
for j in range(i + 1, N):
d = min(j - i, abs(X - i) + abs(Y - j) + 1)
dists[d] += 1
for k in range(1, N):
print((dists[k])) | p02726 |
n, x, y = list(map(int, input().split()))
dis_list = [0] * (n - 1)
for i in range(n - 1):
for j in range(i + 1, n):
dis_list[min(abs(j - i), abs(x - i - 1) + 1 + abs(y - j - 1), abs(y - i - 1) + 1 + abs(x - j - 1)) - 1] += 1
for i in dis_list:
print(i) | n, x, y = list(map(int, input().split()))
dis_list = [0] * (n - 1)
for i in range(1, n):
for j in range(i + 1, n + 1):
dis_list[min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(y - i) + 1 + abs(x - j)) - 1] += 1
for i in dis_list:
print(i) | p02726 |
import collections
N,X,Y=list(map(int,input().split()))
if X > Y:
exc=X
X=Y
Y=exc
L=[]
for i in range(N-1):
for j in range(i+1,N):
if i >= Y-1 or j <= X-1:
L.append(j-i)
elif j-i == 1:
L.append(1)
elif i <= X-1 and j >= Y-1:
L.a... | N,X,Y=list(map(int,input().split()))
if X > Y:
exc=X
X=Y
Y=exc
L=[0]*N
for i in range(N-1):
for j in range(i+1,N):
if i >= Y-1 or j <= X-1 or j-i ==1:
L[j-i]+=1
elif i <= X-1 and j >= Y-1:
L[1+abs(X-1-i)+abs(Y-1-j)]+=1
elif i >= X-1 and i-(X-1)... | p02726 |
from collections import deque
import collections
n,x,y = list(map(int,input().split()))
connect=[[i-1,i+1] for i in range(1,n-1)]
connect.insert(0,[1])
connect.append([n-2])
connect[x-1].append(y-1)
connect[y-1].append(x-1)
dist_from_i = []
for i in range(0,n):
d=0
dist = [10**6]*n
... | n,x,y = list(map(int,input().split()))
dist = [0]*n
for i in range(0,n-1):
for j in range(i,n):
#xy使わない距離
dist1 = j-i
#xy使う距離
dist2 = abs((x-1) - i) + 1 + abs((y-1) - j)
# print(i,j,dist1,dist2)
#最短距離
... | p02726 |
def main():
import collections
n,x,y = list(map(int,input().split(" ")))
dp = [[0]*n for i in range(n)]
for i in range(0,n):
for j in range(i+1,n):
if i < x-1:
if j < x:
dp[i][j] =dp[i][j-1] +1
if j >= x and j < y:
... | def main2():
n,x,y = list(map(int,input().split(" ")))
cnts = [0]*n
for i in range(n):
for j in range(i+1,n):
dis = min(j-i,abs(x-1-i)+1+abs(y-1-j))
cnts[dis]+=1
for i in range(1,n):
print((cnts[i]))
main2() | p02726 |
N, X, Y = list(map(int, input().split()))
ans = [0]*(N-1)
for i in range(N-1):
for j in range(i+1,N):
dist = min(j-i, min(abs(X-1-i)+1+abs(Y-1-j), abs(Y-1-i)+1+abs(X-1-j)))
ans[dist-1] += 1
for i in range(N-1):
print((ans[i])) | import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)
N, X, Y = list(map(int, input().split()))
ans = [0]*(N-1)
for i in range(N-1):
for j in range(i+1,N):
dist = min(j-i, min(abs(X-1-i)+1+abs(Y-1-j), abs(Y-1-i)+1+abs(X-1-j)))
ans[dist-1] += 1
for i i... | p02726 |
from collections import deque
N, X, Y = list(map(int, input().split()))
# N = 2000
# X = 100
# Y = 1900
X -= 1
Y -= 1
# @profile
def main(N, X, Y):
ans = [0]*N
for sv in range(N):
# dist[v] = dist from sv to v
dist = [float("inf")]*N
visited = deque()
dist[s... |
N, X, Y = list(map(int, input().split()))
# N = 2000
# X = 100
# Y = 1900
X -= 1
Y -= 1
# @profile
def main(N, X, Y):
ans = [0]*N
for i in range(N):
for j in range(i+1, N):
d = min(j-i, abs(X-i)+abs(Y-j)+1)
ans[d] += 1
for a in ans[1:]:
p... | p02726 |
#!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): ... | #!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): ... | p02726 |
#!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): ... | #!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): ... | p02726 |
N,X,Y=list(map(int,input().split()))
def shortest(x,y,a,b):
ans=min(y-x,abs(y-b)+1+abs(a-x),abs(y-a)+1+abs(b-x))
return ans
distance=[0]*N
for x in range(1,N+1):
for y in range(1,N+1):
if y<=x:
continue
else:
a=shortest(x,y,X,Y)
distance[a-1]+=1... | N,X,Y=list(map(int,input().split()))
def shortest(x,y,a,b):
ans=min(y-x,abs(y-b)+1+abs(a-x))
return ans
distance=[0]*(N-1)
for x in range(1,N):
for y in range(2,N+1):
if y<=x:
continue
a=shortest(x,y,X,Y)
distance[a-1]+=1
for i in distance:
print(i) | p02726 |
from collections import deque
from itertools import combinations
def main():
n, x, y = [int(e) for e in input().split()]
D = dict()
D[1] = {2}
D[n] = {n - 1}
for i in range(2, n):
D[i] = {i - 1, i + 1}
D[x].add(y)
D[y].add(x)
A = [0]*(n - 1)
for c in combi... | from itertools import combinations
def main():
n, x, y = [int(e) for e in input().split()]
A = [0]*(n - 1)
for c in combinations(list(range(1, n + 1)), 2):
cnt = min(abs(c[1] - c[0]), abs(c[1] - y) + abs(c[0] - x) + 1, abs(c[1] - x) + abs(c[0] - y) + 1)
A[cnt - 1] += 1
for a... | p02726 |
n,x,y = list(map(int,input().split()))
r = [[] for i in range(n)]
for i in range(n):
if i==0:
r[i].append(i+1)
elif i==n-1:
r[i].append(n-2)
else:
r[i].append(i-1)
r[i].append(i+1)
#x,yの間に道を追加
x,y = x-1,y-1
r[x].append(y)
r[y].append(x)
from collection... | n,x,y = list(map(int,input().split()))
x,y = x-1,y-1
d={}
for k in range(1,n):
d[k]=0
for i in range(n):
for j in range(i+1,n):
dist=min(abs(i-j) , abs( i - x ) + 1 + abs(y - j) ,abs( i - y ) + 1 + abs(x - j))
d[dist]+=1
for k in range(1,n):
print((d[k])) | p02726 |
import sys
from collections import deque
input = sys.stdin.buffer.readline
def bfs(v):
dist = [f_inf for _ in range(n)]
dist[v] = 0
q = deque()
q.append(v)
while q:
u = q.popleft()
for nv in tree[u]:
if dist[nv] == f_inf:
dist[nv] = dist[u]... | def main():
import sys
from collections import deque
input = sys.stdin.buffer.readline
def bfs(v):
dist = [f_inf for _ in range(n)]
dist[v] = 0
q = deque()
q.append(v)
while q:
u = q.popleft()
for nv in tree[u]:
... | p02726 |
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, x, y = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for i in range(1, n):
tree[i - 1].append(i)
tree[i].append(i - 1)
tree[x ... | import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
def bfs(root):
dist = [f_inf] * n
dist[root] = 0
que = deque()
que.append(root)
while que:
p... | p02726 |
n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
dis = min(j-i, abs(j-(x-1))+1+abs((y-1)-i), abs(j-(y-1))+1+abs((x-1)-i))
ans[dis-1] += 1
for i in range(n-1):
print((ans[i])) | n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
dis = min(j-i, abs(j-x)+1+abs(y-i), abs(j-y)+1+abs(x-i))
ans[dis-1] += 1
for i in range(n-1):
print((ans[i])) | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1,n):
for j in range(i+1, n+1):
r1 = j-i
r2 = abs(x-i) + 1 + abs(j-y)
r3 = abs(y-i) + 1 + abs(j-x)
ans[min(r1,r2,r3)] += 1
for i in range(1,n):
print((ans[i])) | def main():
n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1,n):
for j in range(i+1, n+1):
r1 = j-i
r2 = abs(x-i) + 1 + abs(j-y)
r3 = abs(y-i) + 1 + abs(j-x)
ans[min(r1,r2,r3)] += 1
for i in range(1,n):
... | p02726 |
def main():
n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1,n):
for j in range(i+1, n+1):
r1 = j-i
r2 = abs(x-i) + 1 + abs(j-y)
r3 = abs(y-i) + 1 + abs(j-x)
ans[min(r1,r2,r3)] += 1
for i in range(1,n):
... | n,x,y = list(map(int, input().split()))
ans = [0]*n
for i in range(1,n):
for j in range(i+1,n+1):
v1 = j-i
v2 = abs(x-i) + 1 + abs(y-j)
v3 = abs(y-i) + 1 + abs(x-j)
minv = min(v1,v2,v3)
ans[minv] += 1
for a in ans[1:]:
print(a) | p02726 |
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,X,Y=MI()
X-=1
Y-=1
##########################################
import heapq
... | 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,X,Y=MI()
X-=1
Y-=1
ans=[0]*N
for i in range(N):
for j in range(... | p02726 |
N,X,Y = list(map(int, input().split()))
ans = [0]*(N-1)
for i in range(1, N+1):
for j in range(i+1, N+1):
if j <= X:
ans[j-i-1] += 1
elif i <= X:
ans[min(j-i, X-i+1+abs(Y-j))-1] += 1
elif i < Y:
ans[min(j-i, i-X+abs(j-Y)+1)-1] += 1
else... | N,X,Y = list(map(int, input().split()))
ans = [0]*N
for i in range(1, N+1):
for j in range(i+1, N+1):
d = min(j-i, abs(i-X)+1+abs(j-Y))
ans[d] += 1
for i in range(1, N):
print((ans[i])) | p02726 |
import sys
import queue
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : list(map(int, input().split()))
mod=1000000007
#+++++
def main():
n, x, y = IN()
al=[]
for i in range(n):
ll=[-1]*n
ll[i]=0
ol=queue.Queue()
ol.put(i)
... | import sys
from collections import deque
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : list(map(int, input().split()))
mod=1000000007
#+++++
def main():
n, x, y = IN()
al=[]
for i in range(n):
ll=[0]*n
for j in range(n-i):
ll... | p02726 |
n,x,y=list(map(int,input().split()))
x-=1
y-=1
cnt=[0]*n
for i in range(n):
for j in range(i+1,n):
dist=min(j-i,abs(j-x)+1+abs(i-y),abs(j-y)+1+abs(i-x))
cnt[dist]+=1
for i in range(1,n):
print((cnt[i])) | N,X,Y=list(map(int,input().split()))
X-=1#0-indexへ
Y-=1
dist=[0]*(N+1)
for i in range(N):
for j in range(i+1,N):
d=min(j-i,abs(j-X)+1+abs(i-Y),abs(j-Y)+1+abs(i-X))
#通常ルートとバイパスを通った時を比べて小さい方を取る
dist[d]+=1#該当の距離に相応するパスの個数を１個追加する
for i in range(1,N):#距離が1以上のパスの個数を順番に出力
print((dist[i])) | p02726 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.