4 3
1 2
2 3
3 4

Luck is possible

5 10
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
4 5
->
Unlucky Petr

Is a big cycle!

Is a non-linear tree!

Edited by author 12.09.2016 06:14

My solution: checked every component graph,
1) if subgraph = Full graph, yes
else
2) if subgraph = linear graph, yes
else
no.
this is right?
sorry, my bad english.

god! help! I don't understand the meaning of the problem.

Why output to syserr cause wa#1?
Is it working as intended?

3- TEST NIMA? WHAT IS 3 TEST


REAL

HERE is my code

var
     n,m,i,k:integer;
     x,y:array [1..10000] of integer;
begin
     readln(n,m);
     k:=0;
     for i:=1 to m do
     begin
     readln(x[i],y[i]);
     if abs(x[i]-y[i])=1 then k:=k+1;
     if abs(x[i]-y[i])=n-1 then k:=k+1;
     end;
     if (k=n) and (k<=m) then writeln('Luck is possible')
     else
     writeln('Unlucky Petr');
     readln;
     readln;
end.

WHAT IS 3 TEST