Submission #4657284

---

Source Code Expand

#include <ios>
#include <iomanip>
#include <iostream>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>

using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define MOD = 1000000007
#define INF (1e9)
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl

ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
typedef pair <ll,ll> P;


int main()
{
    ll m;
    cin >> m;
    if (m < 100) print("00");
    else if (m <= 5000) {
        cout << setfill('0') << right << setw(2) << m / 100 << endl;
    } else if (m <= 30000) {
        cout << m / 1000 + 50 << endl;
    } else if (m <= 70000) {
        print(((m/1000) - 30) / 5 + 80 );
    } else {
        print(89);
    }
    return 0;
}

Submission Info

Judge Result