Submission #3148480

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll

void init();
void solve();

#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-1; i >= (int) (b); i--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define TRUE__  "YES"
#define FALSE__ "NO"
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x

#ifdef LOCAL
#define lcout(a) cout << a
#define lcoutln(a) cout << a << endl
#define lcerr(a) cerr << a
#define lcerrln(a) cerr << a << endl
#else
#define lcout(a) 
#define lcoutln(a) 
#define lcerr(a) 
#define lcerrln(a) 
#endif
#define MOD 1000000007
#define PI 3.141592653589793238462643383

signed main()
{
	init();
	solve();
}

#define KM 1000
int m;

void init()
{
	cin >> m;
}

void solve()
{
	if (m < 100) {
		cout << "00" << endl;
	} else if (m <= 5 * KM) {
		m /= 100;
		cout << m / 10 << m % 10 << endl;
	} else if (m >= 6 * KM && m <= 30 * KM) {
		m /= 1000;
		cout << m+50 << endl;
	} else if (m >= 35 * KM && m <= 70 * KM) {
		m /= 1000;
		m -= 30;
		m /= 5;
		cout << m + 80 << endl;
	} else if (m >= 70 * KM) {
		cout << 89 << endl;
	}
}

Submission Info

Judge Result