Submission #23039164

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
 
struct Edge {
  int to;
  long long w;
  Edge(int to, long long w) : to(to), w(w) {}
};
 
//using Graph = vector<vector<int> >;
//using Graph = vector<vector<Edge> >;
 
template<class T> void chmax(T& a, T b) {
  if(a < b) a = b;
}
template<class T> void chmin(T& a, T b) {
  if(a > b) a = b;
}
 
 
struct UnionFind {
  vector<long long> par, siz;
 
  UnionFind(long long n) : par(n, -1), siz(n, 1){}
 
  long long root(long long x) {
    if(par[x] == -1) return x;
    else return par[x] = root(par[x]);
  }
 
  bool issame(long long x, long long y) {
    return root(x) == root(y);
  }
 
  bool unite(long long x, long long y) {
    x = root(x); y = root(y);
 
    if(x == y) return false;
 
    if(siz[x] < siz[y]) swap(x, y);
 
    par[y] = x;
    siz[x] += siz[y];
    return true;
  }
 
  long long size(long long x) {
    return siz[root(x)];
  }
};
 

int main() {
  int a, b, c;
  cin >> a >> b >> c;
  if(a == b) {
    cout << c << endl;
    return 0;
  }
  else if(b == c) {
    cout << a << endl;
    return 0;
  } else if(a == c) {
    cout << b << endl;
    return 0;
  } 
  else {
    cout << 0 << endl;
    return 0;
  }
}

Submission Info

Judge Result