OJ Board

Hi, I am trying to solve the problem 10230 but always got WA. I've tried a lot of test cases, but still can't figure out what's wrong. Can anyone help me with that? Is there some special cases ? Thank you :)

#include<iostream>
#include<stdlib.h>
using namespace std;

int a,b,n,s;
char map[1024 ...

Hi, I think there is some ambiguity in the problem statement. I've post my understanding of this problem here http://online-judge.uva.es/board/viewto ... 20&t=71006 . See if it is useful

Well I've just AC this problem and I think the problem statement has some problem so I write down in case you meet the same problem in the further.

"A two-word compound word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary"

The word exactly has ...

Hi. I got WA for this question. But I think I have removed the case that one word can be fromed in different ways. Can anyone tell some special cases for this problem ? Thanks

And below is my code #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

char *r;
char *f;
int ...