s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s413149893 | p03573 | u973663980 | 1551398211 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 111 | a=input()
b=input()
c=input()
if a == b:
print(int(c))
elif a == c:
print(int(b))
elif b == c:
print(int(a)) |
s033155453 | p03573 | u973663980 | 1551398180 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 121 | a=input()
b=input()
c=input()
if a == b:
print(int(c))
elif a == c:
print(int(b))
elif b == c:
print(int(a)) |
s817934404 | p03573 | u973663980 | 1551397956 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 120 | a=input()
b=input()
c=input()
if a == b:
print(int(c))
elif a == c:
print(int(b))
elif b == c:
print(int(a)) |
s139008181 | p03573 | u973663980 | 1551397575 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 135 | a=input()
b=input()
c=input()
s1=set(a)
s2=set(b)
s3=set(c)
if s1&s2:
print(s3)
elif s1&s3:
print(s2)
elif s2&s3:
print(s1) |
s474481305 | p03573 | u652081898 | 1550850283 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 97 | a, b, c = map(int, input())
if a == b:
print(c)
elif b == c:
print(a)
else:
print(b) |
s505318530 | p03573 | u676496404 | 1549830744 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 87 | numlist = list(input().split())
print(sorted(numlist,key=lambda x:numlist.sount(x))[0]) |
s458037864 | p03573 | u951601135 | 1549338338 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 112 | l=list(map(int,input().split()))
if(l[0]==l[1]):
print(l[2])
elif(l[1]==l[2]):
print(l[0]):
else:print(l[1]) |
s335292914 | p03573 | u951601135 | 1549338315 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 106 | l=map(int,input().split())
if(l[0]==l[1]):
print(l[2])
elif(l[1]==l[2]):
print(l[0]):
else:print(l[1]) |
s944114193 | p03573 | u993642190 | 1547879843 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 138 | a,b,c = [int(i) for i in input().split()]
if ([a,b,c].count(a) = 1) :
print(a)
elif ([a,b,c].count(b) = 1) :
print(b)
else :
print(c)
|
s047255484 | p03573 | u865067466 | 1547245170 | Python | Python (3.4.3) | py | Runtime Error | 152 | 12440 | 561 | import numpy as np
H, W = map(int, input().split(' '))
in_table = []
for h in range(H):
line = [c for c in input()]
in_table.append(line)
result_table = np.zeros((H, W), dtype=np.int8)
for y, line in enumerate(in_table):
for x, cell in enumerate(line):
if cell == '#':
result_table... |
s508563579 | p03573 | u239342230 | 1546415128 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 52 | x=input().split()
y=set(x)
print(y[x.count(y[0])-1]) |
s588343749 | p03573 | u726439578 | 1546132803 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 88 | a=map(int,input().split())
a.sort()
if a[1]==a[0]:
print(a[2])
else:
print(a[0]) |
s306956207 | p03573 | u272377260 | 1544849187 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 78 | a, b, c = map(int, input().split())
if a == b:
print(c)
elce:
print(b) |
s029701645 | p03573 | u928784113 | 1544421354 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 118 | # -*- coding: utf-8 -*-
A,B,C =map(int,input().split())
if A == B:
print(C)
elif B == C:
print(A)
else:
print()B |
s133738235 | p03573 | u325264482 | 1541469342 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 110 | A, B, C = list(map(int, input().split()))
if A == B:
print(C)
elif A == C
print(B)
else:
print(A) |
s865603545 | p03573 | u824237520 | 1541082191 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 1075 | n, k = map(int, input().split())
x = [0 for _ in range(n)]
y = [0 for _ in range(n)]
for i in range(n):
x[i], y[i] = map(int, input().split())
min_x = min(x)
min_y = min(y)
for i in range(n):
x[i] -= min_x
y[i] -= min_y
sx = sorted(x)
sy = sorted(y)
if n == k:
print(sx[n - 1] * sy[n - 1])
exit()... |
s069415067 | p03573 | u658993896 | 1540748734 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 93 | A,B,C=list(map(int,input()))
if A==B:
print(C)
elif B==C:
print(A)
else:
print(B) |
s736747774 | p03573 | u131405882 | 1540666223 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 181 | a,b,c = map(int, input().split())
if a==b:
print(c)
if a==c:
print(b)
else:
print(a)
a,b,c = map(int, input().split())
if a==b:
print(c)
elif a==c:
print(b)
else:
print(a)
|
s479959855 | p03573 | u131405882 | 1540665816 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | a,b,c = map(int, input().split())
if a=b:
print(c)
if a=c:
print(b)
else:
print(a) |
s566179277 | p03573 | u853900545 | 1539315673 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | a,b,c=map(jnt,input().split())
if a==b:
print(c)
elif b==c:
print(a)
else:
print(b)
|
s799197080 | p03573 | u853900545 | 1539315639 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 93 | a,b,c=map(jnt,input().split())
if a=b:
print(c)
elif b=c:
print(a)
else:
print(b) |
s092502892 | p03573 | u790877102 | 1538616027 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 129 | a = [int(input()) for i in range(1,4) ]
if a[1]==a[2]:
print(a[3])
elif a[1]==a[3]:
print(a[2])
else:
print(a[1]) |
s028663134 | p03573 | u274045692 | 1538076006 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 123 | a, b, c = map(int, input().split())
d = a + b + c
if a = b:
print(c)
elif b = c:
print(a)
elif c = a:
print(b) |
s091772326 | p03573 | u601522790 | 1538075529 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 102 | a,b,c = map(int,input().split())
if a == b
print(c)
else if a == c
print(b)
else if b == c
print(a) |
s086502220 | p03573 | u138486156 | 1537461665 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 113 | a = list(map(int, input().split()))
b = set(a)
for x in a:
if a.count(x) == b.count(x):
print(x)
exit() |
s089995833 | p03573 | u108234374 | 1536720764 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 178 | k,s=map(int,input().split(" "))
ans=0
for x in range(k+1):
for y in range(x, k+1):
for z in range(y, k+1):
t = x+y+z
if t == s:
ans += 1
print(ans)
|
s613024319 | p03573 | u513081876 | 1535172891 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 516 | def solve():
H, W = map(int, input().split())
a = [list("."+input()+".") for _ in [0]*H]
a.insert(0, list("."*(W+2)))
a.append(list("."*(W+2)))
result = []
for y in range(1, H+1):
for x in range(1, W+1):
if a[y][x] == "#":
result.append("#")
else... |
s674099204 | p03573 | u102126195 | 1534727395 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 89 | a, b, c = map(int, inpu())
if a == b:
print(c)
elif b == c:
print(a)
else:
print(b) |
s482507893 | p03573 | u366644013 | 1531701189 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | a = map(int, input())
a.sort()
if a == b:
print(c)
else:
print(a) |
s307066381 | p03573 | u506302470 | 1529861815 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | A,B,C=map(int,intpu().split())
if A==B:
print(C)
if B==C:
print(B)
if A==C:
print(A) |
s300639880 | p03573 | u702582248 | 1522554911 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | a=input().split()
print(a[0] if a[1] == a[2] else a[1] a[0] == a[2] else a[2]) |
s782485931 | p03573 | u729133443 | 1521532894 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | a=input().split()
a.sort()
print(a[4] if a[2]==a[3] else a[2]) |
s604707967 | p03573 | u729133443 | 1521532468 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | a=list(input()).sort
print(a[0] if a[0]!=a[1] else a[2]) |
s722739841 | p03573 | u729133443 | 1521532231 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | s=list(input)
a=[i for i in set(s) if s.count(i)>1]
print(a[0]) |
s521829894 | p03573 | u729707098 | 1521498789 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 665 | def connect(blist, a):
x = []
for i in range(len(blist)):
if blist[i][0]==a:
x.append(blist[i][1])
elif blist[i][0]>a:
break
for j in range(len(blist)):
if blist[j][1]==a:
x.append(blist[j][0])
return(x)
n,m = (int(i) for i in input().split())
y = [[int(i) for i in input().split()] for i in range(m)... |
s546015477 | p03573 | u075012704 | 1520475938 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 765 | N, K = map(int, input().split())
XY = []
YX = []
for i in range(N):
x, y = map(int, input().split())
XY.append([x, y, i])
YX.append([y, x, i])
XY.sort()
YX.sort()
x_order = {}
for xo, p in enumerate(XY):
x, y, i = p
x_order[i] = xo
cums = [[0 for j in range(N+1)] for i in range(N+1)]
for i in rang... |
s539521196 | p03573 | u870092796 | 1518743056 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 646 | N,M=map(int,input().split())
pair=[list(map(lambda x:int(x)-1,input().split())) for _ in range(M)]
graph=[[0]*N for _ in range(N)] #隣接行列の初期化
for p in pair:
graph[p[0]][p[1]]= graph[p[1]][p[0]]=1
def DFS(v):
if visited[v]:
return
visited[v]=True
for j in [j for j,v2 in enumerate(graph[v]) if v2==1]:
DFS(j)... |
s249322037 | p03573 | u870092796 | 1518742895 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 646 | N,M=map(int,input().split())
pair=[list(map(lambda x:int(x)-1,input().split())) for _ in range(M)]
graph=[[0]*N for _ in range(N)] #隣接行列の初期化
for p in pair:
graph[p[0]][p[1]]= graph[p[1]][p[0]]=1
def DFS(v):
if visited[v]:
return
visited[v]=True
for i in [i for i,v2 in enumerate(graph[v]) if v2==1]:
DFS(i)... |
s476605628 | p03573 | u870092796 | 1518742843 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 658 | N,M=map(int,input().split())
pair=[list(map(lambda x:int(x)-1,input().split())) for _ in range(M)]
graph=[[0]*N for _ in range(N)] #隣接行列の初期化
print(pair)
for p in pair:
graph[p[0]][p[1]]= graph[p[1]][p[0]]=1
def DFS(v):
if visited[v]:
return
visited[v]=True
for i in [i for i,v2 in enumerate(graph[v]) if v2==... |
s617454769 | p03573 | u870092796 | 1518742797 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 667 | N,M=map(int,input().split())
pair=[list(map(lambda x:int(x)-1,input().split())) for _ in range(M)]
graph=[[0]*N for _ in range(N)] #隣接行列の初期化
print(pair)
for p in pair:
graph[p[0]][p[1]]= graph[p[1]][p[0]]=1
def DFS(v):
if visited[v]:
return
visited[v]=True
for i in [i for i,v2 in enumerate(graph[v]) if v2==... |
s167139311 | p03573 | u227254381 | 1518658889 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 181 | l = map(int, raw_input().split())
if l[0] != l[1] and l[0] == l[2]:
print(l[1])
elif l[0] != l[1] and l[1] == l[2]:
print(l[0])
elif l[0] == l[1] and l[1] != l[2]:
print(l[2]) |
s022176803 | p03573 | u978494963 | 1517693545 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | a = list(map(lambda x: int(x), input().split(" ")))
b = list(set(a))
print(a-b) |
s951622582 | p03573 | u707500405 | 1517090013 | Python | Python (3.4.3) | py | Runtime Error | 336 | 22320 | 570 | from itertools import combinations as comb
import numpy as np
N, K = map(int, input().split())
ans = 10 ** 18 + 1
choice = min(K, 4)
ps = np.array([list(map(int, input().split())) for i in range(N)])
for idxs in comb(range(N), choice):
rep_ps = ps[idxs, :]
x_max = rep_ps[:, 0].max()
y_max = rep_ps[:, 1].max()
x_min... |
s715829463 | p03573 | u257974487 | 1512926927 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 459 | h, w = map(int, input().split())
S = [list(input()) for i in range(h)]
for i in range(h):
for j in range(w):
if S[i][j] == '#':
continue
cnt = 0
for dx in [-1, 0, 1]:
for dy in [-1, 0, 1]:
if not 0 <= i+dy < h or not 0 <= j+dx < w:
... |
s396826427 | p03573 | u618512227 | 1512854666 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 93 | a,b,c = int(input().split())
if a==b:
print(c)
elif b==c:
print(a)
else:
print(b) |
s557564959 | p03573 | u165988235 | 1511500194 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 635 | # coding:utf-8
H,W = map(int,input().split())
A = [[0 for i in range(W)] for j in range(H)]
ans = [[0 for i in range(W)] for j in range(H)]
B = [0] * H
for i in range(H):
B[i] = input()
for i in range(H):
char = list(B[i])
for j in range(W):
A[i][j] = char[j]
for i in range(H):
for j in range(W):
if A[i][j... |
s884636398 | p03573 | u019584841 | 1511453892 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 93 | a,b,c=map(int(input().split(" ")))
if a==b:
print(c)
elif a==c:
print(b)
else:
print(a) |
s472190759 | p03573 | u456806668 | 1511228683 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3492 | 1619 | import copy
def set(adjacent,edge):
for x in edge:
adjacent[x[0]].append(x[1])
adjacent[x[1]].append(x[0])
def search(goal,path):
n = path[len(path) - 1]
if n == goal:
print(path)
else:
for x in adjacent[n]:
if x not in path:
path.append... |
s060307987 | p03573 | u257974487 | 1511046028 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 97 | A,B,C = map(int,input().split())
if A == B:
print(C)
elif B == C:
print(A)
else:
print(B) |
s542886871 | p03573 | u092650292 | 1509556489 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2696 | 758 | N,K = map(int, raw_input().split(" "))
points = []
pointsx = []
pointsy = []
smin = 0
for i in range(N):
x,y = map(int, raw_input().split(" "))
pointsx.append(x)
pointsy.append(y)
spx = sorted(pointsx)
for i in range(N-K+1):
for h in range(N-K-i+1):
yneed = []
for k in range(N):
... |
s717576973 | p03573 | u351426847 | 1509374059 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 135 | # -*- coding: utf-8 -*-
A,B,C = map(int, raw_input().split())
if A == B:
print(C):
if A == C:
print(B)
if B == C:
print(A)
|
s144410116 | p03573 | u959470438 | 1509254529 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 565 | H, W = map(int, input().split())
S = [input() for i in range(H)]
ans = []
for i in S:
ans.append(list(i))
dxy = [(-1, -1), (-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1)]
for y in range(H):
for x in range(W):
if S[y][x] == '#':
continue
c = 0
for dx, dy in dxy:... |
s334380663 | p03573 | u396368249 | 1509228538 | Python | Python (3.4.3) | py | Runtime Error | 459 | 26640 | 380 | # -*- coding: utf-8 -*-
import sys, copy, math, itertools
from copy import *
from collections import deque
import numpy as np
from heapq import *
from bisect import *
import scipy as sp
from scipy.optimize import linprog
from scipy import ceil, ifft
from scipy.fftpack import fft
A, B, C = list( map(int, input().split(... |
s512562831 | p03573 | u396368249 | 1509228203 | Python | Python (3.4.3) | py | Runtime Error | 232 | 17436 | 382 | # -*- coding: utf-8 -*-
import sys, copy, math, itertools
from copy import *
from collections import deque
import numpy as np
from heapq import *
from bisect import *
import scipy as sp
from scipy.optimize import linprog
#from scipy import ceil, ifft
#from scipy.fftpack import fft
A, B, C = list( map(int, input().spli... |
s834959449 | p03573 | u396368249 | 1509228094 | Python | Python (3.4.3) | py | Runtime Error | 420 | 27620 | 455 | # -*- coding: utf-8 -*-
import sys, copy, math, itertools
from copy import *
from collections import deque
import numpy as np
from heapq import *
from bisect import *
import scipy as sp
from scipy.optimize import linprog
from scipy import ceil, ifft
from scipy.fftpack import fft
# 読み込み
a = int( input() )
b, c = list( ... |
s029875581 | p03573 | u355798276 | 1509219732 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 135 | ary = map(int, input().split())
if ary[0] == ary[1]:
print(ary[2])
elif ary[0] == ary[2]:
print(ary[1])
else:
print(ary[0]) |
s919963606 | p03573 | u207707177 | 1509169523 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3192 | 1455 | HM = input().split()
H, M = [int(HM[i]) for i in range(len(HM))]
S = [input() for i in range(H)]
print(S)
#print(T[0][1])
#S2 = list([S[i] for i in range(H)] for j in range(M))
S2 = []
for i in range(H):
S2.append(list(S[i]))
print(S2)
def minesweeper():
for i in range(H):
for j in range(M):
... |
s819218655 | p03573 | u887153853 | 1509141031 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 111 | t = input().split())
if t[0] == t[1]:
print(t[2])
elif t[0] == t[2]:
print(t[1])
else:
print(t[0]) |
s910942794 | p03573 | u887153853 | 1509140518 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 68 | if A == B:
print(C)
elif A == C:
print(B)
else:
print(A) |
s860687894 | p03573 | u172403670 | 1509041784 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 95 | a,b,c=map(int,input(),split())
if a ==b:
print(c)
elce:
if a == c:
print(b)
else:
print(a) |
s647600011 | p03573 | u871334392 | 1508857059 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 40 | if input[0]==input[1]:
print(input[2]) |
s810002868 | p03573 | u149580849 | 1508827037 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 149 | a, b, c = map(int, input().split(''))
if (a == b):
print(c)
exit()
if (b == c):
print(a)
exit()
if (a == c):
print(b)
exit() |
s785997226 | p03573 | u522949850 | 1508785185 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 120 | A = int(input())
B = int(input())
C = int(input())
if A == B:
print(C)
elif A == C:
print(B)
else:
print(A) |
s228991004 | p03573 | u519078363 | 1508715818 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 388 | def check(t):
return 1 if t is '#' else 0
def main(H, W, S):
for i in range(H):
for j in range(W):
if S[i][j] is '.':
S[i][j] = check(S[i][max(j-1, 0)]) + check(S[i][min(j+1, W-1)]) + check(S[max(i-1, 0)][j]) + check(S[min(i+1, H-1)][j])
return S
H, W = map(int, in... |
s539595602 | p03573 | u519078363 | 1508712646 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 59 | def main(argv):
for v in argv:
print(v)
main() |
s157797333 | p03573 | u170839788 | 1508618295 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 634 | area=19000000000000000000
def check(x1,y1,x2,y2,x3,y3,x4,y4,k):
global area
atot = abs((x1-x3)*(y1-y3))
cnt=0
for i,j in a:
a1=abs((x1-i)*(y1-j))
a2 = abs((x2 - i) * (y2 - j))
a3 = abs((x3 - i) * (y3 - j))
a4 = abs((x4 - i) * (y4 - j))
if a1+a2+a3+a4==atot:
... |
s995592099 | p03573 | u170950600 | 1508336475 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 1 | a |
s813914917 | p03573 | u886545507 | 1508333191 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2692 | 371 | #ABC075B
h,w=map(int,raw_input().split())
l=[]
for i in xrange(h):
l.append(list(raw_input()))
for y in xrange(h):
for x in xrange(w):
if l[y][x]=='#':
continue
cnt=0
for dy in [-1,0,1]:
for dx in [-1,0,1]:
ny=y+dy
nx=x+dx
if 0<=ny<h and 0<=nx<w:
if l[ny][nx]=='#':
cnt+=1
l[y][x]... |
s406077389 | p03573 | u768951609 | 1508134764 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2696 | 505 | N,M=map(int,raw_input().split(' '))
g=[[False for i in range(N)] for j in range(N)]
ab=[()]*N
v=[False]*N
def dfs(n):
v[n]=True
for i in range(N):
if g[n][i]==True and v[i]==False:
dfs(i)
for i in range(M):
a,b=map(int,raw_input().split(' '))
a-=1
b-=1
g[a][b]=g[b][a]=True... |
s533076669 | p03573 | u678875535 | 1508121325 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 149 | #!/usr/bin/env python
a, b, c = map(int, input().split())
if a == b:
print(c)
elif b == c:
print(a)
elif c == a:
print(b)
else
pass |
s743607040 | p03573 | u734749411 | 1508108840 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 592 | H, W = map(int, input().split())
table = []
table.append(list("_" * (W + 2)))
for _ in range(H):
table.append(list("_" + input() + "_"))
table.append(list("_" * (W + 2)))
for h in range(1, H + 1):
for w in range(1, W + 1):
if table[h][w] == "#":
continue
count = 0
for _h in ... |
s648651923 | p03573 | u734749411 | 1508108770 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 625 | H, W = map(int, input().split())
table = []
table.append(list("_" * (W + 2)))
for _ in range(H):
table.append(list("_" + input() + "_"))
table.append(list("_" * (W + 2)))
for h in range(1, H + 1):
for w in range(1, W + 1):
if table[h][w] == "#":
continue
count = 0
print(h, w... |
s550501607 | p03573 | u163703551 | 1508035262 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 390 | import sys
from collections import Counter
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
n = read_int_list()
c = Counter(n... |
s945653107 | p03573 | u163703551 | 1508035125 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 131 | n = list(map(int, input().split()))
c = Counter(n)
for i in c:
if c[i] == 1:
res = i
print(res) |
s537263429 | p03573 | u499259667 | 1508034936 | Python | Python (3.4.3) | py | Runtime Error | 146 | 12500 | 1079 | import numpy as np
H, W = map(int, input().split())
arr=np.array([])
s=0
while s != H:
li=list(input())
li=np.array(li)
arr=np.hstack((arr,li))
s+=1
arr=arr.reshape((H,W))
count=0
def check(x,y):
global count
if arr[x,y] == "#":
count+=1
for x in range(H):
stri=""
for y in range(W):
... |
s819416082 | p03573 | u499259667 | 1508034213 | Python | Python (2.7.6) | py | Runtime Error | 638 | 12444 | 1094 | import numpy as np
H, W = map(int, raw_input().split())
arr=np.array([])
s=0
while s != H:
li=list(raw_input())
li=np.array(li)
arr=np.hstack((arr,li))
s+=1
arr=arr.reshape((H,W))
count=0
def check(x,y):
import __main__
if arr[x,y] == "#":
__main__.count+=1
for x in range(H):
stri=""
... |
s359025552 | p03573 | u163703551 | 1508034182 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 412 | import sys
from collections import Counter
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
n = read_int_list()
c = Counter(n... |
s140957842 | p03573 | u163703551 | 1508033301 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 402 | import sys
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
a, b, c = read_int_list()
if a != b and a == c:
print(b)... |
s810569951 | p03573 | u779602548 | 1508033176 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 888 | #https://beta.atcoder.jp/contests/abc075
# -*- coding: utf-8 -*-
from collections import Counter
import sys
n,m = map(int,input().split())
line = []
for _ in range(m):
line.append(list(map(int,input().split())))
line_count = []
for i in line:
line_count.append(i[0])
line_count.append(i[1])
line_count = Co... |
s736134423 | p03573 | u779602548 | 1508033148 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 888 | #https://beta.atcoder.jp/contests/abc075
# -*- coding: utf-8 -*-
from collections import Counter
import sys
n,m = map(int,input().split())
line = []
for _ in range(m):
line.append(list(map(int,input().split())))
line_count = []
for i in line:
line_count.append(i[0])
line_count.append(i[1])
line_count = Co... |
s105289798 | p03573 | u596276291 | 1508033062 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38640 | 2058 | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")
memo1 = {}
memo2 = {}
def ok(y1, y2, x1, x2, yd, yd2, xd, xd2, K):
... |
s104690225 | p03573 | u163703551 | 1508032910 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 380 | import sys
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
a, b, c = read_int_list()
if a == b:
print(c)
elif a... |
s014870522 | p03573 | u163703551 | 1508032717 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 383 | import sys
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
a, b, c = read_int_list()
if a == b:
print(c)
if a =... |
s176735817 | p03573 | u466331465 | 1508032074 | Python | Python (3.4.3) | py | Runtime Error | 755 | 14164 | 139 | import numpy as np
l = map(int, input().split())
if l[0]==l[1]:
print(l[2])
elif l[0] ==l[2]:
print(l[1])
elif l[1] ==l[2]:
print(l[0]) |
s084918301 | p03573 | u466331465 | 1508031911 | Python | Python (3.4.3) | py | Runtime Error | 726 | 15432 | 143 | import numpy as np
l = map(int, raw_input().split())
if l[0]==l[1]:
print(l[2])
elif l[0] ==l[2]:
print(l[1])
elif l[1] ==l[2]:
print(l[0]) |
s419392897 | p03573 | u466331465 | 1508031816 | Python | Python (3.4.3) | py | Runtime Error | 256 | 12652 | 146 | import numpy as np
l = map(int, raw_input().split())
if l[0]==l[1]:
print(l[2])
elif l[0] ==l[2]:
print(l[1])
elif l[1] ==l[2]:
print(l[0]) |
s707393924 | p03573 | u552668967 | 1508031430 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2696 | 597 | from sys import stdin
n,k = map(int,stdin.readline().split())
a = []
for i in xrange(n):
a.append(map(int,stdin.readline().split()))
def solve(i,j):
cnt = 0
minx = min(a[i][0],a[j][0])
maxx = max(a[i][0],a[j][0])
miny = min(a[i][1],a[j][1])
maxy = max(a[i][1],a[j][1])
#print "solving",i,j,minx,maxx,miny,maxy
f... |
s968601732 | p03573 | u104922648 | 1508031403 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 150 | # -*- coding: UTF-8 -*-
nums = input().split()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
set_nums.remove(other)
print(set_nums[0]) |
s903902957 | p03573 | u104922648 | 1508031306 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 142 | # -*- coding: UTF-8 -*-
nums = input()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
set_nums.remove(other)
print(set_nums[0]) |
s802600200 | p03573 | u163703551 | 1508031270 | Python | Python (3.4.3) | py | Runtime Error | 64 | 3436 | 363 | import sys
from collections import Counter
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
n = read_int_list()
c = Counter(n... |
s325093904 | p03573 | u552668967 | 1508031222 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2696 | 541 | from sys import stdin
n,k = map(int,stdin.readline().split())
a = []
for i in xrange(n):
a.append(map(int,stdin.readline().split()))
def solve(i,j):
cnt = 0
minx = min(a[i][0],a[j][0])
maxx = max(a[i][0],a[j][0])
miny = min(a[i][1],a[j][1])
maxy = max(a[i][1],a[j][1])
for m in xrange(n):
if a[i][0]>=minx and ... |
s210554371 | p03573 | u104922648 | 1508031067 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 117 | nums = input()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
set_nums.remove(other)
print(set_nums[0]) |
s128709282 | p03573 | u104922648 | 1508030763 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 114 | nums = input()
set_nums = list(set(nums))
other = sum(nums) - sum(set_nums)
del set_nums[other]
print(set_nums[0]) |
s143219940 | p03573 | u649326276 | 1508030560 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 116 | l = map(int, raw_input().split( ))
if l[0] == l[1]:
print(l[2])
elif l[0] == l[2] :
print(l[1])
else:
print(l[0]) |
s084618323 | p03573 | u104922648 | 1508030186 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 48 | nums = input()
print(sum(nums) - sum(set(nums))) |
s453616927 | p03573 | u104922648 | 1508030107 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | nums = input()
print(sum(nums)-sum(set(nums))) |
s248577439 | p03573 | u104922648 | 1508029751 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | nums = input().strip().split()
print(sum(nums)-sum(set(nums))) |
s256533515 | p03573 | u104922648 | 1508029659 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | nums = map(int, input().split())
print(sum(nums)-set(nums)) |
s983838156 | p03573 | u521240302 | 1508029554 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 170 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
(A, B, C) = [int(x) for x in raw_input().split(" ")]
if A == B:
print(C)
elif A == C:
print(B)
else:
print(A)
|
s759244714 | p03573 | u867069435 | 1508029541 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 139 | a = list(map(int, input().split()))
if a[0] == a[1]:
print(a[3])
elif a[0] == a[2]:
print(a[1])
elif a[1] == a[2]:
print(a[0])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.