Submission #535523

---

Source Code Expand

#include <cstring>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
#define FOR(i,j,k) for(int i=j; i<(int)k; ++i)
#define rep(i,j) for(int i=0;i<(int)j;++i)
#define mp make_pair
#define pb push_back
#define all(x) begin(x),end(x)
#define debug(x) cout<<#x<<": "<<(x)<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
string solve(int m){
    string ans;
    int tmp, km = m / 1000;
    if(m < 100){
        ans = "00";
    } else if(m<=5000){
        tmp = m / 100;
        if(tmp < 10) ans = "0";
        ans += to_string(tmp);
    } else if(m <= 30000){
        tmp = km + 50;
        ans = to_string(tmp);
    } else if(m <= 70000){
        tmp = (km - 30) / 5 + 80;
        ans = to_string(tmp);
    } else{
        ans = "89";
    }
    return ans;
}
int main(){
    int m;
    cin >> m;
    cout << solve(m) << endl;
}

Submission Info

Judge Result