OJ Board

I also getting wa in this problem.
can anyone give critical input output for this problem????

Now i solve the runtime error but i got Wa now...
Plz give me some critical input output......

I think this is a simple adhoc problem.....
but i got TLE in the contest
can any one give me any clue.....

thanx for advance.

Now i got accepted

but my runtime is 2.904
I use Kruskal + dfs.
can anyone give me any hints to decrease my runtime....

I think this is simple DFS problem.
I called a dfs then check which road length is maximum
and then give the answer.....
Is my approach is ok?

PLZ give me some critical input output....

Thanx for advance help

Thanks naseef.....
Now i got accepted.....

I thought this problem easily. I just do the addition with no of integer from 1 to 26.if this addition greater then no of roads then i use break condition.
But i got WA.
Is that my process is correct ?????

here is my code:

//Removed after accepted...

Advance thanx for help!!!!!!!!!!!

In this problem 1st i find out the power of 2.
if this is power of 2 then i check all node have same no of degree.
if this is same i give output yes.else no.
if this not power of two then i also give answer 2.

but i got WA after 0.044s.
here is my code:

#include<stdio.h>
#include<math.h>
int main ...

I think u not check when arif point is [0,0];
because on that time the position will be negative value.
I also face same problem.

I think now it will be accepted!!!!!!!!!

code removed after accepted.

thank all.

thank u asu

accepted

I solve the this problem by DFS. but it is time limit exceed. here is my code:

#include<stdio.h>

long int k1;

long int g[10001][10001]={0},cl[10001];

long int d,cu[10001];

int dfs();

void dfs_visit(int u);

int main()

{

long int u,r,j,a,y;

long int c,s,i,t;

scanf("%ld",&t);

for(i=1;i ...