input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int, input().split()))
ab = [sorted(list(map(int, input().split()))) for _ in range(M)]
fst = []
scnd = {}
for i in ab:
if i[0]==1:
fst.append(i[1])
if N in i:
idx = i.index(N)
scnd[i[1-idx]] = 0
#print(scnd,fst)
for j in fst:
if j in scnd:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
| n, m = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(m)]
cont_1 = set()
cont_n = set()
for ab in AB:
a, b = ab
if 1 in ab:
cont_1.add(a)
cont_1.add(b)
if n in ab:
cont_n.add(a)
cont_n.add(b)
if cont_1 & cont_n:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | p03645 |
N, M = list(map(int, input().split()))
start = []
end = []
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1 or b == 1:
start.append(a*b)
if a == N or b == N:
end.append(a * b / N)
flag = 0
for i in start:
if i in end:
print("POSSIBLE")
flag = 1
break
if not(flag):
print("IMPOSSIBLE")
| N, M = list(map(int, input().split()))
start = set([])
end = set([])
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1 or b == 1:
start.add(a*b)
if a == N or b == N:
end.add(a * b / N)
flag = 0
for i in start:
if i in end:
print("POSSIBLE")
flag = 1
break
if not(flag):
print("IMPOSSIBLE")
| p03645 |
from _collections import deque
n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
dep=[-1]*(n+1)
dep[1]=0
data=deque([1])
while len(data)>0:
p=data.popleft()
for i in edg[p]:
if dep[i]==-1:
dep[i]=dep[p]+1
data.append(i)
print(("POSSIBLE" if dep[n]==2 else "IMPOSSIBLE"))
| n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
f=1
for i in range(2,n+1):
if 1 in edg[i] and n in edg[i]:
f=0
print(("POSSIBLE" if f==0 else "IMPOSSIBLE"))
| p03645 |
n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
f=1
for i in range(2,n+1):
if 1 in edg[i] and n in edg[i]:
f=0
print(("POSSIBLE" if f==0 else "IMPOSSIBLE"))
| n,m=list(map(int,input().split()))
edg1=[0]*(n+1)
edgn=[0]*(n+1)
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
edg1[b]=1
if b==n:
edgn[a]=1
f=1
for i in range(2,n+1):
if edg1[i]==1 and edgn[i]==1:
f=0
print(("POSSIBLE" if f==0 else "IMPOSSIBLE"))
| p03645 |
n,m=list(map(int,input().split()))
edg1=[0]*(n+1)
edgn=[0]*(n+1)
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
edg1[b]=1
if b==n:
edgn[a]=1
f=1
for i in range(2,n+1):
if edg1[i]==1 and edgn[i]==1:
f=0
print(("POSSIBLE" if f==0 else "IMPOSSIBLE"))
| import sys
input = sys.stdin.readline
from _collections import deque
n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
dep=[-1]*(n+1)
dep[1]=0
data=deque([1])
while len(data)>0:
p=data.popleft()
for i in edg[p]:
if dep[i]==-1:
dep[i]=dep[p]+1
data.append(i)
print(("POSSIBLE" if dep[n]==2 else "IMPOSSIBLE"))
| p03645 |
import sys
def ipnput():
return sys.stdin.readline()[:-1]
from _collections import deque
n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
dep=[-1]*(n+1)
dep[1]=0
data=deque([1])
while len(data)>0:
p=data.popleft()
for i in edg[p]:
if dep[i]==-1:
dep[i]=dep[p]+1
data.append(i)
print(("POSSIBLE" if dep[n]==2 else "IMPOSSIBLE"))
| import sys
input=sys.stdin.readline
from _collections import deque
n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
dep=[-1]*(n+1)
dep[1]=0
data=deque([1])
while len(data)>0:
p=data.popleft()
for i in edg[p]:
if dep[i]==-1:
dep[i]=dep[p]+1
data.append(i)
print(("POSSIBLE" if dep[n]==2 else "IMPOSSIBLE"))
| p03645 |
N, M = list(map(int, input().split()))
ab = [sorted(list(map(int, input().split()))) for _ in range(M)]
judge = False
m = []
for i, (a, b) in enumerate(ab):
if a == 1:
m.append(b)
for i, (a, b) in enumerate(ab):
if a in m and b == N:
judge = True
break
if judge:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
edge[a].append(b)
edge[b].append(a)
ans = {True: "POSSIBLE",
False: "IMPOSSIBLE"}
print((ans[len(set(edge[0]) & set(edge[-1])) > 0]))
| p03645 |
N,M=list(map(int,input().split()))
import collections
table=collections.defaultdict(list)
for i in range(M):
a,b=list(map(int,input().split()))
table[a].append(b)
table[b].append(a)
for x in table[1]:
if x in table[N]:
print("POSSIBLE")
exit(0)
print("IMPOSSIBLE")
| N,M=list(map(int,input().split()))
import collections
table=collections.defaultdict(int)
table2=collections.defaultdict(int)
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
table[b]+=1
if b==N:
table2[a]+=1
for x in table:
if x in table2:
print("POSSIBLE")
exit(0)
print("IMPOSSIBLE")
| p03645 |
N,M=list(map(int,input().split()))
import collections
table=collections.defaultdict(int)
table2=collections.defaultdict(int)
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
table[b]+=1
if b==N:
table2[a]+=1
for x in table:
if x in table2:
print("POSSIBLE")
exit(0)
print("IMPOSSIBLE")
| N, M = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for i in range(M)]
first = set()
second = set()
for a, b in ab:
if a == 1:
first.add(b)
elif b == N:
second.add(a)
if len(first & second):
print("POSSIBLE")
else:
print("IMPOSSIBLE")
| p03645 |
N,M = list(map(int,input().split()))
from1 = []
toN = []
for i in range(M):
a,b = list(map(int,input().split()))
if a ==1 or b ==1:
from1.append(a if a!=1 else b)
if a == N or b == N:
toN.append(a if a!=N else b)
F = False
for i in from1:
for j in toN:
if i == j:
F = True
break
if F:
break
print(("POSSIBLE" if F else "IMPOSSIBLE")) | N,M = list(map(int,input().split()))
from1 = [False]*max(N,M)
toN = [False]*max(N,M)
for i in range(M):
a,b = list(map(int,input().split()))
if a ==1 or b ==1:
from1[a-1 if a!= 1 else b-1]=True
if a == N or b == N:
toN[a-1 if a!= N else b-1]=True
cnt =0
for i in range(M):
cnt+=from1[i]&toN[i]
print(("POSSIBLE" if cnt else "IMPOSSIBLE")) | p03645 |
N,M=list(map(int,input().split()))
start=[]
end=[]
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
start.append(b)
elif b==N:
end.append(a)
for i in start:
if i in end:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | N,M=list(map(int,input().split()))
start=[]
end=[]
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
start.append(b)
elif b==N:
end.append(a)
startset=set(start)
endset=set(end)
if startset & endset:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | p03645 |
from collections import defaultdict
N, M = list(map(int, input().split()))
dep = []
arr = []
ans = "IMPOSSIBLE"
for i in range(M):
a,b = list(map(int ,input().split()))
if a == 1: dep.append(b-1)
if b == N: arr.append(a-1)
for i in (arr):
if i in dep:
ans = "POSSIBLE"
break
print(ans) | from collections import defaultdict
N, M = list(map(int, input().split()))
shima = []
ans = "IMPOSSIBLE"
for i in range(M):
a,b = list(map(int ,input().split()))
if a == 1: shima.append(b-1)
if b == N: shima.append(a-1)
shima.sort()
for s,t in zip(shima[:-1],shima[1:]):
if s == t:
ans = "POSSIBLE"
break
print(ans) | p03645 |
def ABC068C():
N, M = list(map(int, input().split()))
ship_first = []
ship_second = []
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
if b == N:
print('POSSIBLE')
return
else:
ship_first.append(b)
elif b == N:
ship_second.append(a)
for i in ship_first:
if i in ship_second:
print('POSSIBLE')
return
print('IMPOSSIBLE')
return
ABC068C()
| def ABC068C():
N, M = list(map(int, input().split()))
flag = [[False, False] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
flag[b][0] = True
elif b == N:
flag[a][1] = True
for i in range(N):
if flag[i][0] and flag[i][1]:
print('POSSIBLE')
return
print('IMPOSSIBLE')
return
ABC068C()
| p03645 |
N,M = list(map(int,input().split()))
slink = []
glink = []
for i in range(M):
a,b = list(map(int,input().split()))
if a == 1:
slink.append(b)
elif b == 1:
slink.append(a)
elif a == N:
glink.append(b)
elif b == N:
glink.append(a)
ans = "IMPOSSIBLE"
for i in slink:
if i in glink:
ans = "POSSIBLE"
break
print (ans) |
N,M = list(map(int,input().split()))
slink = {}
glink = {}
for i in range(M):
a,b = list(map(int,input().split()))
if a == 1:
slink[b] = 1
elif b == 1:
slink[a] = 1
elif a == N:
glink[b] = 1
elif b == N:
glink[a] = 1
ans = "IMPOSSIBLE"
for i in slink:
if i in glink:
ans = "POSSIBLE"
break
print (ans)
| p03645 |
N, M = list(map(int, input().split()))
T = {}
for i in range(M):
a, b = list(map(int, input().split()))
if a not in T:
T[a] = []
T[a].append(b)
if b not in T:
T[b] = []
T[b].append(a)
# print(N, M, T)
FROM_1 = T[1]
for f in FROM_1:
if N in T[f]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
| def solve():
N, M = list(map(int, input().split()))
T = {}
for i in range(M):
a, b = list(map(int, input().split()))
if a not in T:
T[a] = []
T[a].append(b)
if b not in T:
T[b] = []
T[b].append(a)
# print(N, M, T)
FROM_1 = T[1]
for f in FROM_1:
if N in T[f]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
if __name__ == '__main__':
solve()
| p03645 |
def solve():
N, M = list(map(int, input().split()))
T = {}
for i in range(M):
a, b = list(map(int, input().split()))
if a not in T:
T[a] = []
T[a].append(b)
if b not in T:
T[b] = []
T[b].append(a)
# print(N, M, T)
FROM_1 = T[1]
for f in FROM_1:
if N in T[f]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
if __name__ == '__main__':
solve()
| def solve():
N, M = map(int, input().split())
FROM_1 = set()
TO_N = set()
for i in range(M):
a, b = map(int, input().split())
if a == 1:
FROM_1.add(b)
elif a == N:
TO_N.add(b)
if b == 1:
FROM_1.add(a)
elif b == N:
TO_N.add(a)
ans = FROM_1 & TO_N
print('POSSIBLE') if ans else print('IMPOSSIBLE')
if __name__ == '__main__':
solve()
| p03645 |
N, M = list(map(int, input().split()))
graph = [list() for i in range(N+1)]
for i in range(M):
a, b = tuple(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
pos_flag = False
for u in graph[1]:
if N in graph[u]:
pos_flag = True
break
if pos_flag == True:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | N, M = list(map(int, input().split()))
graph = [list() for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
for g1 in graph[0]:
if N-1 in graph[g1]:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE") | p03645 |
import sys
sys.setrecursionlimit(1000000000)
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = [int(x)-1 for x in input().split()]
graph[a] += [b]
graph[b] += [a]
dist = [float('inf')]*N
def dfs(u, pre, cnt):
dist[u] = cnt
for v in graph[u]:
if v != pre and cnt+1 < dist[v]:
dfs(v, u, cnt+1)
dfs(0, -1, 0)
if 0 < dist[N-1] <= 2:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | N, M = list(map(int, input().split()))
from_one = []
to_n = []
for _ in range(M):
a, b = [int(x)-1 for x in input().split()]
if a == 0:
from_one += [b]
elif b == 0:
from_one += [a]
elif a == N-1:
to_n += [b]
elif b == N-1:
to_n += [a]
from_one = set(from_one)
to_n = set(to_n)
if len(from_one & to_n) >= 1:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
| p03645 |
N, M = list(map(int, input().split()))
first = []
second = []
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
first.append(b)
elif b == N:
second.append(a)
ans = 0
for i in first:
if i in second:
ans = 1
break
if ans:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | N, M = list(map(int, input().split()))
first = set()
second = set()
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
first.add(b)
elif b == N:
second.add(a)
ans = 0
for i in first:
if i in second:
ans = 1
break
if ans:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | p03645 |
import sys
from collections import defaultdict
from collections import deque
n, m = list(map(int, input().split()))
graph = defaultdict(list)
for _ in range(m):
a, b = [int(x) for x in input().split()]
graph[a].append(b)
graph[b].append(a)
q = deque([1])
dist = [0] * (n + 1)
dist[1] = 0
while q:
if max(dist) > 2:
break
node = q.popleft()
after = graph[node]
for a in after:
q.append(a)
if a == n:
dist[a] = dist[node] + 1
break
else:
dist[a] = dist[node] + 1
print(("POSSIBLE" if dist[n] == 1 or dist[n] == 2 else "IMPOSSIBLE")) | import sys
from collections import defaultdict
from collections import deque
n, m = list(map(int, input().split()))
graph = defaultdict(list)
for _ in range(m):
a, b = [int(x) for x in input().split()]
graph[a].append(b)
graph[b].append(a)
q = deque([1])
dist = [0] * (n + 1)
dist[1] = 0
curr = 0
while q and curr <= 2:
node = q.popleft()
after = graph[node]
for a in after:
if a == n:
print("POSSIBLE")
sys.exit()
q.append(a)
dist[a] = dist[node] + 1
curr = dist[a]
print(("POSSIBLE" if dist[n] == 1 or dist[n] == 2 else "IMPOSSIBLE")) | p03645 |
n,m = list(map(int,input().split()))
d = {str(x):[] for x in range(1,n+1)}
n = str(n)
ans = "IMPOSSIBLE"
for i in range(m):
t = input().split()
d[t[0]].append(t)
for l1 in d["1"]:
if l1[1]==n:
ans="POSSIBLE"
else:
for l2 in d[l1[1]]:
if l2[1]==n:
ans="POSSIBLE"
print(ans) | n,m = list(map(int,input().split()))
d = {str(x):[] for x in range(1,n+1)}
n = str(n)
ans = "IMPOSSIBLE"
for i in range(m):
t = input().split()
d[t[0]].append(t[1])
for l1 in d["1"]:
if l1==n:
ans="POSSIBLE"
break
else:
for l2 in d[l1]:
if l2==n:
ans="POSSIBLE"
break
print(ans)
| p03645 |
from collections import deque
#グラフの連結成分を調べる
def Graph(ab):
G=[[] for i in range(n)]
for a,b in ab:
G[a-1].append(b)
G[b-1].append(a)
return G
n, m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
G = Graph(ab)
for v in G[0]:
if n in G[v - 1]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | #グラフの連結成分を調べる
def Graph(ab):
G=[[] for i in range(n)]
for a,b in ab:
G[a-1].append(b)
G[b-1].append(a)
return G
n, m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
G = Graph(ab)
for new_v in G[0]:
if n in G[new_v - 1]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | p03645 |
import sys
def 解():
iN,iM = [int(_) for _ in input().split()]
aAB = [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]
dT = {}
def addTree(dT,a,b):
if a in dT:
dT[a].add(b)
else:
dT[a] = {b}
for a,b in aAB:
addTree(dT,a,b)
addTree(dT,b,a)
if 1 not in dT or iN not in dT:
print("IMPOSSIBLE")
elif 0 < len(dT[1] & dT[iN]) :
print("POSSIBLE")
else:
print("IMPOSSIBLE")
解()
| import sys
def 解():
iN,iM = [int(_) for _ in input().split()]
aAB = [[int(_) for _ in sLine.split() ] for sLine in sys.stdin.readlines()]
d1 = set()
dN = set()
for a,b in aAB:
if a == 1 :
d1.add(b)
if b == iN:
dN.add(a)
if d1 & dN == set():
print("IMPOSSIBLE")
else:
print("POSSIBLE")
解()
| p03645 |
import sys
def 解():
iN,iM = [int(_) for _ in input().split()]
d1 = set()
dN = set()
for _ in range(iM):
a,b = [int(_) for _ in sys.stdin.readline().split()]
if a == 1 :
d1.add(b)
if b == iN:
dN.add(a)
if d1 & dN :
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
解()
| import sys
def 解():
iN,iM = [int(_) for _ in input().split()]
a1 = [0]*iN
aN = [0]*iN
aAB = [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]
for a,b in aAB:
if a == 1:
a1[b] = 1
if b == iN:
aN[a] = 1
for i in range(iN):
if a1[i] and aN[i]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
解()
| p03645 |
import sys
def 解():
iN,iM = [int(_) for _ in input().split()]
a1 = [0]*iN
aN = [0]*iN
aAB = [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]
for a,b in aAB:
if a == 1:
a1[b] = 1
if b == iN:
aN[a] = 1
for i in range(iN):
if a1[i] and aN[i]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
解()
| import sys
input = sys.stdin.readline
def 解():
iN,iM = [int(_) for _ in input().split()]
a1 = [0]*iN
aN = [0]*iN
for i in range(iM):
a,b = [int(_) for _ in input().split()]
if a == 1:
a1[b] = 1
if b == iN:
aN[a] = 1
for i in range(iN):
if a1[i] and aN[i]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
解()
| p03645 |
N, M = list(map(int, input().split()))
g = {i: set() for i in range(1, N + 1)}
for _ in range(M):
A, B = list(map(int, input().split()))
g[A].add(B)
g[B].add(A)
if g[1].intersection(g[N]):
print('POSSIBLE')
else:
print('IMPOSSIBLE')
| import sys
def input():
return sys.stdin.readline().strip()
N, M = list(map(int, input().split()))
g = {i: set() for i in range(1, N + 1)}
for _ in range(M):
A, B = list(map(int, input().split()))
if A in (1, N) or B in (1, N):
g[A].add(B)
g[B].add(A)
if g[1].intersection(g[N]):
print('POSSIBLE')
else:
print('IMPOSSIBLE')
| p03645 |
import sys
N, M = list(map(int, input().split()))
routes = []
for i in range(M):
a, b = list(map(int, input().split()))
routes.append([a, b])
m = []
for r in routes:
if r[0] == 1:
m.append(r[1])
for r in routes:
if r[0] in m:
if r[1] == N:
print('POSSIBLE')
sys.exit()
print('IMPOSSIBLE') | import sys
N, M = list(map(int, input().split()))
m = set()
m2 = set()
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1:
m.add(b)
if b == N:
m2.add(a)
for me in m:
if me in m2:
print('POSSIBLE')
sys.exit()
print('IMPOSSIBLE') | p03645 |
n,m=list(map(int,input().split()))
edges=[set() for i in range(n+1)]
for i in range(m):
a,s=list(map(int,input().split()))
edges[a].add(s)
edges[s].add(a)
for i in range(2,n):
if i in edges[1]&edges[n]:
print("POSSIBLE");exit()
print("IMPOSSIBLE") | n,m=list(map(int,input().split()))
edges=[set() for i in range(n+1)]
for i in range(m):
a,s=list(map(int,input().split()))
edges[a].add(s)
edges[s].add(a)
for i in range(2,n):
if i in edges[1] and i in edges[n]:
print("POSSIBLE");exit()
print("IMPOSSIBLE") | p03645 |
n,m = list(map(int,input().split()))
dic = {}
for i in range(m):
a,b = list(map(int,input().split()))
if a not in dic:
dic[a]=[b]
else:
if b not in dic[a]:
dic[a].append(b)
if b not in dic:
dic[b]=[a]
if a not in dic[b]:
dic[b].append(a)
ans = 'IMPOSSIBLE'
for i in dic[1]:
if n in dic[i]:
ans = 'POSSIBLE'
break
print(ans) | n,m = list(map(int,input().split()))
dic = {i+1:set() for i in range(n)}
for i in range(m):
a,b = list(map(int,input().split()))
dic[a].add(b)
dic[b].add(a)
ans = 'IMPOSSIBLE'
for i in dic[1]:
if n in dic[i]:
ans = 'POSSIBLE'
break
print(ans) | p03645 |
n,m=list(map(int,input().split()))
tr=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
if a!=1 and b!=n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2,n):
if len(tr[i])==2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
tr=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
if a!=1 and b!=n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2,n):
if len(tr[i])==2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| p03645 |
import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
tr=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
if a!=1 and b!=n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2,n):
if len(tr[i])==2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
tr=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
if a!=1 and b!=n:
continue
if a==1:
if tr[b]==[n]:
print("POSSIBLE")
exit()
else:
tr[b].append(a)
if b==n:
if tr[a]==[1]:
print("POSSIBLE")
exit()
else:
tr[a].append(b)
else:
print("IMPOSSIBLE")
| p03645 |
n,m=list(map(int,input().split()))
flag=False
one = []
enu = []
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
one.append(b)
elif b==n:
enu.append(a)
for i in one:
if i in enu:
flag=True
break
if flag: print('POSSIBLE')
else: print('IMPOSSIBLE') | n,m=list(map(int,input().split()))
li = []
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
li.append(b)
elif b==n:
li.append(a)
if len(set(li))==len(li): print('IMPOSSIBLE')
else: print('POSSIBLE') | p03645 |
n,m=list(map(int,input().split(" ")))
l=[]
bone=[]
ans="IMPOSSIBLE"
for i in range(m):
a,b=input().split(" ")
if a=="1":l.append(b)
if b==str(n):bone.append(a)
def cat_snuke():
for i in l:
for j in bone:
if i == j:
print("POSSIBLE")
return 0
print("IMPOSSIBLE")
cat_snuke() | n,m=list(map(int,input().split(" ")))
l=[]
bone=[]
for i in range(m):
a,b=input().split(" ")
if a=="1":l.append(b)
if b==str(n):bone.append(a)
ans=list(set(l) & set(bone))
if len(ans)!=0:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | p03645 |
N, M = list(map(int, input().split()))
teiki_1 = []
teiki_N = []
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1 or b == 1:
teiki_1.append(a if a != 1 else b)
if a == N or b == N:
teiki_N.append(a if a != N else b)
for num in sorted(teiki_1):
if num in sorted(teiki_N):
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
| N, M = list(map(int, input().split()))
teiki_1 = []
teiki_N = []
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1 or b == 1:
teiki_1.append(a if a != 1 else b)
if a == N or b == N:
teiki_N.append(a if a != N else b)
if len(set(teiki_1) & set(teiki_N)) > 0:
print('POSSIBLE')
else:
print('IMPOSSIBLE')
| p03645 |
# 2019/08/05
n,m=list(map(int,input().split()))
edge=[[] for _ in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
a-=1;b-=1
edge[a].append(b)
edge[b].append(a)
for e in edge[-1]:
if 0 in edge[e]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | # 2019/08/05
input=open(0).readline
n,m=list(map(int,input().split()))
edge=[[] for _ in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
a-=1;b-=1
edge[a].append(b)
edge[b].append(a)
for e in edge[-1]:
if 0 in edge[e]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | p03645 |
n, m = list(map(int, input().split()))
ab_list = [0] * m
for i in range(m):
ab_list[i] = list(map(int, input().split()))
a_list = []
b_list = []
for i in ab_list:
if i[0] == 1:
a_list.append(i[1])
elif i[1] == n:
b_list.append(i[0])
r = 'IMPOSSIBLE'
for a in a_list:
if a in b_list:
r = 'POSSIBLE'
break
print(r) | n, m = list(map(int, input().split()))
ab_list = [0] * m
for i in range(m):
ab_list[i] = list(map(int, input().split()))
a_list = []
b_list = []
for i in ab_list:
if i[0] == 1:
a_list.append(i[1])
elif i[1] == n:
b_list.append(i[0])
r = 'POSSIBLE' if set(a_list) & set(b_list) else 'IMPOSSIBLE'
print(r) | p03645 |
n,m = list(map(int,input().split()))
matrix = [[] for i in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
matrix[a].append(b)
matrix[b].append(a)
for i in matrix[0]:
if i in matrix[n-1]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | n,m = list(map(int,input().split()))
Check1 = [False]*n
Check2 = [False]*n
for i in range(m):
a,b = list(map(int,input().split()))
if a ==1:
Check1[b-1] = True
elif a == n:
Check2[b-1] = True
elif b == 1:
Check1[a-1] = True
elif b == n:
Check2[a-1] = True
for i in range(n):
if Check1[i] and Check2[i]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | p03645 |
N,M = list(map(int, input().split()))
A = [[] for i in range(N)]
for i in range(M):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
A[a].append(b)
A[b].append(a)
for j in A[0]:
if j in A[-1]:
print("POSSIBLE")
break
else:
print('IMPOSSIBLE') | N,M = list(map(int, input().split()))
A = [[] for i in range(N)]
for i in range(M):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
A[a].append(b)
A[b].append(a)
if len(A[0])+len(A[-1]) != len(set(A[0]+A[-1])):
print("POSSIBLE")
else:
print('IMPOSSIBLE') | p03645 |
n,m=list(map(int,input().split()))
lst=[]
for i in range(m):
lst.append(list(map(int,input().split())))
ipponme=[]
for i in lst:
if i[0]==1:
ipponme.append(i[1])
for i in ipponme:
for j in lst:
if j[0]==i and j[1]==n:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") | n,m=list(map(int,input().split()))
lst=[]
for i in range(m):
lst.append(list(map(int,input().split())))
front=[]
back=[]
for i in lst:
if i[0]==1:
front.append(i[1])
for i in lst:
if i[1]==n:
back.append(i[0])
front=set(front)
back=set(back)
print(("POSSIBLE" if len(front&back)>=1 else "IMPOSSIBLE")) | p03645 |
from collections import deque
N, M = list(map(int, input().split()))
to = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
to[a].append(b)
to[b].append(a)
que = deque()
que.append(0)
dist = [-1] * N
dist[0] = 0
while que:
island = que.popleft()
for nxt in to[island]:
if dist[nxt] != -1:
continue
que.append(nxt)
dist[nxt] = dist[island] + 1
print(('POSSIBLE' if dist[N - 1] == 2 else 'IMPOSSIBLE')) | N, M = list(map(int, input().split()))
to = [[] for _ in range(N)]
ans = 'IMPOSSIBLE'
for _ in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
to[a].append(b)
to[b].append(a)
for nxt in to[0]:
if N - 1 in to[nxt]:
ans = 'POSSIBLE'
break
print(ans) | p03645 |
n,m = list(map(int,input().split()))
if m == 1:
print("IMPOSSIBLE")
exit()
a = []
for i in range(m):
arr = list(map(int,input().split()))
if 1 in arr or n in arr:
a.append(arr)
l = [i[0] for i in a if i[1]==n]
if len(l)==0:
print("IMPOSSIBLE")
exit()
for i in l:
if [1,i] in a:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") | n,m = list(map(int,input().split()))
if m == 1:
print("IMPOSSIBLE")
exit()
a = set()
b = set()
for i in range(m):
arr = list(map(int,input().split()))
if 1 in arr:a.add(arr[1])
if n in arr:b.add(arr[0])
if len(a&b)==0:print("IMPOSSIBLE")
else:print("POSSIBLE") | p03645 |
N,M = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(M)]
flag = False
j = 0
while (0 <= j <= len(L)-1):
k = L[j][1]
if ([1,k] in L):
if ([k,N] in L):
flag = True
break
else:
j += 1
else:
j += 1
if flag:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | N,M = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(M)]
J = [False]*(N+1)
K = [False]*(N+1)
J[0] = False
K[N] = False
J[1] = False
K[1] = False
for j in range(M):
if L[j][0] == 1:
J[L[j][1]] = True
for k in range(M):
if L[k][1] == N:
K[L[k][0]] = True
flag = False
for l in range(N+1):
if J[l] and K[l]:
flag = True
break
if flag:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | p03645 |
N,M=list(map(int,input().split()))
from1=set()
toN=set()
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
from1.add(b)
elif b==N:
toN.add(a)
print((("","IM")[len(from1&toN)==0]+"POSSIBLE"))
| N,M=list(map(int,input().split()))
f=set()
t=set()
for i in range(M):
a,b=list(map(int,input().split()))
if a<2:
f.add(b)
elif b==N:
t.add(a)
print((("IM","")[len(f&t)]+"POSSIBLE")) | p03645 |
N,M=list(map(int,input().split()))
f=set()
t=set()
for i in range(M):
a,b=list(map(int,input().split()))
if a<2:
f.add(b)
if b==N:
t.add(a)
print(("IM"*(len(f&t)^1)+"POSSIBLE")) | import sys
readline = sys.stdin.readline
N,M = list(map(int,readline().split()))
G = [[] for i in range(N)]
for i in range(M):
a,b = list(map(int,readline().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
for child in G[0]:
for gchild in G[child]:
if gchild == N - 1:
print("POSSIBLE")
exit(0)
print("IMPOSSIBLE") | p03645 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,m=LI()
l=[]
for _ in range(m):
a,b=LI()
if a==1:
l.append(b)
elif a==n:
l.append(b)
elif b==n:
l.append(a)
if len(l)!=len(list(set(l))):
return 'POSSIBLE'
return 'IMPOSSIBLE'
print((main()))
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,m=LI()
l=[]
for _ in range(m):
a,b=LI()
if a==1:
l.append(b)
elif b==n:
l.append(a)
x=len(l)
y=len(list(set(l)))
if x!=y:
return 'POSSIBLE'
return 'IMPOSSIBLE'
print((main()))
| p03645 |
def solve():
while 1:
try:
N, M = list(map(int, input().split(" ")))
graph = [[0] * N for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split(" ")))
graph[a - 1][b - 1], graph[b - 1][a - 1] = 1, 1
edges_from1 = graph[0].count(1)
edges_fromN = graph[N - 1].count(1)
if not edges_from1 or not edges_fromN:
print("IMPOSSIBLE")
break
if edges_from1 < edges_fromN:
start_node = 0
goal_node = N - 1
elif edges_fromN < edges_from1:
start_node = N - 1
goal_node = 0
else:
start_node = 0
goal_node = N - 1
for j in range(N):
if graph[start_node][j] == 1:
if graph[j][goal_node] == 1:
print("POSSIBLE")
raise EndLoop
print("IMPOSSIBLE")
except:
break
solve() | def solve():
while 1:
try:
N, M = list(map(int, input().split(" ")))
graph = [[None] * N for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split(" ")))
graph[a - 1][b - 1], graph[b - 1][a - 1] = 1, 1
edges_from1 = graph[0].count(1)
edges_fromN = graph[N - 1].count(1)
if not edges_from1 or not edges_fromN:
print("IMPOSSIBLE")
break
if edges_fromN < edges_from1:
start_node = N - 1
goal_node = 0
else:
start_node = 0
goal_node = N - 1
for j in range(N):
if graph[start_node][j] == 1:
if graph[j][goal_node] == 1:
print("POSSIBLE")
raise EndLoop
print("IMPOSSIBLE")
except:
break
solve() | p03645 |
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import os
from collections import OrderedDict, deque
from bisect import bisect_left, bisect_right, insort_left, insort_right
class EndLoop(Exception):
pass
def solve():
while 1:
try:
N, M = list(map(int, input().split(" ")))
Deque1 = deque()
DequeN = deque()
edges_1 = [None] * N
edges_N = [None] * N
Deque1.extend(edges_1)
DequeN.extend(edges_N)
for _ in range(M):
a, b = list(map(int, input().split(" ")))
if a == 1:
Deque1[b - 1] = True
elif b == 1:
Deque1[a - 1] = True
elif a == N:
DequeN[b - 1] = True
elif b == N:
DequeN[a - 1] = True
else:
pass
for i in range(N):
if Deque1[i] == True and DequeN[i] == True:
print("POSSIBLE")
raise EndLoop
print("IMPOSSIBLE")
break
except:
break
solve() | #!/usr/bin/python
# -*- coding: utf-8 -*-
from collections import deque
class EndLoop(Exception):
pass
def solve():
while 1:
try:
N, M = list(map(int, input().split(" ")))
Deque1 = deque()
DequeN = deque()
edges_1 = [False] * N
edges_N = [False] * N
Deque1.extend(edges_1)
DequeN.extend(edges_N)
for _ in range(M):
a, b = list(map(int, input().split(" ")))
if a == 1:
Deque1[b - 1] = True
elif b == 1:
Deque1[a - 1] = True
elif a == N:
DequeN[b - 1] = True
elif b == N:
DequeN[a - 1] = True
else:
pass
for i in range(N):
if Deque1[i] == True and DequeN[i] == True:
print("POSSIBLE")
raise EndLoop
print("IMPOSSIBLE")
break
except:
break
solve() | p03645 |
N, M = list(map(int, input().split()))
ship1 = set([])
ship2 = set([])
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1:
ship1.add(b)
elif b == N:
ship2.add(a)
if len(ship1 & ship2) == 0:
print('IMPOSSIBLE')
else:
print('POSSIBLE') | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
ship1 = set([])
ship2 = set([])
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1:
ship1.add(b)
elif b == N:
ship2.add(a)
if ship1 & ship2:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | p03645 |
n,m=list(map(int,input().split()))
l=sorted([list(map(int,input().split())) for _ in range(m)])
ans=0
a=0
for i in range(m):
if l[i][0]!=1:
a=i
break
for i in range(a):
for j in range(a,m):
if set(l[i])^set(l[j])=={1,n}:
ans=1
break
print(("POSSIBLE" if ans==1 else "IMPOSSIBLE")) | n,m=list(map(int,input().split()))
sa=set()
sb=set()
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:sa.add(b)
if b==n:sb.add(a)
print(("IMPOSSIBLE" if len(sa&sb)==0 else "POSSIBLE")) | p03645 |
def c_cat_snuke_and_a_voyage(N, M, I):
p = [False] * N # 島1と島iに辺があるならTrue,なければFalse(0-indexed)
q = [False] * N # 島iと島Nに辺があるならTrue,なければFalse(0-indexed)
for a, b in I:
if a == 1: # 出発地が島1なら
p[b] = True
elif b == N: # 目的地が島Nなら
q[a] = True
ans = 'IMPOSSIBLE'
for i in range(N):
if p[i] and q[i]:
ans = 'POSSIBLE'
break # 1つでもあればいい
return ans
N,M = [int(i) for i in input().split()]
I = [[int(i) for i in input().split()] for j in range(M)]
print((c_cat_snuke_and_a_voyage(N, M, I))) | def c_cat_snuke_and_a_voyage(N, M, I):
node1 = [False] * N # 島1と島iに辺があるならTrue, なければFalse
node2 = [False] * N # 島iと島Nに辺があるならTrue, なければFalse
for a, b in I:
if a == 1: # 出発地が島1なら
node1[b] = True
elif b == N: # 目的地が島Nなら
node2[a] = True
return 'POSSIBLE' if any([p and q for p, q in zip(node1, node2)]) else 'IMPOSSIBLE'
N, M = [int(i) for i in input().split()]
I = [[int(i) for i in input().split()] for j in range(M)]
print((c_cat_snuke_and_a_voyage(N, M, I))) | p03645 |
N,M=list(map(int,input().split()))
c1=[]
c2=[]
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
c1.append(b)
if b==N:
c2.append(a)
for i in c1:
if i in c2:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | N,M=list(map(int,input().split()))
c1=[]
c2=[]
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
c1.append(b)
if b==N:
c2.append(a)
c1=set(c1)
c2=set(c2)
if c1&c2:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | p03645 |
# ABC068 C - Cat Snuke and a Voyage
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n,m = nm()
G = [[] for _ in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
# print(G)
for g in G:
island_1toi = False
island_iton = False
for gg in g:
if gg == 0:
island_1toi = True
if gg == n-1:
island_iton = True
if island_1toi == True and island_iton == True:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
| n,m=list(map(int,input().split()))
eage=[[] for i in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
eage[a-1].append(b-1)
eage[b-1].append(a-1)
for e in eage:
i_to_1=False
i_to_n=False
for ee in e:
if ee==0:
i_to_1=True
if ee==n-1:
i_to_n=True
if i_to_1==True and i_to_n==True:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | p03645 |
n, m = list(map(int, input().split()))
p = set()
q = set()
for _ in range(m):
a, b = list(map(int, input().split()))
if a == 1:
p.add(b)
elif b == n:
q.add(a)
else:
print(("POSSIBLE" if p & q else "IMPOSSIBLE")) | n, m = input().split()
p = set()
q = set()
for _ in range(int(m)):
a, b = input().split()
if a == "1":
p.add(b)
elif b == n:
q.add(a)
else:
if p & q:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | p03645 |
e = []
n, m = list(map(int, input().split()))
for i in range(m):
e.append(tuple(map(int, input().split())))
r = False
for a, b in [t for t in e if t[0] == 1]:
if list([t for t in e if t[0] == b and t[1] == n]):
r = True
break
if r:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
| n, m = list(map(int, input().split()))
s = [False] * n
g = [False] * n
for i in range(m):
a, b = list(map(int, input().split()))
if a == 1:
s[b] = True
if b == n:
g[a] = True
ans = "IMPOSSIBLE"
for i in range(n):
if s[i] and g[i]:
ans = "POSSIBLE"
break
print(ans)
| p03645 |
N,M = list(map(int,input().split()))
l,B_s,B_l = [],[],[]
for i in range(M):
a,b = list(map(int,input().split()))
if a == 1 :
if b < N:
B_s.append(b)
elif b > N:
B_l.append(b)
l.append([a,b])
for e in l:
if e[0] in B_s and e[1] == N:
print("POSSIBLE")
break
elif e[1] in B_l and e[0] == N:
print("POSSIBLE")
break
elif e == l[-1]:
print("IMPOSSIBLE") | N,M = list(map(int,input().split()))
l_s,l_l,B_s,B_l = [],[],[],[]
for i in range(M):
a,b = list(map(int,input().split()))
if a == 1 :
if b < N:
B_s.append(b) #Nより小さい
elif b > N:
B_l.append(b) #Nより大きい
if a == N:
l_l.append(b) #Nより大きい
elif b == N:
l_s.append(a) #Nより小さい
common_1 = len(list(set(l_s) & set(B_s)))
common_2 = len(list(set(l_l) & set(B_l)))
if common_1 > 0 or common_2 > 0:
print("POSSIBLE")
else:
print("IMPOSSIBLE") | p03645 |
N, M = list(map(int, input().split()))
lst1 = []
lst2 = []
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
lst1.append(b)
if b == N:
lst2.append(a)
for x in lst1:
if lst2.count(x) >= 1:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
| N, M = list(map(int, input().split()))
s1 = set()
s2 = set()
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
s1.add(b)
if b == N:
s2.add(a)
if len(s1.intersection(s2)) > 0:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
| p03645 |
n,m=list(map(int,input().split()))
x=[]
f=0
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
if b in x:
print("POSSIBLE")
break
x.append(b)
if b==n:
if a in x:
print("POSSIBLE")
break
x.append(a)
else:
print("IMPOSSIBLE")
| n,m=list(map(int,input().split()))
x=[]
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
x.append(b)
if b==n:
x.append(a)
l=len(x)
if len(set(x))==l:
print("IMPOSSIBLE")
else:
print("POSSIBLE")
| p03645 |
n, m = list(map(int, input().split()))
f = [0]*200020
s = [0]*200020
for i in range(m):
a, b = list(map(int, input().split()))
if a == 1 or b == 1:
f[max(a, b)] = 1
if s[max(a, b)] == 1:
print("POSSIBLE")
exit()
if a == n or b == n:
s[min(a, b)] = 1
if f[min(a, b)] == 1:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") | n, m = list(map(int, input().split()))
f = {}
s = {}
for i in range(m):
a, b = list(map(int, input().split()))
if a == 1:
f[b] = 1
if b in s:
print("POSSIBLE")
exit()
if b == n:
s[a] = 1
if a in f:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") | p03645 |
N, M = list(map(int, input().split()))
c = []
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1:
c.append(b)
elif b == N:
c.append(a)
for i in range(N):
if c.count(i) == 2:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') | N, M = list(map(int, input().split()))
A = set()
B = set()
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1:
A.add(b)
elif b == N:
B.add(a)
if A & B:
print('POSSIBLE')
else:
print('IMPOSSIBLE') | p03645 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
for i , a in enumerate(A):
if X < a:
break
if i > len(A) / 2:
ans = len(A[i:])
else:
ans = len(A[:i])
print(ans)
| n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt1 = 0
cnt2 = 0
x1 = x
x2 = x
while x1 < n+1:
x1 += 1
if x1 in a:
cnt1 += 1
while x2 > 0:
x2 -= 1
if x2 in a:
cnt2 += 1
if cnt1 < cnt2:
ans = cnt1
else:
ans = cnt2
print(ans)
| p03378 |
from bisect import bisect_left
from bisect import bisect_right
N, M, X = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
index = bisect_left(A, X)
s = len(A[:index])
g = len(A[index:])
print((min(s,g))) | from bisect import bisect_left
N, M, X = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
index = bisect_left(A, X)
print((min(len(A[:index]), len(A[index:])))) | p03378 |
n,m,x=list(map(int,input().split()))
gate=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in range(1,x):
if i in gate:
cnt1+=1
for j in range(x+1,n):
if j in gate:
cnt2+=1
print((min(cnt1,cnt2))) | n,m,x=list(map(int,input().split()))
a=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in range(0,x+1):
if i in a:
cnt1+=1
for j in range(x,n+1):
if j in a:
cnt2+=1
print((min(cnt1,cnt2))) | p03378 |
def main():
N, M, X = list(map(int, input().split()))
A = [int(a) for a in input().split()]
costL = 0
for i in range(len(A)):
if A[i] < X:
costL += 1
return min(costL, M-costL)
if __name__ == '__main__':
print((main())) | def main():
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
count1 = 0
for i in range(M):
if A[i] < X: count1 += 1
return min(count1, len(A)-count1)
if __name__ == '__main__':
print((main()))
| p03378 |
import bisect
N, M, X = list(map(int, input().split()))
a = list(map(int, input().split()))
p = bisect.bisect_left(a, X)
print((min(p, M - p))) | n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
if x < a[i]:
break
else:
i += 1
print((min(i, m - i))) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
c = 0
for i in range(M):
if A[i] < X:
c += 1
print((min((len(A) - c),c)))
| import bisect
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
index = bisect.bisect_right(A, X)
print((min(index, len(A) - index)))
| p03378 |
n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
l = []
right = [l for i in a if x < i]
left = [l for i in a if x > i]
print((min(len(right), len(left)))) | n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
right = len([int(i) for i in a if x < i])
left = len([int(i) for i in a if x > i])
print((min(right, left)))
| p03378 |
n, m, x = list(map(int, input().split()))
A = list(map(int, input().split()))
import bisect
l = bisect.bisect_left(A, x)
ans = min(l, m-l)
print(ans) | n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
left = 0
right = 0
for ai in a:
if ai < x:
left += 1
else:
right += 1
print((min(left, right)))
| p03378 |
n,m,x = list(map(int,input().split()))
a = list(map(int,input().split()))
d = 0
e = 0
for i in range(0,len(a)):
if a[i] < x:
d += 1
elif a[i] > x:
e += 1
print((min(d,e))) | n,m,x = list(map(int,input().split()))
a = sorted(list(map(int,input().split())))
b = 0
c = 0
for i in range(len(a)):
if a[i] < x:
b += 1
else:
c += 1
print((min(b,c))) | p03378 |
n,m,x=list(map(int,input().split()))
l=list(map(int,input().split()))
ans1=0
ans2=0
for i in range(x+1,n):
for j in range(m):
if l[j]==i:
ans1+=1
for i in range(0,x):
for j in range(m):
if l[j]==i:
ans2+=1
print((min(ans1,ans2))) | n, m, x = list(map(int, input().split()))
nums = [0] * (n + 1)
indices = list(map(int, input().split()))
for i in indices:
nums[i] = 1
print((min(nums[:x].count(1), nums[x:].count(1))))
| p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
ctr = 0
for a in A:
if a < X:
ctr += 1
print((min(ctr, M - ctr))) | N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(M):
if A[i] > X:
print((min(i, M - i)))
break | p03378 |
n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
res1 = 0
res2 = 0
for i in a:
if i<x:
res1 += 1
else:
res2 += 1
print((min(res1, res2))) | n,m,x=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
mi=0
ma=0
for i in a:
if i<x:
mi+=1
else:
ma+=1
print((min(mi,ma))) | p03378 |
n,m,x=list(map(int,input().split()))
a=list(map(int,input().split()))
s=0
i=0
while a[i]<=x:
s+=1
i+=1
print((min(s,m-s))) | n,m,x=list(map(int,input().split()))
a=list(map(int,input().split()))
i=0
while a[i]<=x:
i+=1
print((min(i,m-i))) | p03378 |
N,M,X = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
for i in range(X,N+1):
if i in A:
cnt += 1
cntmin = cnt
cnt = 0
for i in range(X,-1,-1):
if i in A:
cnt += 1
cntmin = min(cntmin,cnt)
print(cntmin) | N,M,X = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
for i in range(M):
if X>A[i]:
cnt += 1
print((min(cnt,M-cnt))) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
min = 0
cnt_2 = 0
lists = list(range(N + 1))
for i in range(X, N + 1):
for j in range(len(A)):
if i == 0 or i == N or i == X:
continue
elif i == A[j]:
cnt += 1
for m in range(X, -1, -1):
for n in range(len(A)):
if m == 0 or m == N or m == X:
continue
elif m == A[n]:
cnt_2 += 1
if cnt > cnt_2:
min = cnt_2
elif cnt_2 > cnt:
min = cnt
print(min)
| n,m,x = list(map(int,input().split()))
a = list(map(int,input().split()))
cnt_r = 0
cnt_l = 0
road = [True]*(n+1)
for i in a:
road[i] = False
for i in range(x,n+1):
if not road[i]:
cnt_r += 1
for i in range(x,-1,-1):
if not road[i]:
cnt_l += 1
ans = min(cnt_r,cnt_l)
print(ans) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
to_left =[1 for i in range(X-1, 0, -1) if i in A]
to_right =[1 for i in range(X+1, N, 1) if i in A]
print((min(sum(to_left), sum(to_right)))) | N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
to_left =[1 for i in range(X-1, 0, -1) if i in A]
print((min(sum(to_left), M-sum(to_left)))) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
L = 0
R = 0
for a in A:
if a < X:
L += 1
else:
R += 1
print((min(L, R)))
| N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
left = 0
right = 0
for i in A:
if i < X:
left += 1
else:
right += 1
print((min(left, right)))
| p03378 |
I=lambda:list(map(int,input().split()));n,m,x=I();s=sum(a<x for a in I());print((min(s,m-s))) | n,m,*a=list(map(int,open(0).read().split()));print((min(c:=sorted(a).index(a[0]),m-c))) | p03378 |
n,m,x=list(map(int,input().split()))
a=list(map(int,input().split()))
left=0
right=0
for ai in a:
if ai<x:
left+=1
else:
right+=1
print((min(left,right))) | n,m,x=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in a:
s=sum(int(i)<x for i in a)
print((min(s,m-s))) | p03378 |
n,m,x = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
f = list([y for y in a if y>x])
if len(f) < len(a)-len(f):
print((len(f)))
else:
print((len(a)-len(f))) | n,m,x = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
f = len(list([y for y in a if y>x]))
b = len(a)-f
print((f if f < b else b)) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
to_0 = 0
if A[-1] < X:
to_0 = M
to_N = 0
elif A[0] < X < A[-1]:
for i in A:
if i < X:
to_0 += 1
to_N = M - to_0
elif X < A[0]:
to_0 = 0
to_N = M
print((min(to_0, to_N))) | n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
left = 0
right = 0
for ai in a:
if ai < x:
left += 1
else:
right += 1
print((min(left, right)))
| p03378 |
N,M,X = list(map(int,input().split()))
A = list(map(int,input().split()))
A_under = [A[i] for i in range(M) if A[i] < X]
A_upper = [A[i] for i in range(M) if A[i] > X]
print((min(len(A_under),len(A_upper)))) | N,M,X = list(map(int,input().split()))
A = list(map(int,input().split()))
cost = [0]*N
for i in A: cost[i] = 1
print((min(sum(cost[X:]),sum(cost[:X+1])))) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
costRight, costLeft = 0, 0
for i in range(X, N):
if i in A:
costRight +=1
for i in range(X, 0, -1):
if i in A:
costLeft += 1
print((min(costRight, costLeft))) | N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
costRight, costLeft = 0, 0
for a in A:
if a > X:
costRight += 1
else:
costLeft +=1
print((min(costLeft, costRight))) | p03378 |
N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
a = [0 for _ in range(N+1)]
for n in A:
a[n] = 1
print((min(sum(a[:X]), sum(a[X+1:])))) | n,m,x=list(map(int,input().split()))
s=sum(int(i)<x for i in input().split())
print((min(s,m-s))) | p03378 |
N, M, X = list(map(int,input().split()))
A = list(map(int,input().split()))
left, right = X, X
left_cost, right_cost = 0, 0
for i in range(N+1):
left -= 1
right += 1
if(left in A):
left_cost += 1
if(right in A):
right_cost += 1
print((min(left_cost, right_cost))) | N, M, X = list(map(int,input().split()))
A = list(map(int,input().split()))
l, r = 0, 0
for a in A:
if(X > a):
l += 1
else:
r += 1
print((min(l, r))) | p03378 |
from bisect import bisect_left
N, M, X = list(map(int,input().split()))
A = list(map(int,input().split()))
x = bisect_left(A, X)
print((min(len(A[x:]), len(A[:x])))) | from bisect import bisect_left
N, M, X = list(map(int,input().split()))
A = list(map(int,input().split()))
x = bisect_left(A, X)
print((min(x, M-x))) | p03378 |
N, M, X = list(map(int, input().split()))
m = [0] * (N + 1)
a = list(map(int, input().split()))
for i in a:
m[i] = 1
print((min(sum(m[:X]), sum(m[X:])))) | N, M, X = list(map(int, input().split()))
A = list(map(int, input().split()))
l = 0
r = 0
for a in A:
if a < X:
l += 1
else:
r += 1
print((min(l, r))) | p03378 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
N,M,X = list(map(int,input().split())) #整数の入力
a = list(map(int,input().split()))
#検問所の入力
b=[]
c=[]
for i in range(X+1,N): #X+1からNの範囲の整数について
if i in a: #ある整数が検問所の整数として存在する
b.append(1)
for i in range(1,X): #1からX-1の範囲の整数について
if i in a: #ある整数が検問所の整数として存在する
c.append(1)
print((min(sum(b),sum(c)))) | N,M,X = list(map(int,input().split()))
A = list(map(int,input().split()))
Rcnt = 0
Lcnt = 0
for i in range(X,N+1):
if i in A:
Rcnt += 1
for i in range(X):
if i in A:
Lcnt += 1
print((min(Lcnt,Rcnt))) | p03378 |
n, m, x = list(map(int, input().split()))
A = [int(i) for i in input().split() if int(i) < x]
print((min(len(A), m - len(A)))) | n, m, x = list(map(int, input().split()))
A = [int(i) for i in input().split() if int(i) < x]
print((len(A) if m - len(A) > len(A) else m - len(A))) | p03378 |
n, m, x = list(map(int, input().split()))
al = list(map(int, input().split()))
a1 = 0
for a in al:
if 0 <= a <= x:
a1 += 1
print((min(a1, m - a1)))
| n, m, x = list(map(int, input().split()))
al = list(map(int, input().split()))
t = len([i for i in al if i < x])
print((min(t, m-t))) | p03378 |
n,m,x=input().split()
n,m,x=int(n),int(m),int(x)
a1=input().split()
a2=[]
for i in range(n+1):
if str(i) in a1:
a2.append(1)
else:
a2.append(0)
print((min([sum(a2[:x]),sum(a2[x+1:])])))
| n,m,x=list(map(int,input().split()))
a=[int(i) for i in input().split()]
j=0
for i in range(m):
if a[i]>x:
j=i
break
print((min(len(a)-j,j)))
| p03378 |
import math
n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
maxconb=0
ans=[0,0]
def comb(a,b):
return math.factorial(a)//(math.factorial(a-b) * math.factorial(b))
def mid(a):
if(a%2!=0):
return (a+1)//2
else:
return a//2
#print(a)
for i in range(n-1):
ai=a[i]
temp=list([abs(x-mid(ai)) for x in a[i+1:]])
# print(temp)
bi=a[temp.index(min(temp))+i+1]
# print(str(ai)+":"+str(bi))
c=comb(ai,bi)
if(maxconb<c):
maxconb=c
ans=[ai,bi]
print((str(ans[0])+" "+str(ans[1]))) | n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
def mid(a):
if(a%2!=0):
return (a+1)//2
else:
return a//2
ai=a[0]
temp=list([abs(x-mid(ai)) for x in a[1:]])
bi=a[temp.index(min(temp))+1]
print((str(ai)+" "+str(bi))) | p03380 |
def nCr(n,r):
if n < 0 or r < 0 or n < r: return 0
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
# 分子のn*(n-1)*...がr個分続くやつ
numerator = [n-r+k+1 for k in range(r)]
# 分母：r!=r*(r-1)*...*3*2の要素
denominator = [k+1 for k in range(r)]
# 分母の要素で割れる部分を割っていく部分
for p in range(2, r+1):
# 分母は1,2,3,...rのようになっており、1は意味がないのでスキップした形か
pivot = denominator[p-1]
if pivot > 1:
# 分子のX番目と分母のX-offset番目が共通の約数を持つということだと思う。piv分ずれているのだから、pivの倍数というところか
offset = (n-r) % p
for k in range(p-1, r, p):
# 約分できる要素について割る
numerator[k - offset] /= pivot
denominator[k] /= pivot
ret = 1
for k in range(r):
if numerator[k] > 1: ret *= int(numerator[k])
return ret
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse = True)
max_comb = 0
n = 0
r = 0
n = a[0]
for j in range(1, N):
if max_comb < nCr(a[0],a[j]):
max_comb = nCr(a[0],a[j])
r = a[j]
ans = str(n) + " " + str(r)
print(ans)
|
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse = True)
tmp = 10 ** 9
ans = 1
for i in range(1,N):
if abs(a[0]/2 - a[i]) < tmp:
tmp = abs(a[0]/2 - a[i])
ans = a[i]
s = str(a[0]) + " " + str(ans)
print(s)
| p03380 |
# coding: utf-8
# hello worldと表示する
# coding: utf-8
# hello worldと表示する
# coding: utf-8
# hello worldと表示する
"""def comb2(n,r):
if n == 0 or r == 0:
return 1
return comb2(n-1,r-1)+comb2(n-1,r)
def fact(n):
if n==0:
return 1
return n*fact(n-1)
nCr = {}
def cmb(n, r):
if r == 0 or r == n: return 1
if r == 1: return n
if (n,r) in nCr: return nCr[(n,r)]
nCr[(n,r)] = cmb(n-1,r) + cmb(n-1,r-1)
return nCr[(n,r)]"""
def ncr(n, r):
r = min(r, n - r)
if r == 0: return 1;
if r == 1: return n;
numerator = [n - r + i + 1 for i in range(r)]
denominator = [i + 1 for i in range(r)]
for p in range(2, r + 1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p - 1, r, p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= numerator[k]
return result
#a = cmb(n,r)
ans=0
N=int(eval(input()))
s=list(map(int,input().split()))
t=max(s)
for i in s:
c=ncr(t,i)
# c=fact(t)/(fact(i)*fact(t-i))
if ans<c and t!=i:
ans=c
an=i
print((str(t)+" "+str(an)))
| import math
def c(n,r):
r=min(r,n-r)
a=math.factorial(n)//(math.factorial(r)*math.factorial(n-r))
return a
q=1
N=int(eval(input()))
s=list(map(int,input().split()))
n=max(s)
for i in s:
t=c(n,i)
if q<=t:
q=t
w=str(n)+" "+str(i)
print(w)
| p03380 |
import math
def c(n,r):
r=min(r,n-r)
a=math.factorial(n)//(math.factorial(r)*math.factorial(n-r))
return a
q=1
N=int(eval(input()))
s=list(map(int,input().split()))
n=max(s)
for i in s:
t=c(n,i)
if q<=t:
q=t
w=str(n)+" "+str(i)
print(w)
| N=int(eval(input()))
s=list(map(int,input().split()))
n=max(s)
s.remove(n)
q=n
for i in s:
t=abs(n/2-i)
if q>=t:
q=t
w=str(n)+" "+str(i)
print(w)
| p03380 |
import math
def comb(n,r):
return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
if N==2:
return str(max(a))+" "+str(min(a))
k = a[N//2-1]
kk = a[N//2]
A = a[N-1]
if comb(A,k) > comb(A,kk):
return str(A)+" "+str(k)
return str(a[N-1])+" "+str(kk)
print((main()))
|
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
A = a.pop()
k = A/2
for i in a:
if k - i == 0:
B = i
break
else:
sa = k - i
if sa < 0:
if abs(B-k)>abs(sa):
B = i
break
B = i
return str(A)+" "+str(B)
print((main()))
| p03380 |
from operator import mul
from functools import reduce
def calc_comb(n, r):
r = min(r, n - r)
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
def main():
n = int(eval(input()))
a = [int(an) for an in input().split()]
a.sort()
ans = 0
max_comb = 0
sub_set = set()
for i in range(n - 1):
sub = a[-1] - a[i]
if not sub in sub_set:
sub_set.add(sub)
comb = calc_comb(a[-1], a[i])
if comb > max_comb:
max_comb = comb
ans = a[i]
print(f'{a[-1]} {ans}')
if __name__ == '__main__':
main()
| def main():
_ = int(eval(input()))
a = [int(an) for an in input().split()]
a.sort()
half_val = -(-a[-1] // 2)
dist_list = [abs(half_val - an) for an in a[:-1]]
min_index = dist_list.index(min(dist_list))
print(f'{a[-1]} {a[min_index]}')
if __name__ == '__main__':
main() | p03380 |
n = int(eval(input()))
l = list(map(int,input().split()))
l.sort()
a = l[-1]
j = 0
while l[j] < int((a+1)/2):
j += 1
else:
if l[j] - int((a+1)/2) < int((a+1)/2) - l[j-1]:
b = l[j]
else:
b = l[j-1]
print(("{} {}".format(a,b))) | N = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
n = a[-1]
for i in range(N):
if a[i]>=n/2:
break
if n-a[i]>min(a[i-1],n-a[i-1]):
r = a[i]
else:
r = a[i-1]
print(('{} {}'.format(n,r))) | p03380 |
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
n=ri()
a=rl()
a.sort()
#nCr % MOD
def cmb(n, r, MOD=0):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1,r,p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k])
if MOD != 0:
result %= MOD
return result
import bisect
ans = []
for i in range(1,min(n,len(str(n))+3)):
p = a[-i]
p2 = p/2
q_i = bisect.bisect_left(a,p2)
if ((a[q_i]-p2) > (p2 - a[q_i-1])) or p==a[q_i] and q_i != 0:
q_i -= 1
q = a[q_i]
ans.append([cmb(p,q),p,q])
ans.sort(key=lambda x:x[0],reverse=True)
print(*ans[0][1:])
| ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
n=ri()
a=rl()
a.sort()
import bisect
p = a[-1]
p2 = p/2
q_i = bisect.bisect_left(a,p2)
if ((a[q_i]-p2) > (p2 - a[q_i-1]) or p==a[q_i]) and q_i != 0:
q_i -= 1
q = a[q_i]
print(p,q)
| p03380 |
def comb(n,k):
nCk = 1
MOD = 10**9+7
# X
for i in range(n-k+1, n+1):
nCk *= i
nCk %= MOD
# Y
for i in range(1,k+1):
nCk *= pow(i,MOD-2,MOD)
nCk %= MOD
return nCk
n = int(eval(input()))
a = list(map(int, input().split()))
ai = max(a)
aj = -1
nck = 0
for i in range(n):
tmp = comb(ai, a[i])
if nck <= tmp:
nck = tmp
aj = a[i]
print((str(ai) + " " + str(aj))) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ai = a[-1]
aj = a[0]
center = ai // 2
diff = 10**10
# print("-----------")
# print(center)
for i in range(n-1):
if abs(center - a[i]) <= diff and aj < a[i]:
diff = abs(center - a[i])
aj = a[i]
# print(diff)
# print(aj)
# print("----")
print((str(ai) + " " + str(aj))) | p03380 |
n = int(eval(input()))
a=list(map(int,input().split()))
b = sorted(a,reverse=True)
def binary_search(x):
l,r = 0,n-1
while l+1<r:
i = (l+r)//2
if b[i] > x:
l = i
else:
r = i
if abs(b[l]-x)>=abs(b[l+1]-x):
l += 1
return b[l]
def comb(n,r):
r = min(r,n-r)
ret = 1
for i in range(1,r+1):
ret *= (n+1-i)
ret /= i
return int(ret)
ans = ""
m = 0
for c in b[:1]:
if m > c**(c//2):
break
r = binary_search(c/2)
comb_c_r = comb(c,r)
if m < comb_c_r:
m = comb_c_r
ans = str(c)+" "+str(r)
print(ans) | n = int(eval(input()))
a=list(map(int,input().split()))
b = sorted(a,reverse=True)
def binary_search(x):
l,r = 0,n-1
while l+1<r:
i = (l+r)//2
if b[i] > x:
l = i
else:
r = i
if abs(b[l]-x)>=abs(b[l+1]-x):
l += 1
return b[l]
def comb(n,r):
r = min(r,n-r)
ret = 1
for i in range(1,r+1):
ret *= (n+1-i)
ret /= i
return int(ret)
ans = ""
m = 0
for c in b[:1]:
r = binary_search(c/2)
#comb_c_r = comb(c,r)
#if m < comb_c_r:
#m = comb_c_r
ans = str(c)+" "+str(r)
print(ans) | p03380 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.