OJ Board

for the result of the given equation to be an integer, the denominator must be an integer. So, the numbers in the denominator must be a square number ( n * n ) . Now, generate all possible square numbers between 10^9 and search for possible answers.

Hope it helps

your code fails for the following test case:

1 20:00
19:00 60

the correct output is 1440 mins ( 23 hrs till the bus comes and another 60 mins for travelling )

hope it helps

i tried to solve this problem using dp but how can i store the dp results in a table?? a N X N array exceeds the memory limit

And if i insert X in those blank spaces i will ended up with none or one blank space each line...

consider the test case

XXXXXXXXXXXBXXXXXXXXXXXXX
XXXXXXXXXXBBBXXXXXXXXXXXX

if you want to insert an X then you have to do so in all the lines. In the above there is 1 gap in the first line and 3 ...

else if ((a == b) || (a == c) || (a == b))

what is the difference between the first and the last condition??

I found a couple of mistakes...

First, the sequence must start with the number greater than 0.

Second,

if(i>=2)if(Arr==(Arr[i-1]+Arr[i-2]))flg=1;

this line is wrong.
Consider the test case:

3
1 3 4

The sequence is a B2 sequence but your output shows it is not a B2 sequence.

you should keep on bringing the two surfaces closer as long as there is atleast 1 gap in each line.....when this can no longer be done count the remaining gaps in all the lines. Hope this helps.

Think about dp( knapsack ) where the capacity of the knapsack is ( total weight of all people ) / 2 . Hope this helps

your logic is wrong.....
consider the test case:
1
4 1 2 4 5
the answer is 6( vito should build his house in 3 ) but your output is 4.

the "sorted" array should be of 'int' type

I think there should be a newline after the very last test case( not a blank line )

//gets(line);
I think uncommenting this part should avoid TLE.....however there is still a mistake....according to the given code 'maxx' stores the maximum gap in a single string among all the given strings and for the given test case :

3
XXXXXXXXXXXX XXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXX ...

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cctype>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<sstream>
#include<vector>
using namespace std;

typedef vector<int> vi;
typedef vector< vi > vii;
typedef ...

oops, this is not the intended way to solve this problem. The test cases are not strong enough but I admit that I have no idea how to generate good ones. Any one has some ideas?

what should have been the idea for solving this problem??

thanks a lot bm_anas...i made a stupid error as well as reduced the eps to 1e-2 and AC!!!! thanks once again...