Problem:


Score : 100 points

Problem Statement

You are given three integers, A, B and C.

Among them, two are the same, but the remaining one is different from the rest.

For example, when A=5,B=7,C=5, A and C are the same, but B is different.

Find the one that is different from the rest among the given three integers.  

Constraints

-100 \leq A,B,C \leq 100 

A, B and C are integers.

The input satisfies the condition in the statement.

Input

Input is given from Standard Input in the following format:  

A B C

Output

Among A, B and C, print the integer that is different from the rest.

Sample Input 1

5 7 5

Sample Output 1

7

This is the same case as the one in the statement.

Sample Input 2

1 1 7

Sample Output 2

7

In this case, C is the one we seek.

Sample Input 3

-100 100 100

Sample Output 3

-100



Sample input:
5 7 5


Sample output:
7

Submission status: Runtime Error

Solution code:
H,W = map(int, input().split())
S = [list(input()) for _ in range(H)] #データ形式はS[i][j]

eight = [[-1,-1],[0,-1],[1,-1], # 周囲8マスの定義
         [-1,0],[1,0],
         [-1,1],[0,1],[1,1]]

for i in range(H):
  for j in range(W):
    if S[i][j] == '#':
      for e in eight:
        target = S[i+e[0]][j+e[1]]
        if target and target != '#':
          if target == '.' :
            S[i+e[0]][j+e[1]] = 1
          else :
            S[i+e[0]][j+e[1]] += 1

for i in range(H):
  for j in range(W):
    print(S[i][j], end='')
  if i < H: print('')

Submission status: Runtime Error

Solution code:
fn main() {
    let v: Vec<i32> = read_vec();
    if v[0] == v[1] {
        println!("{}", v[2]);
    } else if v[1] == v[2] {
        println!("{}", v[0]);
    } else {
        println!("{}", v[1]);
    }
}

// ######################################################################## //

// 標準入力から一行を読み取り、指定の型に変換する関数
pub fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

// 標準入力から一行を読み取り、空白文字で分割し、各要素を指定の型に変換する関数
pub fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

// 標準入力からn行を読み取り、各行を空白文字で分割し、各要素を指定の型に変換する関数
pub fn read_vec2<T: std::str::FromStr>(n: usize) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

// 10進数での各桁の和
pub fn sum_dights(x: isize) -> isize {
    if x % 10 == 0 {
        return 0;
    }
    let m = x % 10;
    m + sum_dights((x - m) / 10)
}

Submission status: Runtime Error

Solution code:
tx = [map(int, input().split(,))]
cx = sorted(tx)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Submission status: Runtime Error

Solution code:
tx = [map(int, input().split())]
cx = [sorted(tx)]

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Submission status: Runtime Error

Solution code:
tx = [map(int, input().split())]
cx = sorted(tx)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*int(cx[i]))
        break

Submission status: Runtime Error

Solution code:
tx = [map(int, input().split())]
cx = sorted(tx)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Submission status: Runtime Error

Solution code:
tx = [map(int, input().split())]
cx = sorted(x)

for i in range(2):
    if cx[i] == cx[i+1]:
        print(sum(cx) - 2*cx[i])

Submission status: Runtime Error

Solution code:
a, b, c = map(int(input().split()))
 
if a == b:
  print(a)
elif a==c:
  print(a)
elif b==c:
  print(c)

Submission status: Runtime Error

Solution code:
a, b, c = int(input().split())

if a == b:
  print(a)
elif a==c:
  print(a)
elif b==c:
  print(c)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

if a == b:
    ans = c
elif a == c:
    ans = b:
else:
    ans = a

print(ans)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())

if a==c:
  print(b)
elif a==b:
  print(c)
else:
  print(a)

Submission status: Runtime Error

Solution code:
H, W = map(int, input().split())
matrix = [input() for i in range(H)] 
ans = ""  
for h in range(H):
        for w in range(W):
                bomb = 0 
                for i in range(-1, 2): 
                        if 0 <= h - 1 and 0 <= w + i < W:
                                if matrix[h - 1][w + i] == "#":
                                        bomb += 1
                        if h + 1 < H and 0 <= w + i < W:
                                if matrix[h + 1][w + i] == "#":
                                        bomb += 1
                for i in range(-1, 2, 2): 
                        if 0 <= w + i < W:
                                if matrix[h][w + i] == "#":
                                        bomb += 1
                if matrix[h][w] == "#":
                        ans += "#" 
                else:
                        ans += str(bomb)
                if W - 1 > 0:
                        if w % (W - 1) == 0 and w != 0:
                                ans += "\n"
