Submission #948665

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

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

Submission Info

Judge Result