OJ Board

Code: Select all

//no problem
#include <iostream>
using namespace std;

int main(){
    int months[15], probs[15];
    int probstart, probtotal;
    int count = 0;
    while(cin >> probstart){
              count++;
              
              if (probstart < 0){
                            return 0;
              }
			  
              for (int i = 0; i < 12; i++){
                  cin >> months[i];
              }
              for (int j = 0; j < 12; j++){
                  cin >> probs[j];
              }
              cout << "Case " << count << ":" << endl;
              probtotal = probstart;
              for (int k = 0; k < 12; k++){
                 
                  if (probtotal >=  probs[k]){
								probtotal = probtotal - probs[k];
								
                                cout << "No problem! :D" << endl; 
								
                  }
                  else{
                       cout << "No problem. :(" << endl;				   
					   
                  }
				  probtotal = probtotal + months[k + 1];
					   
              }          
    }





return 0;
}

Code: Select all

1
0 10 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1
-1

Code: Select all

Case 1:
No problem! :D
No problem. :(
No problem! :D
No problem! :D
No problem! :D
No problem! :D
No problem! :D
No problem! :D
No problem! :D
No problem! :D
No problem! :D
No problem! :D

Code: Select all

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


using namespace std;

int main()
{
  int caseCounter=0;

  int inp;
  int oneInp;
  vector <int> arr1;
  int extra=0;
  vector <int> arr2;

  freopen("in","r",stdin);

  while (scanf("%d",&inp)==1)
    {
      caseCounter++;

      if (inp<0) break;

      cout<<"Case "<<caseCounter<<":"<<endl;

      arr1.push_back(inp);

      for (int i=0;i<12 ;i++ )
        {
          cin>>oneInp;
          arr1.push_back(oneInp);

        }
      arr1.erase(arr1.end()-1);


      for (int i=0;i<12 ;i++ )
        {
          cin>>oneInp;
          arr2.push_back(oneInp);
        }

      for (int i=0;i<12 ;i++ )
        {

          arr1[i]=arr1[i]+extra;



          if (arr1[i]>=arr2[i])
            {

              cout<<"No problem! :D"<<endl;

              extra=arr1[i]-arr2[i];
            }

          else
            {
              cout<<"No problem. :("<<endl;
              extra=extra+arr1[i];
            }


        }

      arr1.clear();
      arr2.clear();
      extra=0;

    }


  return 0;
}

Code: Select all

#include<cstdio>
int problem[12];
int use[12];
int main()
{
	int ready;
	int count = 1;
	problem[12] = 0;
	scanf("%d",&ready);
	while(ready>0)
	{
		for(int i = 0; i<12; i++) scanf("%d",&problem[i]);
		for(int i = 0; i<12; i++) scanf("%d",&use[i]);
		printf("Case %d:\n",count++);
		for(int i = 0; i<12; i++)
		{
			if(ready<use[i]) puts("No problem. :(");
			else
			{
				puts("No problem! :D");
				ready-=use[i];
			}
			ready+=problem[i];
		}
		scanf("%d",&ready);
	}
	return 0;
}

Code: Select all

import java.util.*;

public class Problem{
    private static final int MAX_SIZE = 12; 
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int problem, test = 1;

        while((problem = sc.nextInt()) > 0){ 
            int[] create = new int[MAX_SIZE];
            int[] require = new int[MAX_SIZE];

            scanArr(create, sc);
            scanArr(require, sc);
            System.out.println("Case " + test + ":");
            checkProblem(create, require, problem);

            test++;
        }   
    }   

    private static void scanArr(int[] arr, Scanner sc){
        for(int i = 0; i < 12; i++)
            arr[i] = sc.nextInt();
    }   

    private static void checkProblem(int[] create, int[] require, int problem){
        for(int i = 0; i < 12; i++){
            if(problem >= require[i]){
                problem -= require[i];
                System.out.println("No problem! :D");
            }
            else System.out.println("No problem. :(");
            problem += create[i];
        }   
    }   
}