Here is a problem: http://cpbook.subeen.com/2013/02/khoj-search-1.html
to solve, i've written a code:
Code: Select all
#include<stdio.h>
int find(char input[],char test[],long int i,int j);
int main()
{
long int i=0;
int j=0;
int r,tc;
char input[128];
char test[128];
scanf("%d",&tc);
for(r=0;r<tc;r++){
i=0;j=0;
while((input[i]=getchar())!=' '){
i++;}
while((test[j]=getchar())!='\n'){
j++;}
find(input,test,i,j);
}
//
return 0;
}
int find(char input[],char test[],long int i,int j)
{int ti,tt,f2,flag,k;
ti=i;
tt=j;
for(f2=0;f2<ti;f2++){
for(j=f2,k=0,flag=0;j<f2+tt;k++,j++){
if(test[k]!=input[j])
flag++;}
if(flag==0)
break;
}
printf("%d\n",f2);
return;
}