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: Accepted

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

Submission status: Accepted

Solution code:
#75

A, B, C = input().rstrip().split()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input().split()

for i in num:
  if num.count(i)==1:
    print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input().split())
if s[0] == s[1]:
  print(int(s[2]))
elif s[1] == s[2]:
  print(int(s[0]))
else:
  print(int(s[1]))

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
import collections
a = input().split()
c = collections.Counter(a)
print(c.most_common()[-1][0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(A: int, B: int, C: int):
    if A == B:
        print(C)
    elif B == C:
        print(A)
    else:
        print(B)

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
if x == y:
  print(z)
elif y == z :
  print(x)
else:
  print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#ls = list(input().split(" "))
ls = list(map(int,input().split(" ")))
#a,b,c = list(map(int,input().split(" ")))

for i in range(len(ls)):
  if(ls.count(ls[i]) == 1):
     print(ls[i])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
A,B,C = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
A, B, C = [int(abc) for abc in input().split()]
if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print(B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
abc.sort()
print(abc[0]) if abc[0] != abc[1] else print(abc[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(input())

# def LIST(): return list(map(str, input().split()))
# def LIST(): return list(input())

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

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

Submission status: Accepted

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

Submission status: Accepted

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

if A == B:
    ans = C
elif A == C:
    ans = B
else:
    ans = A

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    if a == b:
        print(c)
    if b == c:
        print(a)
    if a == c:
        print(b)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

print(a^b^c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC75 A

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

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

Submission status: Accepted

Solution code:

A = list(map(int,input().split()))

A.sort()

if A[0] == A[1]:
    print(A[2])
else:
    print(A[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if b[0] == b[1]:
  print(b[2])
else:
  print(b[0])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

def solve(A: int, B: int, C: int):
    L = [A,B,C]
    print([l for l in L if L.count(l) == 1][0])
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input().split(" ");
a = int(s[0]);
b = int(s[1]);
c = int(s[2]);
if a == b :
	print(c);
elif a == c :
	print(b);
else :
	print(a);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
A,B,C = map(int, input().split())
print(collections.Counter([A,B,C]).most_common()[1][0])

Submission status: Accepted

Solution code:
# run on python 3.4.3

from sys import stdin
from functools import reduce
from operator import xor


def main():
    abc = map(int, stdin.readline().split())
    ans = reduce(xor, abc)
    print(ans)


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

A, B, C = nl()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int):
    if A != B and A != C:
        print(A)
        return
    if B != A and B != C:
        print(B)
        return
    if C != B and C != A:
        print(C)
        return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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


main()

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
nums = input().split()
if nums[0] == nums[1]: print(nums[2])
elif nums[0] == nums[2]: print(nums[1])
else: print(nums[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
for i in range(-100, 101) :
        if a.count(i) == 1 :
                print(i)
                break

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))

for num in nums:
  if nums.count(num) == 1:
    print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict

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





if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def abc():
    a, b, c = input().split()
    if a == b:
        print(c)
        return
    if b == c:
        print(a)
        return
    print(b)


abc()

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))

if nums.count(nums[0]) == 1: print(nums[0])
elif nums.count(nums[1]) == 1: print(nums[1])
elif nums.count(nums[2]) == 1: print(nums[2])

Submission status: Accepted

Solution code:
from collections import Counter
A = list(map(int, input().split()))
num=Counter(A)
for i in num:
    if num[i]==1:
        print(i)

Submission status: Accepted

Solution code:
ans = map(int, input().split())
ans = sorted(ans)
if ans[1] == ans[2]:
    print(ans[0])
elif ans[0] == ans[1]:
    print(ans[2])

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
for i in range(3):
    if num.count(num[i]) ==1:
        print(num[i])

Submission status: Accepted

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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a= list(map(int,input().split(" ")))
for i in list(set(a)):
    if a.count(i)==1:
        print(i)

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
if A == B:
    print(C)
elif A == C:
    print(B)
else:
    print(A)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int):
    if A == B:
        ret = C
    elif B == C:
        ret = A
    else:
        ret = B
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = [int(i) for i in input().split()]
L.sort()
if L.count(L[0]) == 1:
    print(L[0])
else:
    print(L[2])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a==b:
    print(c)

elif b==c:
    print(a)

else:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = [ int(it) for it in input().split() ]
import collections as col
cc = col.Counter(li)
for k,v in cc.items():
  if ( v == 1 ):
    print ( k )

Submission status: Accepted

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

if a==b:
    print(c)

elif a==c:
    print(b)

else:
    print(a)

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = input().split()
if p[0] == p[1]:
  print(p[2])
elif p[0] == p[2]:
  print(p[1])
else:
  print(p[0])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

A,B,C=[int(val) for val in input().split()]
#print(A,B,C)
if B==C:
  print(A)
elif A==C:
  print(B)
else:
  print(C)

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C  = [int(i) for i in input().split()]
if A == B:
    print(C)
elif A == C:
    print(B)
elif B == C:
    print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

l = list(map(int, input().split()))

if l[0] == l[1]:
    print(l[2])
elif l[0] == l[2]:
    print(l[1])
else:
    print(l[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

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

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
l.sort()

if l[0]!=l[1]:
    print(l[0])
else:
    print(l[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
if l[0] == l[1] or l[0] == l[2]:
    print(sum(l)-2*l[0])
else:
    print(l[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math


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

Submission status: Accepted

Solution code:

def read_input():
    a, b, c = map(int, input().split())
    return a, b, c


def submit():
    a, b, c = read_input()

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


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    A,B,C = (int(_) for _ in input().split())
    if A == B:
        print(C)
    elif A == C:
        print(B)
    else:
        print(A)
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,c = f()
    print(a^b^c)

solve()

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
if l[0] == l[1]:
    print(l[2])
elif l[1] == l[2]:
    print(l[0])
else:
    print(l[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = list(map(int, input().split()))
print(a*(b == c) +b*(a == c) +c*(b == a) )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(eval(input().replace(" ", "^")))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ABC = list(map(int, input().split()))
for i in range(3):
  if ABC.count(ABC[i]) == 1:
    print(ABC[i])
    break

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()] 
a = sorted(a)

if a[0] == a[1]:
  print(a[2])
else:
  print(a[0])

Submission status: Accepted

Solution code:
a,b,c=input().split()
print([a,b,c][(a==b)*2+(a==c)])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = list(map(int, input().split()))

import collections

n2 = collections.Counter(n)

print(n2.most_common()[1][0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]
if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print(B)

Submission status: Accepted

Solution code:
# ABC075A - One out of Three
a, b, c = input().rstrip().split()
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input().rstrip().split(' ')
a = int(line[0])
b = int(line[1])
c = int(line[2])

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