OJ Board

is it possible to solve this problem using bfs.
if not possible then pls give me some critical input

#include <stdio.h>
#include <string.h>
#define inf 99999999
#define sz 1100
#define SZ 1100110
long r[]={0,0,-1,1},c[]={-1,1,0,0},dist_joe[sz][sz],dist_fire[sz][sz];
long cur_x,cur_y,que_x[SZ],que_y[SZ],head,tail;
long m,n,test,row,col,i,j,no_fire,joe_x,joe_y,cost;
char array[sz][sz];

void bfs ...

i got ac now i used pow function for interger variable

this my code
#include <stdio.h>
int main()
{
long row,col,man,set[2050][4],r,c,t=0,mat[6][4],i,n,temp,j;
while(scanf("%ld %ld %ld",&row,&col,&man)==3 && ( row !=0 || col !=0 || man!=0) )
{
for(i=1;i<=man;++i)
scanf("%ld %ld",&set[i][1],&set[i][2]);

scanf("%ld %ld",&r,&c);

mat[1][1]=r; mat ...

i got wa many times pls help anybody :(


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

#define min(a,b)(a<b?a:b)
#define max(a,b)(a>b?a:b)
#define inf 99999999

char name[1001][1001];
long d[1000][1000],t=0,c,c1,c2,s,q,cost,k,i,j,flag[1001],fat,place;

int main()
{
while( scanf ...

this is my code if any one have time then try to find my bug please :
i used straight forward mst algorithm :

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include <algorithm>
#include <string>
using namespace std;

long array[100001][4],test,number,i,rank[100001 ...

you must get inputs by using either scanf("%s") or scanf("%c")
because input may be given in the following format

input:
0000 0 0000 00
000 0 0000 #

output:
27

may it helps you

my code



#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
int main()
{
long long i,j,k,p,q,h;
char a[1000000],b[10],c;
while(gets(a))
{
if(!isdigit(a[0]))
{
for(i=strlen(a)-1;i>=0;--i)
{
j=a ;
sprintf(b,"%lld",j);
for(k=strlen(b)-1;k>=0;--k)
printf("%c",b ...