It is applicable. You can run it instead of N Dijkstra algorithms.

I don't see that in the FAQ, is posting solutions disallowed?

import java.util.*;
public class LonesomeKnight
{
public static void main(String[] args)
{
Scanner key=new Scanner(System.in);
int a=key.nextInt();
String[] grid=new String[a];
for(int i=0;i<a;i++)
{
grid[i]=key.next();
}

for(int i=0;i<a;i++)
{
if(grid[i].equals("a1") || grid[i].equals("h1") || grid[i].equals("a8") || grid[i].equals

("h8"))
{
System.out.println(2);
}
if(grid[i].equals("a2") || grid[i].equals("b1") || grid[i].equals("g1") || grid[i].equals

("h2") || grid[i].equals("a7") || grid[i].equals("b8") || grid[i].equals("h7") || grid

[i].equals("g8") )
{
System.out.println(3);
}
if(grid[i].equals("a3") || grid[i].equals("a4") || grid[i].equals("a5") || grid[i].equals

("a6") || grid[i].equals("b2") || grid[i].equals("b7") || grid[i].equals("c1") || grid

[i].equals("c8") || grid[i].equals("d1") || grid[i].equals("d8") || grid[i].equals("e1") ||

grid[i].equals("e8") || grid[i].equals("f1") || grid[i].equals("f8") || grid[i].equals("g2") ||

grid[i].equals("g7") || grid[i].equals("h1") || grid[i].equals("h8"))
{
System.out.println(4);
}
if(grid[i].equals("b3") || grid[i].equals("b4") || grid[i].equals("b5") || grid[i].equals

("b6") || grid[i].equals("c2") || grid[i].equals("c7") || grid[i].equals("d2") || grid

[i].equals("d7") || grid[i].equals("e2") || grid[i].equals("e7") || grid[i].equals("f2") ||

grid[i].equals("f7") || grid[i].equals("g3") || grid[i].equals("g4") || grid[i].equals("g5") ||

grid[i].equals("g6"))
{
System.out.println(6);
}
if(grid[i].equals("c3") || grid[i].equals("c4") || grid[i].equals("c5") || grid[i].equals

("c6") || grid[i].equals("d3") || grid[i].equals("d4") || grid[i].equals("d5") || grid

[i].equals("d6") || grid[i].equals("e3") || grid[i].equals("e4") || grid[i].equals("e5") ||

grid[i].equals("e6") || grid[i].equals("f3") || grid[i].equals("f4") || grid[i].equals("f5") ||

grid[i].equals("f6"))
{
System.out.println(8);
}

}
}

}

I don't know KMP but I know HASH... and i have accepted...

I got WA 27, and I found that my program could not pass the following test:

7 2
6 4
5 3

The correct answer should be 1 -2 or 2 -1, but my incorrect program output 0. I fixed it and got AC.

I think that Python solutions often work slower than Java solutions and use more memory than Java solutions. What do you think? Judge, what about this?

I had WA 26 too. Stuped mistake. =)

Was:
                (  v + f + i*p + k*q )%2==0 &&
                ( -v + f + i*p - k*q )%2==0 &&
                (  u + s - i*q - k*p )%2==0 &&
                ( -u + s - i*q + k*p )%2==0

This get AC:
                (  v + f + i*(p/g) + k*(q/g) )%2==0 &&
                ( -v + f + i*(p/g) - k*(q/g) )%2==0 &&
                (  u + s - i*(q/g) - k*(p/g) )%2==0 &&
                ( -u + s - i*(q/g) + k*(p/g) )%2==0