Submission #243931

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <fstream>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);(i)++)
#define rev(i,n) for(int i=(n)-1;(i)>=0;(i)--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcountll(b)
#define gcd(a,b) (__gcd((a),(b)))
#define lcm(a,b) ( (a) / gcd((a),(b)) * (b) )
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 

const long long mod = 1000000007ll;
ll b_pow(ll x,ll n){return n ? b_pow(x*x%mod,n/2)*(n%2?x:1)%mod : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}

int main(){
	int m;
	cin >> m;
	if( m < 100 ) printf("00");
	else if( m <= 5000 ) printf("%02d",m/100);
	else if( m <= 30000 ) printf("%02d",(m+50000)/1000);
	else if( m <= 70000 ) printf("%02d",(m-30000)/5000+80);
	else printf("89");
	puts("");
}

Submission Info

Judge Result