OJ Board

kamrul

Oh. That was a bad mistake.
Now i got AC

Thanks for your help.

kamrul

I used recursion to solve this problem. and it gives the solution to the test cases given in the problem perfectly. But i m getting WA

.
can anyone tell me what's wrong with my code.
Code:
[cpp]
Code has been removed.
[/cpp]

kamrul

I m Kamrul Joined Two Years ago. And Solved 220+ Problems so far.

Thanks

kamrul

Now I got AC

Thank you Sohel.
Your trick helped me.

kamrul

I used DFS to find the nodes which are in the cycle and marked them
with -1. Then used F. Warshall to find the path matrix

.

Could you explain the following code what you are doing here.

Code: Select all

        if( d[j][i] && d[i][i] && d[i][k])
              d[j][k] = -1;

Thanks.

kamrul

I m getting TLE for This Problem
Can anyone tell me what is the problem with my algo.

It runs well for the worst inputs

as:
0 10000
[cpp]
Code Removed
[/cpp]

Thanks.

kamrul

Can anyone tell me which one is the Best String maching algorithm ??

kamrul

I m getting Wa in this problem

. I used BFS to solve this Problem and it works for all the Sample Cases and Inputs I have made. Is There any Bad inputs for This Problem ??.

If so, PLZ help me !!.

Some Inputs with Outputs will be better for me to check my fault.

kamrul

shaikat wrote:all are cows

OJ Board

Search found 9 matches

Thanks:

10672 - Marbles on a tree

Gratitude

A small suggesion.

10200 Prime Time

String Maching Algorithm

10543 - Traveling Politician

Re: hello cow