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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

    ans = 0
    if b == c: ans = a
    elif a == c: ans = b
    elif a == b: ans = c
    print(ans)
resolve()

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
B = list(set(A))
if A.count(B[0]) == 1:
  print(B[0])
else:
  print(B[1])

Submission status: Accepted

Solution code:
from collections import Counter
a = Counter(list(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:
  if b==c:
    print(a)
  elif a==c:
    print(b)
else:
  print(c)

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 and A!=C:
  print(A)
elif B!=A and B!=C:
  print(B)
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:
from collections import Counter
A,B,C = map(int,input().split())
c = Counter([A,B,C])
c = sorted(c.items(),key = lambda x: x[1])
print(c[0][0])

Submission status: Accepted

Solution code:
import itertools

A, B, C = map(int, input().split())
number = [A, B, C]
for a,b in itertools.combinations([A,B,C], 2):
    if a == b:
        number.remove(a)
        number.remove(b)
print(number[0])

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:
nums = list(map(int, input().split()))
nums.sort()

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

Submission status: Accepted

Solution code:
from functools import reduce
print(reduce(lambda x,y: x^y, list(map(int, input().split()))))

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:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

A, B, C = iInM()

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

Submission status: Accepted

Solution code:
l=input().split();print(min(l,key=lambda x:l.count(x)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

A,B,C = I()
if A == B and A != C:
    print(C)
if B == C and A != B:
    print(A)
if A == C and A != B:
    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=list(map(int,input().split()));print(list(x for x in l if l.count(x)==1)[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
array = list(map(int,input().split()))

if not (-100 <= array[0] <= 100 and -100 <= array[1] <= 100 and -100 <= array[2] <= 100):
    sys.exit()

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

Submission status: Accepted

Solution code:
print(eval(input().replace(*' ^')))

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    l = [A, B, C]
    l.sort()
    if l[0] == l[1]:
        print(l[2])
    elif l[0] == l[2]:
        print(l[1])
    else:
        print(l[0])
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

Submission status: Accepted

Solution code:
def actual(a, b, c):
    if a == b:
        return c
    if b == c:
        return a
    if c == a:
        return b

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

Submission status: Accepted

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

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

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

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=[i for i in 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=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 == 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)
elif b == c:
    print(a)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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(b if a==c else a if b==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:
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:
x, y, z = map(int, input().split())

print(z if x==y else y if x==z else x)

Submission status: Accepted

Solution code:
X=list(map(int,input().split()))
Y=sorted(X)

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

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

if A == B:
  print(C)
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 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 = [i for i in input().split()]

unique = [x for x in set(l) if l.count(x) == 1]
print(unique[0])

Submission status: Accepted

Solution code:
l = [i for i in input().split()]

unique = [x for x in set(l) if l.count(x) == 1]
print(unique[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = [int(i) for i in input().split()]
if abc[0] == abc[1]:
    print(abc[2])
else:
    print((set(abc[:2]) - (set(abc[:2]) & set([abc[2]]))).pop())

Submission status: Accepted

Solution code:
li = list(map(int, input().split()))
li.sort()
if li[0]==li[1]:
  print(li[2])
else:
  print(li[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())
print(c if a == b else (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:
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=list(map(int,input().split()))
for i in a:
    if a.count(i)==1:
        print(i)

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = input().split()
    if L.count(L[0]) == 1:
        print(L[0])
    elif L.count(L[1]) == 1:
        print(L[1])
    else:
        print(L[2])
    


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if A-B == 0:
  print(C)
elif A-C == 0:
  print(B)
elif B-C == 0:
  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:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int):
    A, B, C = sorted([A, B, C,])
    return A if A != B else C


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
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
    print(solve(A, B, C))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

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

Submission status: Accepted

Solution code:
from collections import Counter
A = Counter(map(int, input().split())).most_common()
print(A[1][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,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input().split()
t = ''
if x[0] == x[1]:
  t = x[0]
elif x[1] == x[2]:
  t = x[1]
elif x[0] == x[2]:
  t = x[0]
for i in x:
  if t != i:
    print(i)

Submission status: Accepted

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


def solve(A: int, B: int, C: int):
    print(A^B^C)
    return


# Generated by 1.1.7.1 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:
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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c = map(int, readline().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())
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:
nums = list(map(int,input().split()))
import collections
c = collections.Counter(nums)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
# -*- coding: <encoding name> -*-

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

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 01:42:06 2020

@author: shinba
"""

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:
# -*- coding: utf-8 -*-
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==0:
  print(c)
elif a-c==0:
  print(b)
elif b-c==0:
  print(a)

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

l = inputIL()

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:
#!/usr/bin/env python3
import sys


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

    return


# Generated by 1.1.6 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:
A,B,C=map(int,input().split())
if (A==B):
    print(C)
elif (B==C):
    print (A)
elif (A==C):
    print (B)