Submission #4366993

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<sstream>
#include<complex>
#include<functional>
#include<vector>
#include<map>
#include<queue>
#include<deque>
#include<stack>
#include<set>

using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl

constexpr int MOD = 1000000007;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vl;

ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }

// value
int m;

void solve() {

	cin >> m;
	string ans = "00";

	if (m < 100) {
	}
	else if(m <= 5000){
		ans[0] = to_string((m % 10000) / 1000)[0];
		ans[1] = to_string((m % 1000) / 100)[0];
	}
	else if (m <= 30000) {
		m /= 1000;
		ans = to_string(m + 50);
	}
	else if (m <= 70000) {
		m /= 1000;
		m -= 30;
		m /= 5;
		m += 80;
		ans = to_string(m);
	}
	else {
		ans = "89";
	}

	cout << ans << endl;

	return;

}

int main() {

	cin.tie(0);
	ios::sync_with_stdio(false);

	solve();

	return 0;

}

Submission Info

Judge Result