OJ Board

getting continuos WA. anybody plzzzzzzzzzzzzzzzzz help me. my algorithom is firs find palindrom of length 1, then length 2 ,then 3,& .......... n, where n is the length of the given string. for examp for adam, i check a,d,a,m,ad,da,am,ada,dam,adam respectively . is my approach is wrong? #includ...

1. dfs() find out 1st constraint. 2. dfsb() find out 2nd constraint. 3. dfs2() find out 3rd constraint 4. then i find out 2*2 square using two for loop I m getting continues WA. anyone plzzzzzzzzzzzzzzz help me [code] ///// dfs algorithom #include<iostream> #include<string.h> #include<stdio.h> //#in...

Anybody please help me . This simple code give me WA. ///// dfs algorithom #include<iostream.h> #include<string.h> #include<stdio.h> #include<stdlib.h> //typedef __int64 longlong; //typedef long long longlong; int m,n,visit[100][100],l; char g[100][100],word[100]; int found; void init() { int i,j; ...

#include<iostream.h> #include<stdio.h> #include<string.h> #define max 25000 // #include<conio.h> int main() { // clrscr(); char word[max][max],input[max]; char w[max],mor[max]; long int n,l,i,count,j; //freopen("input.txt","r",stdin); while(gets(input)) { sscanf(input,"%ld ...

#include<iostream.h> #include<stdio.h> #include<math.h> //#include<conio.h> int main() { //clrscr(); long double ha,hb,hc,A,B,C,S,ar,a,b,c,d; int invalid; freopen("input.txt","r",stdin); cin>>invalid; int count=0; while(count<invalid) { cin>>ha>>hb>>hc; if(ha<=0.0||hb<=0.0||hc<=...