Submission #1681188

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>

using namespace std;

#define all(c) c.begin(),c.end()
#define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++)
#define debug(x) #x << "=" << (x)
#define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl

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

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

template<typename T>
T input(){
    T t;
    cin >> t;
    return t;
}

template<typename T>
vector<T> input(const int N){
    vector<T> v(N);
    repeat(i,N) cin >> v[i];
    return v;
}

long long gcd(long long a, long long b){
    if(b == 0){
        return a;
    }
    return gcd(b, a % b);
}

long long lcm(long long a, long long b){
    return (a / gcd(a, b)) * b;
}

void printVV(long vv) {
    cout << setfill('0') << setw(2) << vv << endl;
}

int main(){
    long m;
    cin >> m;
    long minimum = 100;
    if (m < minimum) {
        printVV(m / 1000);
    } else if (minimum <= m && m <= 5000) {
        printVV(m * 10 / 1000);
    } else if (6000 <= m && m <= 30000) {
        printVV(m / 1000 + 50);
    } else if (35000 <= m && m <= 70000) {
        printVV((m / 1000 - 30) /5 + 80);
    } else {
        printVV(89);
    }
    return 0;
}

Submission Info

Judge Result