Submission #1035464

---

Source Code Expand

#include <bits/stdc++.h>
//#include <boost/functional/hash.hpp>
//example: unordered_set< pair<int,int>,boost::hash< std::pair<int, int> > > used;
//priority_queue< pair<int,pair<int,int> >, vector<pair<int,pair<int,int>>>, greater<pair<int,pair<int,int> > > > pqueue;    //cost, vertex(行き先)
using namespace std;

#define MODULE 1000000007
#define MP make_pair
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<class T, class U>
inline void chmin(T &t, U f) { if (t > f)t = f; }

template<class T, class U>
inline void chmax(T &t, U f) { if (t < f)t = f; }

template<typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) { //usage: int dp[10][10]; Fill(dp,INF);
    std::fill((T *) array, (T *) (array + N), val);
}

typedef pair<int, int> P;
typedef long long LL;
const int INF = INT_MAX / 2;    //int_max->2*e+9 LLの時はLLONG_MAX
/*const int MAXN = 100001;

struct edge {
    edge(int to, int cost) : to(to), cost(cost) {}
    int to, cost;
};
vector<edge> graph[MAXN];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};*/

//-----Template---------

int main() {
    ios::sync_with_stdio(false); //cout<< fixed << setprecision(10);
    int n;
    cin >> n;
    if (n < 100) {
        cout<<"00"<<endl;
    } else if (100 <= n && n <= 5000) {
        int tmp=n/100;
        if(tmp<10){
            cout<<"0"<<tmp<<endl;
        }else{
            cout<<tmp<<endl;
        }
    } else if (6000 <= n && n <= 30000) {
        int d=n/1000;
        cout<<d+50<<endl;
    } else if (35000 <= n && n <= 70000) {
        cout<<(n/1000-30)/5+80<<endl;
    } else if (70000 < n) {
        cout<<89<<endl;
    } else {
        //no
    }
    //cout << ((double) (n + 1) / 2 * 10000) << endl;

}

Submission Info

Judge Result