Submission #3384677

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
    using namespace std;
 
    int main(){
      int m;
      cin >> m;
      if(m<100) cout << "00" << endl;
      else if(100<=m && m<1000){
       cout << 0 << m/100 << endl;
      }
      else if(1000<=m && m<=5000) cout << m/100 << endl;
      else if(6000<=m && m<=30000) cout << m/1000+50 << endl;
      else if(35000<=m && m<=70000) cout << (m/1000-30)/5+80 << endl;
      else cout << 89 << endl;
      return 0;}

Submission Info

Judge Result