OJ Board

Wrong Answer>>>>>Cant Find Any error:::

For INPUTS------------>>>>>>>>>>>>>

8
6 8
1 2
1 3
2 4
2 5
3 4
3 6
4 6
5 6

100 2
1 2
2 3

5 5
1 2
2 3
3 4
4 5
5 1

6 6
1 2
2 3
3 4
4 5
5 6
6 1

7 14
1 2
1 3
1 4
1 5
1 6
2 3
3 4
5 7
6 7
2 5
4 6
2 4
5 6
1 7

3 3
1 2
2 3
3 1

3 0

100 100
1 2
2 3
3 4
4 5
5 6
6 ...

At lastttttttttt GOT ACCEPTED yeyeye:
My Algo:Using like floyd Warshall starting from any first vertex(let A)...color it 1...take all of its adjacent(let B,C) ..(Now i will color all adjacent of A to -1 but i will have to check a condition that after coloring any adjacent of -1 color should not have ...

There should be at least a topic for every question...So i created this one...
Got Accepted

Wrong Answer !!!!!!5 times in a row...Here is my code ..check it if anyone get time...If anyone have some input for this problem please post that.....

#include<iostream>
#include<math.h>
#define INF 21474478.0
using namespace std;

double links[53][53],checking[53][53],traveling[53][53],solution ...

Getting Wrong Answer
Input for the case

5
7 11
1 7 2
2 7 2
3 7 2
5 7 2
6 7 1
1 6 1
2 6 1
3 6 1
4 6 1
5 6 1
7 6 1


6 1
1 2 3
7 5
1 6 1
2 6 1
3 6 1
4 6 1
5 6 1


10 17
1 9 20
1 7 12
2 3 7
2 8 10
2 7 12
3 8 10
4 8 10
4 6 4
5 7 12
5 9 20
5 9 31
6 9 16
6 10 35
7 8 2
7 9 35
8 9 10
9 10 40

6 5
1 6 10
2 ...

At last i got accepted..
Just putting all char in a squar dimension array..if possible then checking this 2d array ...should be mirror from both diagonals....

I dont think there us any input like

empoopme
done
DONE


because i got accepted and using tolower() for every char input and at last comparing my string with "done" not "DONE"..

Ouput i am having is
You won't be eaten!

NOTTTTTTTT
You won't be eaten!
Uh oh..

This means program an be break at ...

Can anyone tell me the algo for LCA...i am not getting it...

Why i am getting RTE again and again?.......Someone Clarify...........
actully i was using array of 600 edges while edges can be upto 500C2==125000...

I try with long long but still giving me Wrong Answer/................

Wrong Answer again and again....,i got accepted in 10397...and this the same question ....why am i getting wrong answer then?..Someone clarify please...Below is my code...

#include<iostream>
#include<math.h>
using namespace std;

struct grid
{
int x;
int y;
int id;
double key;
int parent ...

@mf
I parshed my input very well....its giving right answers too..where the problem is lying is still hidden to me... i also tried your method and still giving wrong answer to me....

Now i am leaving this question as i think no one here has solved this question or get acepted..I checked a sample ouput in UVATOOLKIT too ...for input and Output we got in that is 8....how can it be possible???It should be 7....

@Force brute
Why didnt you take input for number of test cases.....
i use this--->>>>>>>but getting Wrong Answer again again....Solve someone plzz. #include<iostream>
using namespace std;

struct pointy
{
int x;
int y;
}point[1000];

int main()
{
int T,nop,i,j,k,max,count,flag=0;
char str[10 ...

#include<iostream>
using namespace std;

int main()
{
char str[200],str1[200],str2[200],str3[200];
int i,j,flag,count;
while(gets(str))
{
flag = 0;
i =0;

if(!strcmp(str,"e/o/i"))
break;
for(j=0;str[i]!='/';i++)
str1[j++] = str[i];
str1[j] = '\0';

for(j=0,i=i+1;str[i]!='/';i++)
str2[j ...