OJ Board

Code: Select all

#include <stdio.h>

int main(){
    while(1){
        int h,u,d,f;
        scanf("%d %d %d %d",&h,&u,&d,&f);

        if(!h)
            return 0;

        f*=u;
        h*=100;
        u*=100;
        d*=100;

        int day = 0;
        int good = 0;
        int pos = 0;

        while(1){
            day++;
            if(u<0)
                u = 0;

            pos += u;
            if(pos>h){
                good = 1;
                break;
            }

            u-=f;
            pos-=d;

            if(pos < 0)
                break;
        }
        if(good)
            printf("sucess ");
        else
            printf("failure ");
        printf("on day %d\n",day);


    }


    return 0;
}

Code: Select all

#include <iostream>
#include <cmath>
using namespace std;

int main(){
    double h, u, d, f;
    cin >> h >> u >> d >> f;
    if ((h == 0) || !(1 <= h <= 100) || !(1 <= u <= 100) || !(1 <= d <= 100) || !(1 <= f <= 100)){
        return 0;
    }
    /* h is where it starts, u is how much it moves, d is the constant it slides down,
    and f is the percentage that u is reduced by the next day */
    double i, s; // i is the day, s is the snail's current height which is 0
    i = 0;
    s = 0;
    while (true){
        i ++; // dawn of the first day which will then keep going
        s += u; // adding to the height
        if (s > h){
            cout << "success on day " << i << endl;
            return 0;
        }
        s -= d; // it is now night, snail slides down

        if (s < 0){
            cout << "failure on day " << i << endl;
            return 0;
        }
        u -= u * (f/100); // fatigue
        cout << s << "," << h << "," << i << endl;
    }
}

Code: Select all

AC

Code: Select all

1 100 100 100
100 1 100 100
100 1 100 1
0 0 0 0

Code: Select all

success on day 1
failure on day 1
failure on day 1

Code: Select all

int main() {
	int h, u, d, f;

	cin >> h;
	while(h != 0) {
		cin >> u >> d >> f;
		//cout << "inputs are " << h << u << d << f << endl;
		float initial_ht = 0.0, dist_climbed = (float)u, height_after_climbing = 0.0, height_after_sliding = 0.0;
		float depeciation_each_day = (float)u * f / 100;
		//cout << "depre each day " << depeciation_each_day << endl;
		int i = 1;
		bool is_success = true;
		for(i = 1; height_after_sliding < h; i++) {
			initial_ht = height_after_sliding;
			cout << initial_ht ;
			if(i != 1) {
				dist_climbed -= depeciation_each_day;
			}
			height_after_climbing = initial_ht + dist_climbed;
			if (height_after_climbing > h) {
				break;
			}
			if(height_after_climbing < 0) {
				is_success = false;
				break;
			}
			height_after_sliding = height_after_climbing - (float)d;
			initial_ht = height_after_sliding;
			cout  << " " << dist_climbed << " " << height_after_climbing << " " << height_after_sliding << endl;
		}
		if(!is_success) {
			cout << "failure on day ";
		} else {
			cout << "success on day ";
		}
		cout << i << endl;
		cin >> h;
	}
}

Code: Select all

56 3 1 5

Code: Select all

failure on day 32

Code: Select all

failure on day 28