print(ans)

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
l=[[] for i in range(N)]
e = [[int(i) for i in input().split()] for i in range(M)]
e0=e
c=0

def DFS(v):
  seen.append(v)
  for v2 in l[v]:
    if not v2 in seen:
      DFS(v2)
  return seen

for i in range(M):
  seen=[]
  l=[[] for i in range(N)]
  for j in range(M):
    if j!=i:
      l[(e[j][0])-1].append(e[j][1]-1)
      l[(e[j][1])-1].append(e[j][0]-1)
  S=DFS(0)
  if len(S)!=N:c+=1
print (c)

Submission status: Runtime Error

Solution code:
X = list(map(int,input().split))
X.sort()
print(sum(X)-X[1]*2)

Submission status: Runtime Error

Solution code:
a,b,c=sorted(map(int,input().split()))
if("c" a==b else "a")

Submission status: Runtime Error

Solution code:
h,w=map(int,input().split())
s=[]
cnt=0
for i in range(h):
    s.append(list(input()))
if h==1 and w==1:
    if s[0][0]=='#':
        print('#')
    else:
        print(0)
elif h==1:
    for i in range(w):
        if s[0][i]=='#':
            continue
        if i==0:
            if s[0][i+1]=='#':
                s[0][i]=='1'
            else:
                s[0][i]=='0'
        elif i==w-1:
            if s[0][i-1]=='#':
                s[0][i]=='1'
            else:
                s[0][i]=='0'
        else:
            if s[0][i+1]=='#':
                cnt+=1
            if s[0][i-1]=='#':
                cnt+=1
            s[0][i]=str(cnt)
            cnt=0
    ans=''
    for l in range(h):
        for b in range(w):
            ans+=s[l][b]
        print(ans)
        ans=''
elif w==1:
    for i in range(h):
        if s[i][0]=='#':
            continue
        if i==0:
            if s[i+1][0]=='#':
                s[i][0]=='1'
            else:
                s[i][0]=='0'
        elif i==h-1:
            if s[i-1][0]=='#':
                s[i][0]=='1'
            else:
                s[i][0]=='0'
        else:
            if s[i+1][0]=='#':
                cnt+=1
            if s[i-1][0]=='#':
                cnt+=1
            s[i][0]=str(cnt)
            cnt=0
    ans=''
    for l in range(h):
        for b in range(w):
            ans+=s[l][b]
        print(ans)
        ans=''
