## Search found 5 matches

Fri Jul 17, 2009 2:35 pm
Forum: Volume 3 (300-399)
Topic: 353 - Pesky Palindromes
Replies: 43
Views: 12290

### Re: 353 WA

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? #include<io...
Sat Jun 27, 2009 2:41 pm
Forum: Volume 115 (11500-11599)
Topic: 11585 - Nurikabe
Replies: 20
Views: 7219

### Re: 11585 - Nurikabe

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...
Fri Jun 26, 2009 9:59 pm
Forum: Volume 112 (11200-11299)
Topic: 11283 - Playing Boggle
Replies: 19
Views: 8227

### Re: 11283 - Playing Boggle

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; ...
Sun Sep 28, 2008 10:34 am
Forum: Volume 105 (10500-10599)
Topic: 10508 - Word Morphing
Replies: 35
Views: 12138