OJ Board

Problem: https://uva.onlinejudge.org/external/3/378.pdf
What is wrong with http://ideone.com/GvTfIo?
It solves mentioned input and https://www.udebug.com/UVa/378 random input.
But still getting WA after submit.

At the end, there should be 2 empty lines.
Don't know why UVa considers this as WA(Wrong Answer), it may be considered as "Presentation Error"

Hello Ratul Ahmed,
I followed your approach:
1) make 2 sets of vertex for each sub-graph or graph
2) take the minimum vertices from each of those sets & sum it
3) check how many vertices has no adjacent (help the king to find the minimum number of guards needed to guard all the junctions and ...

In uDebug getting different output if we change the test case sequence.
For example: input [2, input#1, input#2] = output[o#1, o#2] but input[2, input#2, input#1] giving output[o#2, o#3]
Why ?

--------------------------------------------------------------
Input:
2

5 6
0 1
0 2
1 3
2 3
4 0
5 0

13 ...

Hello Saniat,

#1# Input Case #
How about handling below case:

Input:
1

1,234 1*23 12345 12345 123 1234 1234 12 123 1234 1234

Output:
Case #1:
1*34

I checked in uDebug and it seems it accepts numerical digits although in the problem description it said " A word is formed by the letters A ...

About water: For a single move
1. Just start position and end position need to consider
2. No need to consider the whole path(alternate paths etc.)

Need to calculate neighbors carefully.
Special cases: M = N, N or M = 0...

For a case:

• 1. At the end of showing output, print a blank line.

• 2. Print another blank line, so that next case's output can be shown from here.

i.e. At the end there will be 2 blank lines.

Follow Floyd Warshall (not BFS)

For each case:

• 1. At the end of showing output, print a blank line.

• 2. Print another blank line so that next case can start from here.

i.e. After last case there will be 2 blank lines.

All the test cases in discussion board match in uDebug.
But still WA.
Please check my code: http://ideone.com/gbgMwN

And suggest what to do.

I'm getting Runtime Error. Why?
Solution: Array length use adequate number.

Obaida wrote:

Code: Select all

Accepted now. But it takes so much time could any one give me a better formula.  

@Obaida: The trick is generating/detecting prime numbers.