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)
if a == c:
    print(b)
if b == c:
    print(a)

Submission status: Accepted

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

Submission status: Accepted

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

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 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:
l=sorted(map(int,input().split()))
print(sum(l)-l[1]*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 = sorted(map(int,input().split()))
print( c if a == b else a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif c == b:
    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:
def main():
    a, b, c = map(int, input().split())

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


if __name__ == "__main__":
    main()

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 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:
a = input().split(' ')

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

Submission status: Accepted

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

print(A if B == C else C)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    x = list(map(int, readline().split()))

    for y in x:
        if x.count(y) == 1:
            print(y)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c=map(int,input().split())
if a==b:
  print(c)
elif c==b:
  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 B == C:
    print(A)
else:
    print(B)

Submission status: Accepted

Solution code:
from collections import Counter

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

cnt = Counter(ABC)
values, counts = zip(*cnt.most_common(2))

print(values[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())

print(c) if a == b else print(b) if a == c 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 - One out of Three
# https://atcoder.jp/contests/abc075/tasks/abc075_a

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

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
for ll in l:
    if l.count(ll)==1:
        print(ll)
        break

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())
print(a^b^c)

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:
import sys, collections
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    ABC = LI()

    cnt = collections.Counter(ABC)
    ans = [k for k, v in cnt.items() if v == 1]
    print(ans[0])

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b & b != c:
    print(c)
elif a==c & c !=b:
    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:
# 3つの整数のうち1つだけ異なる値を出力
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:
# 3 つの整数 A, B, Cが与えられます。
# A, B, C のうち 2つは 同じ整数であり、
# 残りの 1つだけ異なる整数です。
# 例えば、A = 5, B = 7, C = 5の場合、
# A, C の 2つは同じ整数であり、
# B は 1つだけ異なる整数です。
# 3つの整数のうち、1つだけ異なる整数を求めてください。

# 制約
# -100 ≦ A, B, C ≦ 100
# A, B, C は整数
# 入力は問題文の条件を満たす

# 標準入力から A, B, C の値を取得する
a, b, c = map(int, input().split())

# 異なる整数を探して出力する
result = 0

if a == b:
    result = c
elif b == c:
    result = a
elif a == c:
    result = b
else:
    result = "Error"

print(result)

Submission status: Accepted

Solution code:
# A - One out of Three

# 入力された整数A,B,Cのうち、2つは等しく1つは異なる
# 1つだけ異なる整数の値を出力する


A,B,C = map(int,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] = list(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 == C:
    print(B)
elif B == C:
    print(A)
else:
    print(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())

print(a ^ b ^ c)

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)
elif B == C:
    print(A)

Submission status: Accepted

Solution code:
# 3 つの整数 A , B , C が与えられます。 A , B , C のうち 2 つは 同じ整数であり、残りの 1 つだけ異なる整数です。
# 例えば、 A = 5 , B = 7 , C = 5 の場合、 A , C の 2 つは同じ整数であり、 B は 1 つだけ異なる整数です。
# 3 つの整数のうち、 1 つだけ異なる整数を求めてください。

A,B,C =map(int,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 == 0:
    print(C)
elif A - C == 0:
    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())
print(a if b==c else b if a==c else c)

Submission status: Accepted

Solution code:
#   AtCoder abc075 a
#   ストレッチ課題

#   入力
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:
integer1, integer2, integer3 = map(int, input().split())
if integer2 == integer3:
    print(integer1)
elif integer1 == integer3:
    print(integer2)
else:
    print(integer3)

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())
print(A ^ B ^ C)

Submission status: Accepted

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

# 出力
if -100 <= A and B and C <= 100:
    if A == B:
        print(C)
    elif B == C:
        print(A)
    elif A == C:
        print(B)

Submission status: Accepted

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

Submission status: Accepted

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

abc.sort()
if abc[0] == abc[1]:
    print(abc[2])
else:
    print(abc[0])

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x 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())

# A,B,Cのうち 2つは 同じ整数であり、残りの 1つだけ異なる整数
# A,B,Cのうち、1つだけ異なる整数を出力

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

Submission status: Accepted

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

for int_ in int_s:
    if int_s.count(int_) == 1:
        print(int_)
        break

Submission status: Accepted

Solution code:
# 075a

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:
# 3つの整数を取得
A,B,C = map(int,input().split())

# AをBとCを比較し、異なる数値を出力
if A == B:
    print(C)
elif A == C:
    print(B)
else:
    print(A)

Submission status: Accepted

Solution code:
# 3つの整数A,B,Cを入力
A,B,C = map(int,input().split())
# A,B,Cのうち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 c==a:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

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

#S = input("入力：")
#S_list = S.split()
A, B, C= S_list[0], S_list[1], S_list[2]
AB, BC, CA = A-B, B-C, C-A
if AB*BC !=0 :
    print(B)
elif CA*AB !=0 :
    print(A)
else:
    print (C)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - One out of Three

# A B C は整数
# 上記2つは同じ整数で　1つだけ異なる整数
# ex) A = 5,B = 7,C = 5  ...  A ⇔ C Bは異なる値
# 3つの整数のうち 1つのことなる整数を出力させる

