View Code of Problem 70

#include<stdio.h>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
       int n;
       int bonus,bonus1,bonus2,bonus3,bonus4;
        bonus=100000*0.1; 
       bonus1=bonus+100000*.0075;
       bonus2=bonus1+200000*0.05;
       bonus3=bonus2+200000*0.03;
       bonus4=bonus3+400000*0.015;
       scanf("%d", &n);
       if(n<=100000) printf("%.0f",n*0.1);
       else if(n<=200000) printf("%.0f",bonus+(n-100000)*0.075);
       else if(n<=400000) printf("%.0f",bonus1+(n-200000)*0.05);
       else if(n<=600000) printf("%.0f",bonus2+(n-200000)*0.03);
	   else if(n<=1000000) printf("%.0f",bonus3+(n-400000)*0.015);
	   else   printf("%.0f",bonus4+(n-1000000)*0.01);
	   	  return 0;
}

Double click to view unformatted code.


Back to problem 70