else:
    for j in range(h):
        for k in range(w):
            if j==0:
                if s[j][k]=='#':
                    continue
                else:
                    if k==0:
                        if s[j][k+1]=='#':
                            cnt+=1
                        if s[j+1][k]=='#':
                            cnt+=1
                        if s[j+1][k+1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
                    elif k==w-1:
                        if s[j][k-1]=='#':
                            cnt+=1
                        if s[j+1][k]=='#':
                            cnt+=1
                        if s[j+1][k-1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
                    else:
                        if s[j][k+1]=='#':
                            cnt+=1
                        if s[j+1][k]=='#':
                            cnt+=1
                        if s[j+1][k+1]=='#':
                            cnt+=1
                        if s[j][k-1]=='#':
                            cnt+=1
                        if s[j+1][k-1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
            elif j==h-1:
                if s[j][k]=='#':
                    continue
                else:
                    if k==0:
                        if s[j][k+1]=='#':
                            cnt+=1
                        if s[j-1][k]=='#':
                            cnt+=1
                        if s[j-1][k+1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
                    elif k==w-1:
                        if s[j][k-1]=='#':
                            cnt+=1
                        if s[j-1][k]=='#':
                            cnt+=1
                        if s[j-1][k-1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
                    else:
                        if s[j][k+1]=='#':
                            cnt+=1
                        if s[j-1][k]=='#':
                            cnt+=1
                        if s[j-1][k+1]=='#':
                            cnt+=1
                        if s[j][k-1]=='#':
                            cnt+=1
                        if s[j-1][k-1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0 
            elif 0<j<h-1:
                if s[j][k]=='#':
                    continue
                else:
                    if k==0:
                        if s[j][k+1]=='#':
                            cnt+=1
                        if s[j-1][k]=='#':
                            cnt+=1
                        if s[j-1][k+1]=='#':
                            cnt+=1
                        if s[j+1][k]=='#':
                            cnt+=1
                        if s[j+1][k+1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
                    elif k==w-1:
                        if s[j][k-1]=='#':
                            cnt+=1
                        if s[j-1][k]=='#':
                            cnt+=1
                        if s[j-1][k-1]=='#':
                            cnt+=1
                        if s[j+1][k]=='#':
                            cnt+=1
                        if s[j+1][k-1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
                    else:
                        if s[j][k+1]=='#':
                            cnt+=1
                        if s[j-1][k]=='#':
                            cnt+=1
                        if s[j-1][k+1]=='#':
                            cnt+=1
                        if s[j-1][k-1]=='#':
                            cnt+=1
                        if s[j+1][k]=='#':
                            cnt+=1
                        if s[j+1][k+1]=='#':
                            cnt+=1
                        if s[j][k-1]=='#':
                            cnt+=1
                        if s[j+1][k-1]=='#':
                            cnt+=1
                        s[j][k]=str(cnt)
                        cnt=0
    ans=''
    for l in range(h):
        for b in range(w):
            ans+=s[l][b]
        print(ans)
        ans=''

Submission status: Runtime Error

Solution code:
#75b
H,W = map(int, input().split())

S_list = [[0 for i in range(W+2)] for j in range(H+2)]

for i in range(1,H+1):
    S = list(input())
    S_list[i][1:W+1] = S
    
ans = [["#" for i in range(W+2)] for j in range(H+2)]
    
for i in range(1,H+1):
    for j in range(1,W+1):
        if S_list[i][j] != "#":            
            ans[i][j] = S_list[i-1][j-1:j+2].count("#") + S_list[i][j-1:j+2].count("#") + S_list[i+1][j-1:j+2].count("#")
            
for i in range(1,H+1):
    print(''.join(map(str, ans[i][1:-1])))

Submission status: Runtime Error

Solution code:
h, w = map(int,input().split())
s = [input() for i in range(h)]
for i in range(h):
  l = ""
  for j in range(w):
    if s[i][j] == "#":
      l += "#"
    else:
      l += str(sum([t[max(0,j-1):min(w,j+2)].count("#") for t in s[max(0,i-1):min(h,i+2)]]))
  print(l)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input())
print(a if b-c ==0 else b if a-c ==0 else c)

Submission status: Runtime Error

Solution code:
a＝list(map(int,input().split()))
a=sorted(a)
print(a[0] if a[1]==a[2] else a[2])

Submission status: Runtime Error

Solution code:
a=[map(int,input().split())]
a.sort();
print(a[0]+a[1]+a[2]-a[1]*2)

Submission status: Runtime Error

Solution code:
a
for i in range(0,3):
  a.append(map(int,print().split()))
a.sort();
print(a[0]+a[1]+a[2]-a[1]*2)

Submission status: Runtime Error

Solution code:
a=[]
for i in range(0,3):
  a.append(map(int,print().split()))
a.sort();
print(a[0]+a[1]+a[2]-a[1]*2)

Submission status: Runtime Error

Solution code:
def count_mine(m, i, j):
    count = 0
    for k in range(i - 1, i + 2):
        for l in range(j - 1, j + 2):
            if m[k][l] == "#":
                count += 1
    return count

H, W = map(int, input().split())
l = [list(map(str, input().split())) for i in range(H)]
m = []
m.append("*" * (W + 2))
for i in range(len(l)):
    add_colum = "*" + ''.join(l[i]) + "*"
    m.append(add_colum)
m.append("*" * (W + 2))
answer = []
for i in range(1, H + 1):
    answer_column = ""
    for j in range(1, W + 1):
        if m[i][j] == ".":
            answer_column += str(count_mine(m, i, j))
        else:
            answer_column += "#"
    answer.append(answer_column)
for i in range(H):
    print(answer[i])

Submission status: Runtime Error

Solution code:
a, b, c = map(imput().split())
print(a if b == c else b if a == c else c)

Submission status: Runtime Error

Solution code:
a, b, c = map(int. input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

if a == b:
  print(c)
elif a == c:
  print(b):
else:
  print(a)

Submission status: Runtime Error

Solution code:
if __name__ = '__main__':
  A, B, C = map(int, input().split())
  if A == B:
    print(C)
  elif A == C:
    print(B)
  else:
    print(A)

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
if A == B :
    print(C)
elif A == C :
    print(B) :
else :
    print(A)

Submission status: Runtime Error

Solution code:
h,w = map(int, input().split())
s = [list(input() for i in range(h))]
t = s.copy()
 
 
number = []
cnt = 0
 
for i in range(h) :
  if 1 <= i and i <= h-2 :
    for j in range(w) :
      if j >= 1 and j < w-1 :
        number = [s[i-1][j-1],s[i-1][j],s[i-1][j+1],s[i][j-1],s[i][j+1],s[i+1][j-1],s[i+1][j],s[i+1][j+1]]
        cnt = number.count('#')
        t[i][j] = cnt
        
      elif j == 0 :
        number = [s[i-1][0],s[i+1][0],s[i-1][1],s[i][1],s[i+1][1]]
        cnt = number.count('#')
        t[i][0] = cnt
      
      elif j == w-1 :
        number = [s[i-1][w-1],s[i+1][w-1],s[i-1][w-2],s[i][w-2],s[i+1][w-2]]
        cnt = number.count('#')
        t[i][w-1] = cnt       
  
  elif i == 0 :
    for j in range(w) :
      if 1 <= j and j <= w-2 :
        number = [s[0][j-1],s[0][j+1],s[1][j-1],s[1][j],s[1][j+1]]
        cnt = number.count('#') 
        t[0][j] = cnt
      
      elif j == 0 :
        number = [s[0][1],s[1][0],s[1][1]]
        cnt = number.count('#') 
        t[0][0] = cnt
        
      elif j == w-1 :
        number = [s[0][w-2],s[1][w-2],s[1][w-1]]
        cnt = number.count('#') 
        t[0][w-1] = cnt        
  
  elif i == h-1 :
    for j in range(w) :
      if 1 <= j and j <= w-2 :
        number = [s[h-1][j-1],s[h-1][j+1],s[h-2][j-1],s[h-2][j],s[h-2][j+1]]
        cnt = number.count('#')
        t[h-1][j] = cnt
                
      elif j == 0 :
        number = [s[h-1][1],s[h-2][1],s[h-2][0]]
        cnt = number.count('#') 
        t[h-1][0] = cnt
        
      elif j == w-1 :
        number = [s[h-2][w-1],s[h-1][w-2],s[h-2][w-2]]
        cnt = number.count('#') 
        t[h-1][w-1] = cnt
 
for i in range(h):
  for j in range(w):
    if s[i][j] == '#':
      t[i][j] = '#'
    
  
a0 = map(str,t[0])
a1 = map(str,t[1])
a2 = map(str,t[2])
print(''.join(a0))
print(''.join(a1))
print(''.join(a2))

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
print(a if b==c else b if a==c else c if a==b)

Submission status: Runtime Error

Solution code:
a,b,c = input()

print(a if b==c else b if a==c else c)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print(c if a==b else b if a==c else a if b==c)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input())
if a == b:
  print(c)
elif a == c:
  print(b)
else:
  print(a)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print(a if [a,b,c].count(a)==1 else b if [a,b,c].count@(b)==1 else c)

Submission status: Runtime Error

Solution code:
a, b, c = int(input().split)
if a == c : print(b)
elif a == b : print(c)
else : print(a)

Submission status: Runtime Error

Solution code:
li = set(list(map(int, input().split())))
print(li[0])

Submission status: Runtime Error

Solution code:
H,W = map(int,input().split())
grid = [[0 for w in range(W)] for h in range(H)]
sharps = []
for h in range(H):
  row = [v for v in input()]
  #print(row)
  for w,r in enumerate(row):
    #print(w,r)
    if r == "#":
      #grid[h][w] = "#"
      sharps.append([h,w])
      if h>=1:
        grid[h-1][w] += 1
        if w>=1:
          grid[h-1][w-1] += 1
        if w<=W-2:
          grid[h-1][w+1] += 1
      if h<=H-2:
        grid[h+1][w] += 1
        if w>=1:
          grid[h+1][w-1] += 1
        if w<=W-2:
          grid[h+1][w+1] += 1
      if w>=1:
        grid[h][w-1] +=1
      if w<=W-2:
        grid[h][w+1] +=1
#print(sharps)
for sharp in sharps:
  grid[sharp[0]][sharp[1]] = "#"
for g in grid:
  print("".join([str(v) for v in g]))

Submission status: Runtime Error

Solution code:
a,b,c=input().split()

if a==b:
    print(c)
    break
elif a==c:
    print(b)
    break
else:
    print(a)

Submission status: Runtime Error

Solution code:
n = int(input())
li = [int(input()) for _ in range(n)]

idx_li = []

count = 1
bu = li[0]
idx_li.append(bu)
if bu == 2:
  print(count)
  exit()
  
while True:
  bu = li[bu - 1]
  count += 1
  
  if bu == 2:
    print(count)
    exit()
  
  if bu in idx_li:
    print(-1)
    exit()
  else:
    idx_li.append(bu)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
if a ==b:
    print(c)
elif a==c:
    print(b)
else print(a)

Submission status: Runtime Error

Solution code:
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
import sys
#input=sys.stdin.readline  #危険！基本オフにしろ！
sys.setrecursionlimit(10**6)



def main():
    n,k=map(int,input().split())
    grid=[tuple(map(int,input().split()))for i in range(n)]
    x=set(s for s,t in grid)
    y=set(t for s,t in grid)
    ans=[]
    for i in combinations(x,2):
        for j in combinations(y,2):
            xx=max(i)
            xxx=min(i)
            yy=max(j)
            yyy=min(j)
            if sum(xxx<=s<=xx and yyy<=t<=yy for s,t in grid)>=k:
                ans.append(abs((yy-yyy)*(xx-xxx)))
    print(min(ans))
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
l=[list(map(int,input().split())) for i in range(n)]
x=[l[i][0] for i in range(n)]
x.sort()
y=[l[i][1] for i in range(n)]
y.sort()
ans=[]
for i1 in range(n):
  for i2 in range(n):
    for i3 in range(n):
      for i4 in range(n):
        ct=0
        for i5 in range(n):
          if min(x[i1],x[i2])<=l[i5][0]<=max(x[i1],x[i2]) and min(y[i3],y[i4])<=l[i5][1]<=max(y[i3],y[i4]):ct+=1
        if ct>=k:
          ans.append(abs(x[i1]-x[i2])*abs(y[i3]-y[i4]))
print(min(ans))

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split()))

if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input(.split()))

if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
if A == B:
  print('C')
elif B == C:
  print('A')
else:
  print('B)

Submission status: Runtime Error

Solution code:
A = [int(i) for i in input().split()
A.sort()
mid = A[1]
s = [i for i in A if i != mid]
print(s[0])

Submission status: Runtime Error

Solution code:
a,b,c=stdin.readline().rstrip().split()
if a==b:
  print(c)
elif a==c:
  print(b)
elif b==c:
  print(a)

Submission status: Runtime Error

Solution code:
a, b, c = input().split()
if a == b:
    print(C)
elif a == c:
    print(b)
else:
    print(a)

Submission status: Runtime Error

Solution code:
from collections import deque

h,w = map(int,input().split())
hw = [list(input()) for _ in range(h)]

for i in range(h):
  for j in range(w):
    if hw[i][j] == ".":
      cnt = 0
      for x in [-1, 0, 1]:
        for y in [-1, 0, 1]:
          if i+y in range(h) and j+x in range(w):
            if hw[i+y][j+x]=="#":
              cnt += 1
      hw[i][j]=cnt

for line in hw:
  print("".join(list(map(str, line))))

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())

if A == B:
  print(C)
else if A == C:
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
import sys as chokudairedcoderatcoderowner
A,B,C = map(int,input().split())

if A == B:
  print(C)
else if A == C:
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
import sys as chokudairedcoderatcoderowner
A,B,C = map(int,chokudairedcoderatcoderowner.stdin.readline().split())

if A == B:
  print(C)
else if A == C:
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
import sys as chokudairedcoderatcoderowner
A,B,C = map(int,chokudairedcoderatcoderowner.stdin.readline())

if A == B:
  print(C)
else if A == C:
  print(B)
else:
  print(A)

Submission status: Runtime Error

Solution code:
a,b,c=map(int, input().split())

if a-b==0 
  print(int(c))
elif b-c==0:
  print(int(a))
elif c-a==0:
  print(int(b))

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a==b:
  print(c)
elif b==c
  print(a)
else:
  print(b)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a==b:
  print(c)
elif b==c
  print(a)
  else:
    print(b)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(N)]

ans = 10 ** 19
for a in range(N):
    for b in range(N):
        for c in range(N):
            for d in range(N):
                x0 = data[a][0]
                x1 = data[b][0]
                y0 = data[c][1]
                y1 = data[d][1]
                if x0 < x1 and y0 < y1:
                    count = 0
                    for i, j in data:
                        if x0 <= i <= x1 and y0 <= j <= y1:
                            count += 1
                    if count >= K:
                        ans = min(ans, (x1 - x0)*(y1 - y0))

print(ans)

Submission status: Runtime Error

Solution code:
# encoding:utf-8
import copy
import numpy as np
import random
import bisect #bisect_left　これで二部探索の大小検索が行える

N,M = map(int,input().split())

edge = []
pass_edge = []
for i in range(M):
    a,b = map(int,input().split())
    if a < b:
        a,b = b,a#つねaの方が大きい
    if a==b:
        pass_edge.append([a,b])
    else:
        edge.append([a,b])

sorted_edge = sorted(edge)

bridge = {}
for i in range(1,N+1):
    bridge[i] = []

latest_bridge = [0,0]
for edge_i in sorted_edge:
    #edge = [a,b]
    if latest_bridge == edge_i:
        pass_edge.append(edge)
        pass
    else:
        latest_bridge = edge_i
        for port in range(2):
            bridge[edge_i[port]] = bridge[edge_i[port]]+[edge_i[port-1]]

# print(bridge)

def check(ie):
    a,b = ie
    used.append(a)
    copy_bridge = copy.deepcopy(bridge)
    copy_bridge[a] = list(set(copy_bridge[a])-set([b]))
    move = copy_bridge[a]
    isolate = 1
    while len(move)>0:
        pos = move.pop()
        if pos in used:
            pass
        elif pos == b:
            isolate = 0
        else:
            move = move+list(set(copy_bridge[pos]+used)-set(used))
            used.append(pos)
    return isolate

ans = 0

for ie in edge:
    # print("bi",ie)
    if ie in pass_edge:
        pass
    else:
        used = []

        ans += check(ie)
        # print(ans)

print(ans)

Submission status: Runtime Error

Solution code:
a, b, c=map(int, input().split())
if a==b:
  print(c)
elif b=c:
  print(a)
else:
  print(b)

Submission status: Runtime Error

Solution code:
A, B, C = int(input())
if A==B:
	print(C)
elif B==C:
	print(A)
elif C==A:
	print(B)

Submission status: Runtime Error

Solution code:

H, W = map(int, input().split())
S = [list(input()) for _ in range(H)]

def aaa(i, j):
    cnt = 0
    for x in [-1, 0, 1]:
        for y in [-1, 0, 1]:
            if (not 0 <= i + y < H) or (not 0 <= j + x < W):
                continue
            if S[i + y][j + x] == '#':
                cnt += 1    
    return str(cnt)

for i in range(H):
    for j in range(W):
        if S[i][j] == '#':
            continue
        S[i][j] = aaa(i, j)
for s in S:
    print("".join(s))

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split(' '))
R=[list(map(int,input().split(' '))) for i in range(M)]
Mat=[[0]*N]*N
for r in R:
	Mat[r[0]-1][r[1]-1]=1
	Mat[r[1]-1][r[0]-1]=1

stack=[1]
island=[]

ans=0
Matmini=[]

def dfs():
	global stack
	global island
	global Matmini
	if stack==[]:
		return None
	if len(set(island))==N:
		#全頂点が網羅できていたらそこで終了
		return None
	else:
		#たどれるノードがあるかどうかを確認
		for i in range(1,N+1):
			#iが未訪問のときのみ処理続行
			if i not in stack:
				#実際に辺が存在するか
				if Matmini[stack[0]-1][i-1]==1:
					stack = [i] + stack
					dfs()
		#これ以上先に進めなくなったら島の構成要素を更新
		island += stack
		stack.pop(0)

for r in R:
	#Rからi番目の辺だけ除去したもの
	Matmini = Mat
	Matmini[r[0]-1][r[1]-1]=0
	Matmini[r[1]-1][r[0]-1]=0
	stack = [1]
	island = []
	dfs()
	if len(set(island))!=N:
		ans += 1
		
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c=(int(x) for x in input().split())

if a=b:
    print(c)
elif b=c:
    print(a)
elif c=a:
    print(b)
else:
    pass

Submission status: Runtime Error

Solution code:
n = list(map(int,input().split(' ')))
ans = i if n.count(i)==1 for i in list(dict.fromkeys(n))
print(str(ans))

Submission status: Runtime Error

Solution code:
n = list(map(int,input().split(' ')))
ans = i if i.count(dict.fromkeys(n))==1 for i in n
print(str(ans))

Submission status: Runtime Error

Solution code:
from numpy import*
a,b=map(int,input().split())
c=["0"]*(b+2)
x=[list("0"+input().replace(".","0").replace("#","1")+"0")for i in range(a)]
x.insert(0,c)
x.append(c)
x=array(x).astype(int)
for s in range(1,1+a):
    tmp=""
    for t in range(1,1+b):
        if x[s][t]==1:
            tmp+="#"
        else:
            tmp+=str(sum(x[s-1:s+2,t-1:t+2]))
    print(tmp)

Submission status: Runtime Error

Solution code:
l = input().split()
for i in range(3):
  if l[i].count() == 1:
    print(l[i])

Submission status: Runtime Error

Solution code:
A, B, C = map(int, intput().split())
print(A^B^C)

Submission status: Runtime Error

Solution code:
A, B, C = map(int, intput().split())
print(A ^ B ^ C)

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input())
if a==b:
  print(c)
elif a==c:
  print(b)
elif b==c:
  print(a)

Submission status: Runtime Error

Solution code:
a=list(map(int,input().split()))
if a[0] == a[1]:
	print(a[2])
else:
	if a[0] == a[2]:
		print(a[1])
	else:
		ptint(a[0])

Submission status: Runtime Error

Solution code:
H, W = [int(_) for _ in input().split()]
cbd = [list(input()) for _ in range(H)]
for i in range(H): 
    for j in range(W):
        if cbd[i][j] == ".":
            c = 0
            for iw in range(i-1,i+2):
                for jw in range(j-1,j+2):
                    if iw < 0 or H <= iw or jw < 0 or W <= jw:
                        continue
                    elif cbd[iw][jw] == "#":
                        c += 1
            cbd[i][j] = str(c)
for i in range(H):
    print("".join(cbd[i]))

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
if a==b:
  print(int(c))
elif a==c:
  print(int(b))
elif b==c:
  print(int(a))

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
 
if a == b:
  print(int(c))
elif a == c:
  print(int(b))
elif b == c:
  print(int(a))

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
if a == b:
 print(int(c))
elif a == c:
 print(int(b))
elif b == c:
 print(int(a))

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()

if a == b:
    print(int(c))
elif a == c:
    print(int(b))
elif b == c:
    print(int(a))

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
if a == b:
    print(int(c))
elif a == c:
    print(int(b))
elif b == c:
    print(int(a))

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Submission status: Runtime Error

Solution code:
numlist = list(input().split())
print(sorted(numlist,key=lambda x:numlist.sount(x))[0])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
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])

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
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[y-1:y+1+1, x-1:x+1+1] += 1
            result_table[y][x] = -1

for line in result_table.astype(str):
    for cell in line:
        if cell == '-1':
            print('#', end='')
        else:
            print(cell, end='')
    print('')

Submission status: Runtime Error

Solution code:
x=input().split()
y=set(x)
print(y[x.count(y[0])-1])

Submission status: Runtime Error

Solution code:
a=map(int,input().split())
a.sort()
if a[1]==a[0]:
    print(a[2])
else:
    print(a[0])

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
if a == b:
    print(c)
elce:
    print(b)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
A,B,C =map(int,input().split())
if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print()B