Submission #1647118

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>

#define DBG cout << '!' << endl;
#define REP(i,n) for(int i = 0;i < (n);++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << endl << endl;}
#define SHOW2d(v,i,j) {for(int a = 0;a < i;a++){for(int b = 0;b < j;b++)cout << v[a][b] << ' ';cout << endl;}cout << endl;}
#define ALL(v) v.begin(),v.end()

using namespace std;

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

int main()
{
	int n;
	
	cin >> n;
	
	if(n < 100)
	{
		cout << "00" << endl;
	}
	else if(n < 1000)
	{
		int tmp = n / 100;
		cout << 0 << tmp << endl;
	}
	else if(n <= 5000)
	{
		cout << n / 100 << endl;
	}
	else if(n <= 30000)
	{
		cout << (n / 1000) + 50 << endl;
	}
	else if(n <= 70000)
	{
		cout << (((n / 1000)- 30) / 5) + 80 << endl;
	}
	else
	{
		cout << 89 << endl;
	}
	
	return 0;
}

Submission Info

Judge Result