Submission #1516506

---

Source Code Expand

#include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <functional>
#include <cstdlib>
#include <queue>
#include <tuple>
#include <map>
#include <cmath>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define DFOR(i,a) for(int i=(a);i>=0;i--)
#define SORT(v, n) sort(v, v+n)

using namespace std;

const double EPS =1e-9;
const long INF =999999999;
const long MINF =-999999999;

void fn(int target,int obA,int obB){
	int rank=1;
	if(target<obA) rank+=1;
	if(target<obB) rank+=1;
	printf("%d\n",rank);
	return;
}

int main(){
	int A,B,C;
	cin>>A>>B>>C;
	fn(A,B,C);
	fn(B,A,C);
	fn(C,A,B);
	return 0;
}

Submission Info

Judge Result