Submission #3312698

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include<bits/stdc++.h>
#include <utility>

#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a); (b) <= i; i--)
#define REP(i,n) for(int i = 0; i < (n); i++)
#define RREP(i,n) for(int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1)*(a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1<<29)

using namespace std;
using ll = long long;
map <int ,int> mpa,mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  double m;
  cin >> m;
  ll ans=0;
  if(m<100){
    cout << "00" << endl;
  }else if(100<=m && m<1000){
    m/=100;
    cout << '0' << m << endl;
  }else if(6000<=m && m<=30000){
    m=m/1000+50;
    cout << m << endl;
  }else if (35000<=m && m <=70000){
    m=(m-30)/5+80;
    cout << m << endl;
  }else if (70000<m){
    cout << 89 << endl;
  }else{
    return 0;
  }
  return 0;
}

Submission Info

Judge Result