OJ Board

We are getting time limit exceeded to this one. we reduced the sentences down to 12 basic types and if the sentence give is not one of these types then we do not accept it. We tried different test cases and it worked with all of them. I am wondering can a sentence contains capitals in it ( but even ...

We are getting time limit exceeded to this one. we reduced the sentences down to 12 basic types and if the sentence give is not one of these types then we do not accept it. We tried different test cases and it worked with all of them. I am wondering can a sentence contains capitals in it ( but even ...

No. The judges are right. Marry does not get anything because she does not receive presents.
The wording of this question is very misleading, though.

Try this input:

-x8y+9x3-1+y
x5y+1+x3
x+1
x+y+1
x4+y7+xy56+100x3+100x3+100x3+75y84x23+y23
x+y+x2y2+x3y3
y3-3y2+3y-1
1+y+y2+y3+y4+y5+y6+y7+y8+y9+y10+y11+y12+y13+y14+y15+y16+y17+y18+y19+y20+y21+y22
100x100+100y100
100x100-100y100
57x-57x+yx34-45x+100x100-24x35+75x3y34
57x-57x+yx34-45x+100x100-24x35 ...

Eventhough it runs fine on the sample input I am getting a wrong answer.

//@begin_of_source_code
/*@JUDGE_ID: 15975FF 106 C++*/
#include<iostream.h>
#include<math.h>

int gcd( int a, int b)
{
int r;

do
{
r = a % b;
a = b;
b = r;
}while(r!=0);

return a;

}

int main()
{
long int N;
int ...

Agian, works with the sample input but when we send it the reply is a wron answer. We use a backtracking algorithm to check all the possible outcomes. First we check if there is a profit in two steps. If there is we find the max profit in two steps and output it. If there is not then we check if ...

It works with the sample input but the judges do not think we solved it. Here is how our algorithm works: We divide the city into strips from west to east. In order to do that we put the beginning and the end of each building into an array of doubles called R[] and after that we sort R. Thus any two ...

It works with the sample input but when we sent it we received a wrong answer. We are checking all possible costs using a backtracking algorithm and choose the minimum cost at the end. Here is our source code:

//@begin_of_source_code
/*@JUDGE_ID: 15975FF 222 C++*/
#include<iostream.h>
#include ...

We thought we got it but the judges did not.
I am trying all the six different possibilities.
I still donot understand why they talk about dynamic programming at the beginning of the problem.

#include<iostream.h>

int main()
{
long int b1,g1,c1;
long int b2,g2,c2;
long int b3,g3,c3;
long int ...

Why the longest increasing subsequence algorithm does not work?

//@begin_of_source_code
/* @JUDGE_ID: 15975FF 111 C++ */

//This is the longest increasing subsequence //algorithm.

#include<iostream.h>


int n;
int A[40];
int B[40];
int C[40];

int Find(int x)
{
int i;
for(i =1; i<= n; i ...

What is meant by `The output is a file of boolean.'? You can't directly output booleans in c++, so I took this to mean print out TRUE or FALSE as characters. This produced the `wrong answer'. My program did produce the same results as the sample, but I'm guessing it's a formatting problem.