Submission #1455009

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <numeric>
#include <bitset>
#include <vector>
#include <queue>

using namespace std;

typedef long long ll;
#define FOR(i,a,b)   for(ll i = (a); i < (b); i++ )
#define REP(i, n)    FOR(i,0,n)
typedef pair< ll, ll >   cp2;
typedef pair< ll, cp2 >   cp3;
#define fi first
#define se second
#define sec  se.fi
#define thr  se.se
const ll mod = 1000000007;
//              123456789

 
///////////////////////////////////////////////
//
//
///////////////////////////////////////////////

////////////////////////////////////////////////
////////////////////////////////////////////////

int A[3];
int ans = 3;

int main(){
	
	cin>>A[0]>>A[1]>>A[2];
	
	sort( A, A+3 );
	
	if( A[0] == A[1] ) ans--;
	if( A[1] == A[2] ) ans--;
	
	cout<<ans<<endl;
	
	return 0;

}

Submission Info

Judge Result