Submission #781347

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<list>
#include<map>
#include<string>
#include<queue>
#include<deque>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a,c) memset(a,c,sizeof(a))

#define DEBUG(x) cout<<"#x"<<": "<<x<<endl

using namespace std;

typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;

const ll INF = INT_MAX/3;
const ll MOD = 1000000007;
const double EPS = 1e-14;
const int dx[] = {1,0,-1,0} , dy[] = {0,1,0,-1};

int main(){
    int m;
    cin >> m;
    if(m < 100) cout << "00" << endl;
    else if(100 <= m && m <= 5000) printf("%02d\n",m/100);
    else if(6000 <= m && m <= 30000) printf("%02d\n",m/1000+50);
    else if(35000 <= m && m <= 70000) printf("%02d\n",(m-30000)/5000+80);
    else cout << 89 << endl;


    return 0;
}

Submission Info

Judge Result