OJ Board

Code: Select all

#include <iostream>
#include <vector>

using namespace std;

vector<int> probs_created(12), probs_required(12);
int S;
int probs_available, flag;

void get_input()
{
    int i;
    cin >> S;
    probs_available = S;
    for (i=0; i<12; i++) cin >> probs_created[i];
    for (i=0; i<12; i++) cin >> probs_required[i];
    cin >> flag;
}

int main()
{
    int cse = 0,j;

    while(true){
        get_input();
        cout << "Case " << cse+1 << ":" << endl;
        for (j=0; j<12; j++){
            if (probs_available >= probs_required[j]){
                probs_available -= probs_required[j];
                probs_available += probs_created[j];
                cout << "No Problem! :D" << endl;
            }
            else{
                probs_available += probs_created[j];
                cout << "No Problem. :(" << endl;
            }
        }
        if (flag < 0) break;
        cse += 1;
    }
}

Code: Select all

5
3 0 3 5 8 2 1 0 3 5 6 9
0 0 10 2 6 4 1 0 1 1 2 2
5
3 0 3 5 8 2 1 0 3 5 6 9
0 0 10 2 6 4 1 0 1 1 2 2
-3

Code: Select all

                cout << "No Problem. :(" << endl;

Code: Select all

// 11608.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "stdio.h"

int _tmain(int argc, _TCHAR* argv[])
{
	int s,count;
	int crtd[12];
	int rqrd[12];
	scanf("%d",&s);
	int c=1;
	while(s>0)
	{
		printf("Case %d:\n",c);
		c++;
		count=s;
		for(int i=0;i<12;i++)
			scanf("%d",&crtd[i]);
		for(int i=0;i<12;i++)
			scanf("%d",&rqrd[i]);
		for(int i=0;i<12;i++)
		{
			if(count>=rqrd[i])
			{
				printf("No problem! :D\n");
				count=count+crtd[i]-rqrd[i];
			}
			else
			{
				printf("No problem! :(\n");
				count=count+crtd[i];
			}
		}
		scanf("%d",&s);
	}
	return 0;
}

Code: Select all

 while(s>0) 

Code: Select all

#include <iostream>
#include <algorithm>
#include <string>


using namespace std;

int main()
{
	int sum , y[12] , p[12] , tmp;
	int cnt = 1;
	memset(y , 0 , sizeof(y));
	memset(p , 0 , sizeof(p));
	while(cin >> tmp , tmp > -1)
	{
		sum = tmp;
		for(int i = 0 ; i < 12 ; i++)
			cin >> p[i];
		for(int i = 0 ; i < 12 ; i++)
			cin >> y[i];
		cout << "Case " << cnt << ":" <<endl;
		for(int i = 0 ;i < 12 ; i++)
		{
			if (i == 0)
				if(sum >= y[0])
					sum -= (tmp - y[0]);
			else
				if(sum >= y[i-1])
					sum-= (p[i-2] - y[i-1]);
			sum+= p[i];
			
			
			if(sum >= y[i])
			{
				sum-= y[i];
				cout << "No problem! :D";
			}
			else				
				cout << "No problem. :(";
			cout << endl;	
		}
		cnt++;
	}
	return 0;
}

Code: Select all

if (i == 0)
   if(sum >= y[0])
      sum -= (tmp - y[0]);
else
   if(sum >= y[i-1])
      sum-= (p[i-2] - y[i-1]);

Code: Select all

if (i == 0) {
  if(sum >= y[0]) {
    sum -= (tmp - y[0]);
  }
  else if(sum >= y[i-1]) {
    sum-= (p[i-2] - y[i-1]);
  }
}

Code: Select all

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
	int n , p[13] , m[13] , sum;
	bool res;
	while(cin >> n  , n)
	{
		sum = n;
		res = false;
		for(int i = 1 ; i <= 12 ; i++)
			cin >> p[i];
		
		for(int i = 1 ; i <= 12 ; i++)
			cin >> m[i];
		
		for(int i = 1 ; i <= 12 ; i++)
		{
			if(sum >= m[i])
			{
				sum-= m[i];
				res = true;
			}
			else
				res = false;
			
			if(res)
				cout << "No problem! :D" << endl;
			else
				cout << "No problem. :(" << endl;
			
			if(i == 2)
			{
				if(m[1] < n)
					sum-= n - m[1];
			}
			if(i > 2)
			{
				if(m[i-1] < p[i-2])
					sum-= p[i-2] - m[i-1];
			}
			sum+=p[i];
		}
	}
	return 0;
}