OJ Board

Changed that ..... still WA ... can anyone give me some i/o's to check ???
thanx

Isn't the algm. just to check if the graph is a bipartite graph or not ... i.e if there are no odd cycles ????

Can any one point out the bug in the code ....


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

#define INF 999999999

int grid[101][2];
float gph[101][101];

float floydWarshal( int );


main( )
{
int cases,towns,i,j,m,tmp;
float len;
scanf( "%d", &cases );
for( i = 0;i < cases;i ++ )
{
scanf( "%d ...

I don't think u have got the logic right for solving the problem.
Ur program gives wrong result for even inputs like
2 7

Thnx for the posts ... my code had the same bug as the one u posted.

I don't know why its giving TLE

CODE:
#include <stdio.h>
/**Getting a TLE ... i think for some input it might be
* getting stuck in a loop .... but can't figure out for which
* input
*/
#define OVERWRT 0
#define INSERT 1

int curXPos = 0;
int curYPos = 0;
char screen[ 10 ][ 11 ];
int mode ...

I saw all the help on prob.713 and tried all the suggested inputs .... but still i keep getting WA.
Can someone plz lokk at my code below and suggest.......

C code:
---------

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

/*find the revesed sum of 2 numbers .... numbers r upto 200 digits ...