Submission #5493842

---

Source Code Expand

//#include <bits/stdc++.h>
//#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>
 
 
#define FOR(i, a, b) for( int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for( int i=(a);i>=(b);i--)
#define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
 
using namespace std;
typedef long long int ll;
typedef pair< long long int, long long  int> P;
 
int dy[5] = { 0,0,1,-1,0 };
int dx[5] = { 1,-1,0,0,0 };
 
 
int main(void) {
    int m;
	int res;
	double km;
	int reso;

	cin>>m;
	km=(double)m/1000.0;
	if(m<100){
		res=0;
	}else if(m<=5000){
		res=km*10;
	}else if(m<=30000){
		res=km+50;
	}else if(m<=70000){
		km-=30;
		km/=5;
		res=km+80;
	}else{
		res=89;
	}

	reso=res;
	printf("%02d",reso);
	cout<<endl;

	return 0;
}

Submission Info

Judge Result