Submission #308811

---

Source Code Expand

#include <iostream>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <stdio.h>

int max(int a,int b){
	if(a>=b)return a;
	else return b;
}


void swap(int *a,int *b){
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

void babbleSort(int *data,int n){
	for(int i=0;i<n;i++){
		for(int j=n-1;j>i;j--){
			if(data[j]>=data[j-1]){
				swap(&data[j],&data[j-1]);
			}
		}
	}
}


using namespace std;

long long int mod;
long long int mod2;

/*
cin.ignore();
	getline(cin,dataStr);
	data = new int[n];
	stringToInteger(&dataStr,data,n);
*/

void stringToInteger(string *str,int *data,int n){
	for(int i=0;i<n;i++){
		int spaceN = str->find(' ',0);

		data[i] = atoi(str->substr(0,spaceN).c_str());
		str->erase(0,spaceN+1);
	}
}

long long int fact(int a){
	long long int sum=1;
	for(int i=1;i<=a;i++){
		sum*=i;
		sum%=mod;
	}
	cout<<a<<" "<<sum<<endl;
	return sum;
}

long long int P[1000][1000];

void makePascalTriangle(){
	for(int i=0;i<1000;i++){
		for(int j=0;j<=i;j++){
			if(i==j||j==0){
				P[i][j]=1;
			}
			else{
				P[i][j] = (P[i-1][j-1]+P[i-1][j])%mod;
			}
		//	cout<<P[i][j]<<" ";
		}
	}
}

int main(){

	int m;

	cin>>m;

	if(m<100){
		cout<<"00"<<endl;
	}
	else if(m>=100&&m<=5000){
		printf("%02d\n",m/100);
	}
	else if(6000<=m&&m<=30000){
		cout<<m/1000+50<<endl;
	}
	else if(35000<=m&&m<=70000){
		cout<<(m/1000-30)/5+80<<endl;
	}
	else{
		cout<<89<<endl;
	}

	return 0;
}

Submission Info

Judge Result