for.the.sake.92
BAN USER#include<stdio.h>
#include<string.h>
int count,len;
char a[100][100],s[50],cc;
int m,n;
int vis[100][100];
int see;
void dfs(int i,int j){
vis[i][j]=1;
if(see==len){
count++;
return;
}
if(i-1>=0 && j>=0){
if(s[see]==a[i-1][j] && vis[i-1][j]==0){
see++;
dfs(i-1,j);
vis[i-1][j]=0;
see--;
}
}
if(i>=0 && j-1>=0){
if(s[see]==a[i][j-1] && vis[i][j-1]==0){
see++;
dfs(i,j-1);
vis[i][j-1]=0;
see--;
}
}
if(i+1>=0 && j>=0){
if(s[see]==a[i+1][j] && vis[i+1][j]==0){
see++;
dfs(i+1,j);
vis[i+1][j]=0;
see--;
}
}
if(i>=0 && j+1>=0){
if(s[see]==a[i][j+1] && vis[i][j+1]==0){
see++;
dfs(i,j+1);
vis[i][j+1]=0;
see--;
}
}
}
int main(){
scanf("%d %d",&m,&n);
count=0;
for(int i=0;i<m;i++){
scanf("%c",&cc);
for(int j=0;j<n;j++){
scanf("%c",&a[i][j]);
vis[i][j]=0;
}
}
scanf("%c",&cc);
scanf("%s",s);
len=strlen(s);
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(a[i][j]==s[0]){
see=1;
dfs(i,j);
}
}
}
printf("%d\n",count);
return 0;
}
Input :
4 5
snbsn
bakea
bkbbk
sebse
snakes
Output :
3
- for.the.sake.92 June 08, 2014