Submission #107261

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <complex>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cctype>
#include <cassert>
#include <cstring>
using namespace std;

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define f first
#define s second
#define mp make_pair
#define pb push_back

typedef pair<int,int> P;
typedef long long lli;

static const int INF = (1 << 29);
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

string convert(int v) {
  stringstream ss;
  ss << v;
  return ss.str();
}

int main() {
  int m;
  cin >> m;
  string ans = "";
  
  if(m < 100) ans = "00";
  else if(m <= 5000) {
    ans += convert(m / 100);
    if(ans.size() == 1) ans = "0" + ans;
  }
  else if(6000 <= m && m <= 30000) {
    ans += convert(m / 1000 + 50);
  }
  else if(35000 <= m && m <= 70000) {
    ans += convert((m / 1000 - 30) / 5 + 80);
  }
  else ans = "89";

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result