OJ Board

Please any one tell me that what will be the output when x==y
if x is a city and there is no willing route then d[x] should be -1 right??
and let ,
a b c thee cities and the willing routes are a->b and a->c
and only a has airport then
if the king wants setup a route from b to b then what will ...

Please give some input output

I cannot find my bug !!

I think the given graph can be disconnected !!
My code handled that and got AC.

try this case :

Hello rio??
there is no input like
2 2
0 1
1 0

Is everyone dead!!??!!
please help me!!......
i am filling very bad.........

Here is my code:

//Autor: Muhammad Rifayat Samee
// algorithm: 558(bellman-Ford)

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<stack>
#include<algorithm ...

I have used bellman ford for this
I am getting WA .......
plz help me with some I/O.....
I am getting mad

Why RTE!!??!!

int graph[10005][10005];

void warshall(int v)
{
int i,j,k;

for(k=0;k<v;k++)
{
for(i=0;i<v;i++)
{
for(j=0;j<v;j++)
{
if(graph[i][k] * graph[k][j]!=0)
{
if(graph[i][k]+graph[k][j]<graph[i][j]||graph[i][j] == 0)
{
graph[i][j] = graph[i][k] +graph[k][j ...

Why WA???
please help me

#include<stdio.h>
#include<string.h>
#include<math.h>
#define eps 0.0000001
int main()
{
int n,m,r,k,k1;
double re;

//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(scanf("%d %d",&n,&m)!=EOF)
{


if(n==1||m==1)printf("Boring!\n");
else if ...

MY CODE:


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


void main(void)
{ char year[1000000];
int i,leap,ord;
while (scanf("%s",&year)!=EOF)
{
int mod4,mod100,mod400,mod15,mod55;
mod4=mod100=mod400=mod15=mod55=0;
ord=1;leap=0;
printf("\n");
for (i=0;i<strlen(year);i++)
{
mod4=(mod4*10+year -'0')%4 ...