TopCoder SRM -185 PassinGrade February 14, 2010

TopCoder SRM -185 PassinGrade

–[sumbit with 143.52/250]

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>
using namespace std;

class PassingGrade{
 
 public:
    int pointsNeeded( vector<int>  pointsEarned,vector<int>pointsPossible,int finalExam){
       float r1=0,r2=0,per=0.0;
       int i,j;
       for(i=0;i<pointsEarned.size();i++){
           r1+=pointsEarned[i];
           r2+=pointsPossible[i];
       }
        r2=r2+finalExam;
        per=(r2*65)/100;
        //cout<<per<<endl;
        float need=per-r1+0.5;
        i=need;
        //cout<<i; 
        if(i>finalExam) return -1;
        else return i;
     }

};

/*
int main()
{
  PassingGrade pg;
   int myints1[] = { 1, 2, 3, 4 };
  vector<int> v1 (myints1, myints1 + sizeof(myints1) / sizeof(int) );
  //vector<int> v1;
   int myints2[] = { 2, 3, 4, 5};
  vector<int> v2 (myints2, myints2 + sizeof(myints2) / sizeof(int) );
  //vector<int> v2;
  int n=pg.pointsNeeded(v1,v2,7);
   cout<<n<<endl;

return 0;
}

*/       
 

TopCoder Member SRM 461 -TrappingRabbits February 13, 2010

Problem is below:
–SUBMIT[158/250 pointts]–

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>
using namespace std;

class TrappingRabbit{
    int min,j;
    public:
       int findMinimumTime(vector<int> trapX,vector<int> trapY){
          min=99999999;
          for(int i=0;i<trapX.size();i++){
             j=trapX[i]-1+trapY[i]-1;
             if(min>j)
               min=j;
          }

          return min;
        }
};

/*
int main()
{
  TrappingRabbit tr;
   int myints1[] = {4,6,8};
  vector<int> v1 (myints1, myints1 + sizeof(myints1) / sizeof(int) );
  //vector<int> v1;
   int myints2[] = {1,2,1};
  vector<int> v2 (myints2, myints2 + sizeof(myints2) / sizeof(int) );
  //vector<int> v2;
  int n=tr.findMinimumTime(v1,v2);
   cout<<n<<endl;

return 0;
}
*/

Problem: