// Input an array s that stores 5 strings of maximum size 10. Input another string
// t from the user of maximum size 5. Assume that the strings do not contain any
// blank or whitespace character.
// 
// Write a function that finds the index of first occurrence of substring t in
// each string of s. If the substring is not found, it returns -1. Write another
// function that returns an integer array of size 5 
// Author: rahule@cse.iitk.ac.in

#include<stdio.h>
#include <stdlib.h>
int *substring(char s[][10],char t[10]);
int string_length(char *);
main()
{
  char s[5][10],t[10];
  int i,op[5],*p;
  //enter s and t
  printf("\nEnter 5 strings\n");
  for(i=0;i<5;i++)
    scanf("%s",s[i]);
  printf("\nEnter the string to be searched for :");
  scanf("%s",t);
  //call the function that would return the required array
  p=substring(s,t);
  //print the returned array contents
  for(i=0;i<5;i++)
  printf("    %d",*(p++));
  printf("\n");
}

int *substring(char s[][10],char t[10])
{
  int i,flag,k,*op,j;
  op=malloc(5*sizeof(int));	//creates an array op[5] to store the output
  for(i=0;i<5;i++)	//for each string in s,do
  {
    op[i]=-1;	//initialize op[i]=-1
    for(j=0;j< (string_length(s[i]) - string_length(t)) ;j++)	//for each s[i][j] do...(note that j value only moves till length(s[i]) - length(t)
    {
      flag=0;		//flag = 0 .implies,s[i] dont have a substring t till now
      for(k=0;k<string_length(t);k++)		//checks whether the string starting from s[i][j] is t or not
      {
	if(s[i][j+k]!=t[k])	//if not,set flag as 1 and break..ie string starting from s[i][j] is not equel to t
	{
	  flag=1;
	  j=j+k;
	  break;
	}
      }
      if(flag==0)	//string starting from s[i][j] is  equel to t
      {
	op[i]=j;		//store the index j in the output array
	break;
      }
    }
  }
 return(op);	//return the pointer to output array
     
}

int string_length(char *s)
//funtion to find the string length
{
  int i;
  for(i=0;s[i]!='\0';i++);	//loop till the end of string
  return(i);
}