Submission #404952

---

Source Code Expand

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define whole(xs) xs.begin(), xs.end()
#define uniq(xs) (xs.erase(unique(xs.begin(), xs.end()), xs.end()))

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
    if (vs.empty()) return os << "[]";
    os << "[" << vs[0];
    for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
    return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

int M;
void Input() {
    cin >> M;
}

void Solve() {
    if (M < 100) printf("00\n");
    else if (M <= 5000) printf("%02d\n", M / 100);
    else if (M <= 30000) printf("%d\n", M / 1000 + 50);
    else if (M <= 70000) printf("%d\n", (M / 1000 - 30) / 5 + 80);
    else printf("89\n");
}

int main() {
    Input(); Solve();
    return 0;
}

Submission Info

Judge Result