# A B C を標準入力
A, B, C = map(int, input().split(maxsplit=3))
# print(A, B, C)

# 以下で条件を分けて代入。
# 1. A ⇔ B の時 C を代入。
# 2. A ⇔ C の時 B を代入。
# 3. B ⇔ C の時 A を代入。

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

# 結果を出力
print(answer)

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, b, c =map(int,input().split())

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if int(A)==int(B):
  print(C)
elif int(A)==int(C):
  print(B)
elif int(B)==int(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)
elif a == c:
    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 = list(map(int,input().split()))
 
for i in a:
  if a.count(i) <= 1:
    print(i)
    break

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:
al=list(map(int,input().split()))
al.sort()
print(sum(al)-al[1]*2)

Submission status: Accepted

Solution code:
a, b, c = map(int, 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)
elif B == C:
    print(A)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if A==B:
    ans=C
elif A==C:
    ans=B
elif B==C:
    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:
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,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=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();print([[b,c][a==b],a][b==c])

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)
elif a == c:
    print(b)
else:
    print(a)

Submission status: Accepted

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

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 = list(map(int,input().split()))
if a[0]!=a[1]and a[0]!=a[2]:
  print(a[0])

elif a[1]!=a[0]and a[1]!=a[2]:
  print(a[1])

else:
  print(a[2])

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
L=[A,B,C]
if L.count(A)==1:
  print(A)
elif L.count(B)==1:
  print(B)
else:
  print(C)

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 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:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = (int(T) for T 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 a==c:
  print(b)
elif b==c:
  print(a)

Submission status: Accepted

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

Submission status: Accepted

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

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:
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())
    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 and b!=c:
  print(b)
elif b!=c and c!=a:
  print(c)
elif c!=a and a!=b:
  print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]


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 b==c:print(a)
else:print(b)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    A,B,C=mi()
    X = set()
    y = 0
    for x in [A,B,C]:
        if x in X: y = x
        X.add(x)

    for x in [A,B,C]:
        if x != y:
            print(x)
            exit()





if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    a, b, c = i_map()

    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:
    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())

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
s=(a,b,c)
for i in s:
 if s.count(i)==1:print(i)

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:
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(T) for T in input().split())
if A==B:
	print(C)
elif A==C:
	print(B)
else:
	print(A)

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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 ZIP(n): return zip(*(MAP() for _ in range(n)))
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:
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())
print((b==c)*a+(c==a)*b+(a==b)*c)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A = list(map(int, readline().split()))
    A.sort()
    if A[0] == A[1]:
        print(A[2])
    else:
        print(A[0])
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#n = int(input())
a, b, c = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

lis = list(input().split())

a = Counter(lis)

for k, v in a.items():
    if a[k] == 1:
        print(k)

Submission status: Accepted

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



if __name__ == "__main__":
    solve()

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 B==C:
    print(A)
else:
    print(B)

Submission status: Accepted

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

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 B==C:
	print(A)
else:
	print(B)

Submission status: Accepted

Solution code:
# coding: utf-8
import math
a, b, c = map(int,input().split())
#N = int(input())
#S = input()
ans = 0
#l = list(map(int,input().split()))

l = [a,b,c]

if l.count(a) == 1:
    print(a)
elif l.count(b) == 1:
    print(b)
else:
    print(c)

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:
import collections
A=collections.Counter(map(int,input().split()))
for  k,v in A.items():
  if v==1:
    print(k)

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:
import sys
def input(): return sys.stdin.readline().strip()

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


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:
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:
from collections import Counter
a = list(map(int, input().split()))
c = Counter(a).most_common()
print(c[-1][0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

Solution code:
n = [x for x in input().split()]
for i in n:
    if n.count(i) == 1:
        print(i)
        break

Submission status: Accepted

Solution code:
def main():
    *args, = map(int, input().split())
    args.sort()
    if args[0] == args[1]:
        print(args[2])
        return

    print(args[0])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

l=lmp()
for i in range(3):
    if l.count(l[i])==1:
        print(l[i])

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:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

A, B, C = mapint()
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:
l = sorted(list(map(int, input().split())))
print(l[0] if l[1]==l[2] else l[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
for i in [a, b, c]:
    if [a, b, c].count(i) == 1:
        print(i)
        exit()

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:
ABC = list(input().split())
print([x for x in set(ABC) if ABC.count(x) == 1][0])

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 = sorted(list(map(int, input().split())))
if a != b:
  print(a)
else:
  print(c)

Submission status: Accepted

Solution code:
List = list(map(int, input().split()))
res = 0
for i in range(2):
  for j in range(i+1,3):
    if List[i] == List[j]:
      res = 3 - i - j
print(List[res])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(3):
    if A.count(A[i]) == 1:
        print(A[i])

Submission status: Accepted

Solution code:
import collections
A,B,C=map(int,input().split())
ABC=[A,B,C]
ABC=collections.Counter(ABC)
if ABC[A]==1:
    print(A)
elif ABC[B]==1:
    print(B)
else:
    print(C)

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)
else:
    print(a)

Submission status: Accepted

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

for i in range(3):
  if x.count(x[i]) == 1:
    print(x[i])
    exit()

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)