Submission #468014

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;


int n;
vector<pair<double, double> > v;


int main(){
	int m;
	cin >> m;
	if (m < 100) m = 0;
	else if (m <= 5000) m /= 100;
	else if (m <= 30000) m = m / 1000 + 50;
	else if (m <= 70000) m = (m / 1000 - 30) / 5 + 80;
	else m = 89;
	printf("%02d\n", m);
}

Submission Info

Judge Result