Submission #7057752

---

Source Code Expand

#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x)  cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;

int main(int argc, char const *argv[]) {
    int m; cin>>m;
    m*=10;
    int ans;
    if (m < 1000) {
        ans = 0;
    }
    else if (m <= 50000) {
        ans = m/1000;
    }
    else if (m <= 300000) {
        ans = (m/10000)+50;
    }
    else if (m <= 700000) {
        ans = (((m/10000)-30)/5)+80;
    }
    else ans = 89;

    printf("%02d\n",ans);

    return 0;
}

Submission Info

Judge Result