OJ Board

i solved this using kmp string matching algorithm in 0.020 seconds

tnx sunny it helps me a lot !

hi
why TLE ?
is there any infinite loop in my algorithm ? or there is a problem about my algorithm ?
thnx

radius is more correct than radious

i love this problem , i got AC in first try . my program didnt work for some inputs with high precision in this thread , you dont need such precion. i use e-7 as epsilon.

I agree with stcheuung. This problem is so simple.

add results to epsilon and then print them
thanks jan

try to use gcc and set compiler flags to -lm -lcrypt -O2 -pipe -ansi -DONLINE_JUDGE for c .
one time i have a compilation error and it was in comment lines .

can anybody help me , my program passes all the inputs in this thread .

#include<iostream>
#include<list>
#include<map>
#include<string>
#include<cstdlib>
using namespace std ;
#define V 101
typedef list<int> lis ;
int Dis[V] ;
int Min[V] ;
int disco ;
list<int> Tree[V] ; // childs of each vertex ...