OJ Board

google -> Polya theorem

BigNumbers are not necessry for this problem. The solution for n=1000 fits in long long.

Well I mean prob B and D.
http://acm.uva.es/contest/data/next/problemset/
B:
"Given two patterns, you are to find a phrase that matches both."
So how come for the input:
<a> b
c <a>

Output is
c b

Because the upper <a> is a different <a> than the lower <a> :wink: . You have to divide "tags ...

Maybe this will help:
1
8 ABCHDEFG HCBDAFEG
Output: HCDBFGEA

Two (at least) errors:
* no new line "\n" after each test case
* you print a decimal number instead of digt

chceck this

1
55

your output : 10
my output : 1