Submission #1205194

---

Source Code Expand

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
#define sort(v,n) sort(v,v+n)
#define vsort(v) sort(v.begin(),v.end())
#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
int m;
int main() {
	cin >> m;
	if (m < 100) {
		cout << 0;
		cout << 0 << endl;
	}
	else if (m >= 100 && m <= 5000) {
		if (m < 1000) {
			cout << 0;
			cout << m / 100 << endl;
		}
		else {
			cout << m / 100 << endl;
		}
	}
	else if (m >= 6000 && m <= 30000) {
		cout << m / 1000 + 50 << endl;
	}
	else if (m >= 35000 && m <= 70000) {
		cout << (m / 1000 - 30) / 5 + 80 << endl;
	}
	else {
		cout << 89 << endl;
	}
}

Submission Info

Judge Result