OJ Board

help~
I don't understand why WA.
I use a Levenshtein Distance(edit Distance) algorithims.
help~
[c]
#include <stdio.h>
#define m(x,y) (((x)<(y))?(x):(y))
int t[30][30];
char is[100][10];
main(){
int i,j,min,k;
char ss[21],ts[21];
while(scanf("%s%s",ss,ts)){
if(ss[0]=='#')
break;
t[0][0]=0 ...