OJ Board

Oh!.. You are right, thanks..

I can't find a error in my program - I even see that there can be no bugs. Please help to find a bug in: #include <stdio.h> const int u=27; const long max=100000; //#define _BUG_ long n,p,i,j,k,r; long a ,w ; char ch; FILE *f,*f1; long readCity(){ fscanf(f," "); fscanf(f,"%c",&ch); r=ch-'A'; fscanf(...

Print 'a' min('a' in s1, 'a' in s2) times...
But there can be blank lines too (n)

Hey.. smb knows when the Judge will work again?

Note that "between x and y" can be
from x to y (x<y) or form y to x (y<x)

I don't no the answer
I just want to tell that I've got the same problem: maybe someone knows for sure that test in this problem wrong?

3

I really tried to accept this problem many times. I even wrote a test program - and I'm sure my program outs right answer - I mean correct to transform String1 to String2.
Maybe it's not a best solution, but I'm sure it's right. Maybe someone know a small gluk in this problem?

Just try to get the formula of positions in the (n-1)^2 * (n-1)^2 square(right and down)
see the result for n=4:
1 2 3 4
1 5 6 7
1 8 9 10
1 11 12 13
2 5 8 11
2 6 9 12
2 7 10 13
3 5 9 13
3 6 10 11
3 7 8 12
4 5 10 12
4 6 8 13
4 7 9 11