Submission #333643

---

Source Code Expand

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<stdio.h>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i);

using namespace std;

int main(){

  int m;
  cin >> m;
  
  int ans;
  if(100>m){
    ans=0;
  }else if(5000>=m){
    ans=m/100;
  }else if(30000>=m){
    ans=(m/1000)+50;
  }else if(70000>=m){
    ans=((m/1000)-30)/5+80;
  }else{
    ans=89;
  }

  printf("%02d\n",ans);

}

Submission Info

Judge Result