search this

Saturday, August 16, 2014

ckimplemenation

import java.io.*;
public class String1
{
public static void main(String arg[])throws IOException
{
int sum=0;
int count=0;
int count1=0;
int i,j,n;
int p[]=new int[100];
int a[]=new int[100];
int t[]=new int[100];
int s[]=new int[100];
int prime;
int sum1=0;
int sum2=0;
int k=0;
DataInputStream ds=new DataInputStream(System.in);
System.out.println("enter the no of term");
n=Integer.parseInt(ds.readLine());
System.out.println("enter the no of term to search");
int n1=Integer.parseInt(ds.readLine());
System.out.println("enter the prime number");
prime=Integer.parseInt(ds.readLine());

System.out.println("enter the data into searching list");
for(i=0;i<n1;i++)
{
p[i]=Integer.parseInt(ds.readLine());
}
System.out.println("enter the data into list");
for(i=0;i<n;i++)
{
a[i]=Integer.parseInt(ds.readLine());
}
for(i=0;i<n1;i++)
{
sum1=sum1*10+p[i];
}
int wn=sum1%prime;

int wd=sum1/prime;

System.out.println("window wn"+wn);
System.out.println("window wd"+wd);
System.out.println("sum1"+sum1);
for(i=0;i<=n-wd;i++)
{
for(j=i;j<=i+n1-1;j++)
{
sum=sum*10+a[j];
}
t[i]=sum%prime;
sum=0;
}
for(i=0;i<=n-wd;i++)
{
if(t[i]==wn)
{
s[k]=i;
k++;

}

}
int s1=0;
while(s1<k)
{
for(i=s[s1];i<s[s1]+n1;i++)
{
sum2=sum2*10+a[i];
}
if(sum2==sum1)
{
count++;
}
else
{
count1++;
}
s1++;
sum2=0;
}
System.out.println(" string matiching no of times is hit="+count);
System.out.println(" suporious hit="+count1);
}
}