Solved by 72 users: ...
UserDateAttemptTimeCMSC
bush`02 apr 2006`Ruby2100.19267
Huang_SR`04 jul 2006`C++100.02298
JohnJones_001`30 may 2006`C++100.03298
Woland`11 may 2010`C++1100.07298
TTLovePP`04 jan 2010`C++100.04306
glueray`06 nov 2006`C++400.04316
glueray`06 nov 2006`C++300.03325
mikleb`04 nov 2006`C++1100.03341
DAV`10 feb 2010`C++2000.07346
zmy`27 may 2006`C++100.05347
mircea`06 feb 2006`C++700.05354
 C++ 52 FPC 16 Kylix 2 Java 1 Ruby 1 C 1
` >  >  >  >  >  >  >  >  >  > `

## Murder of mister C

Time limit = 5

Some morning, after Mr. B woke up, he decided to murder Mr. S. Mr. S. has the system of undergroud bunkers. B. knows the map of bunker locations and connections between them. To be secure, Mr. C. has to change his location — every hour he moves to one of neighbour bunkers.

Mr. B. attacks one of the bunkers every hour. But handsome workers of S. repairs the bunker immediately after its being attacked. You need to determine, given the map of bunkers, could Mr. B. manage to develop the attack plan to get rid of S. I.e. according to this plan there will come an hour, when Mr. S. will be in the attacking bunker, not depending on where was he at the start of attacks.

Input The first line contains the number of bunkers.

In the following lines passageways description is given. Each line contains two number — identificators of two bunkers connected with passageway. Identificators are numbers 1,2, ... N. List of passageways ends with two zeros. N ≤ 10 000. Passageways in input are not repeated.

Output Your program should output one line with word 'KILLED' or 'ESCAPED'.

 Input#1```3 1 2 2 3 1 3 0 0 ``` Output#1```ESCAPED ```

Author:
Eugene Barsky

<PREV | Problem set | Search related messages | NEXT>

 © acm.mipt DevGroupThe page was generated in 190ms