OJ Board

...why does my program get WA?
[pascal]
program primering;
var x:array [1..1000] of integer;
n:integer;
visited:array [1..1000] of boolean;

function prim(x:integer):boolean;
var i:integer;
begin
prim:=true;
for i:=2 to x div 2 do
if x mod i =0 then begin prim:=false; break end;
end;

procedure ...

"Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. "

Can anybody explain what this means ?

Why do I get WA ? It works on my computer and produses right answers for the sample outputs provided ...

[pascal]
program GettingInLine;
var si,s:array [1..1000] of integer;
x,y:array [1..1000] of integer;
a,r:real;
stars:string;
visited:array [1..1000] of boolean;
function dist(x1,y1,x2,y2 ...

what is the algorithm used for finding the minimum number of computers that must be eliminated from a network so that the network crashes ?
is this minimum cut ? how do I implement it in Pascal ?

10x

I need the implementation of the alghoritm that determines the longest common subsequence of two arrays. unfortunately i don't know any C or C++ thanks

bye

How do you solve this type of problems in pascal ? I mean is there another way of doing this besides using an array of records that keeps the name and value for each variable..?

INPUT
JOHN=TOM+10
TOM=20

OUTPUT
JOHN=30
TOM=20

I also get WA but using Pascal
Can you provide some sample test cases for me ?

any problems in the problemset that involve finding minimum dominating set ?

thanks

Which algorithm is the best for finding the connected components in a graph ?

10x

Cosmin.ro wrote:You have to work with the biconnected components algo. But if you are from Cluj you should have acces to Ginfo where this is solved. Send me a private message if you really need to solve this.

lots of thanks

Hi ..
This is killing me:
You are given a tree with N vertexes. Write a program, that adds (if possible) a minimum number of edges so that each vertex becomes a part of not more than ONE cycle.
Sample input:
n=7
1 2
1 3
3 5
3 4
5 6
5 7
sample output:
6 7
4 2

can you give me at least some basic ...

Am I the only one who doesn't know how to do that one ??