Search found 16 matches

by asif_iut
Sun Apr 17, 2011 5:40 am
Forum: Volume 119 (11900-11999)
Topic: 11970 - Lucky Numbers
Replies: 7
Views: 3542

Re: 11970 - Lucky Numbers

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
by asif_iut
Fri Apr 15, 2011 4:55 pm
Forum: Volume 119 (11900-11999)
Topic: 11958 - Coming Home
Replies: 24
Views: 5402

Re: 11958 - Coming Home

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
by asif_iut
Sun Feb 06, 2011 7:36 am
Forum: Volume 119 (11900-11999)
Topic: 11908 - Skyscraper
Replies: 6
Views: 2083

11908 - Skyscraper

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
by asif_iut
Wed Dec 22, 2010 9:04 pm
Forum: Volume 4 (400-499)
Topic: 414 - Machined Surfaces
Replies: 49
Views: 8919

Re: WA 414 pls help

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 gaps i...
by asif_iut
Wed Dec 22, 2010 9:30 am
Forum: Volume 114 (11400-11499)
Topic: 11479 - Is this the easiest problem?
Replies: 48
Views: 17510

Re: 11479 - Is this the Easiest Problem?

else if ((a == b) || (a == c) || (a == b))
what is the difference between the first and the last condition??
by asif_iut
Wed Dec 22, 2010 9:22 am
Forum: Volume 110 (11000-11099)
Topic: 11063 - B2-Sequence
Replies: 73
Views: 39910

Re: 11063 - B2-Sequence

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.
by asif_iut
Wed Dec 22, 2010 9:00 am
Forum: Volume 4 (400-499)
Topic: 414 - Machined Surfaces
Replies: 49
Views: 8919

Re: WA 414 pls help

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. :)
by asif_iut
Wed Dec 22, 2010 8:51 am
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 32081

Re: 10032 - Tug of War

Think about dp( knapsack ) where the capacity of the knapsack is ( total weight of all people ) / 2 . Hope this helps :D
by asif_iut
Tue Dec 21, 2010 9:24 pm
Forum: Volume 100 (10000-10099)
Topic: 10041 - Vito's Family
Replies: 90
Views: 29729

Re: 10041 - Vito's Family

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.
by asif_iut
Thu Dec 16, 2010 9:31 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31491

Re: 482 Permutation Arrays

the "sorted" array should be of 'int' type
by asif_iut
Thu Dec 09, 2010 8:46 pm
Forum: Volume 4 (400-499)
Topic: 488 - Triangle Wave
Replies: 270
Views: 30407

Re: WA 488

I think there should be a newline after the very last test case( not a blank line )
by asif_iut
Thu Dec 09, 2010 8:25 pm
Forum: Volume 4 (400-499)
Topic: 414 - Machined Surfaces
Replies: 49
Views: 8919

Re: WA 414 pls help

//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 XXXXXXXX...
by asif_iut
Thu Nov 11, 2010 7:56 am
Forum: Volume 118 (11800-11899)
Topic: 11838 - Come and Go
Replies: 22
Views: 7334

Re: 11838 - Come And Go

#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 map...
by asif_iut
Fri Nov 05, 2010 5:56 pm
Forum: Volume 118 (11800-11899)
Topic: 11883 - Repairing a Road
Replies: 6
Views: 2711

Re: 11883

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??
by asif_iut
Tue Nov 02, 2010 8:09 pm
Forum: Volume 118 (11800-11899)
Topic: 11883 - Repairing a Road
Replies: 6
Views: 2711

Re: 11883

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

Go to advanced search