10010 - Where's Waldorf?

#include<stdio.h>
#include<string.h>
#include<ctype.h>
char grid[55][55],words[55];

int locate(char s[],int r,int l,int*m,int*n)
{
inti,j,k,z,east,southeast,south,southwest,west,northwest,north,northeast;
for(i=0;i<(int)strlen(s);i++)
{
for(j=0;j<r;j++)
for(k=0;k<l;k++)
{
if(s[i]==grid[j][k])
{
east=southeast=south=southwest=west=northwest=north=northeast=1;
for(z=1;z<(int)strlen(s);z++)
{
if(!(east==1&&k+z<l&&s[i+z]==grid[j][k+z])) east=0;
if(!(southeast==1&&j+z<r&&k+z<l&&s[i+z]==grid[j+z][k+z]))southeast=0;
if(!(south==1&&j+z<r&&s[i+z]==grid[j+z][k]))south=0;
if(!(southwest==1&&j+z<r&&k-z>=0&&s[i+z]==grid[j+z][k-z]))southwest=0;
if(!(west==1&&k-z>=0&&s[i+z]==grid[j][k-z]))west=0;
if(!(northwest==1&&j-z>=0&&k-z>=0&&s[i+z]==grid[j-z][k-z]))northwest=0;
if(!(north==1&&j-z>=0&&s[i+z]==grid[j-z][k]))north=0;
if(!(northeast==1&&j-z>=0&&k+z<l&&s[i+z]==grid[j-z][k+z]))northeast=0;
}
if(east|southeast|south|southwest|west|northwest|north|northeast==1)
{
*m=j+1; *n=k+1;
return 0;
}
}
}
}
*m=0; *n=0;
return 0;
}

void tolow(char s[])
{
int i;
for(i=0;i<(int)strlen(s);i++)
if(isupper(s[i]))
s[i]=tolower(s[i]);
}

int main()
{
int num,t,i,j,r,l,m,n;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d%d",&r,&l);
for(j=0;j<r;j++)
{
scanf("%s",grid[j]);
tolow(grid[j]);
}
scanf("%d",&t);
for(j=0;j<t;j++)
{
scanf("%s",words);
tolow(words);
locate(words,r,l,&m,&n);
printf("%d %d\n",m,n);
}
if(i!=num-1) 
printf("\n");
}
return 0;
}


發佈了56 篇原創文章 · 獲贊 0 · 訪問量 1萬+
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章