import java.io.*;
class Search
{
public static void main(String a[])throws Exception
{
tmp ob=new tmp();
ob.check();
}
}
class arr
{
int a[][],n,i,j,k,l,m;
public void inp()throws Exception
{
DataInputStream dd= new DataInputStream(System.in);
System.out.println("Enter a value");
n=Integer.parseInt(dd.readLine());
a=new int[n][n];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=Integer.parseInt(dd.readLine());
}
public void display()
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
System.out.println();
System.out.println();
}
}
class tmp extends arr
{
int a[][],n,i,j,k,l,ch=1;
public void inp()throws Exception
{
super.inp();
DataInputStream dd= new DataInputStream(System.in);
System.out.println("Enter a value");
n=Integer.parseInt(dd.readLine());
a=new int[n][n];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=Integer.parseInt(dd.readLine());
}
public void check()throws Exception
{
inp();
super.display();
for(i=0;i<super.n;i++)
for(j=0;j<super.n;j++)
{
if(super.a[i][j]==a[0][0])
{
try
{
for(k=0;k<n;k++)
for(l=0;l<n;l++)
{
if(super.a[i+k][j+l]!=a[k][l])
ch=0;
}
}
catch(Exception e)
{
ch=0;
}
if(ch==1)
{
System.out.println("found at location "+i+""+j);
return;
}
}
}
System.out.println("Not found");
}
}
class Search
{
public static void main(String a[])throws Exception
{
tmp ob=new tmp();
ob.check();
}
}
class arr
{
int a[][],n,i,j,k,l,m;
public void inp()throws Exception
{
DataInputStream dd= new DataInputStream(System.in);
System.out.println("Enter a value");
n=Integer.parseInt(dd.readLine());
a=new int[n][n];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=Integer.parseInt(dd.readLine());
}
public void display()
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
System.out.println();
System.out.println();
}
}
class tmp extends arr
{
int a[][],n,i,j,k,l,ch=1;
public void inp()throws Exception
{
super.inp();
DataInputStream dd= new DataInputStream(System.in);
System.out.println("Enter a value");
n=Integer.parseInt(dd.readLine());
a=new int[n][n];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=Integer.parseInt(dd.readLine());
}
public void check()throws Exception
{
inp();
super.display();
for(i=0;i<super.n;i++)
for(j=0;j<super.n;j++)
{
if(super.a[i][j]==a[0][0])
{
try
{
for(k=0;k<n;k++)
for(l=0;l<n;l++)
{
if(super.a[i+k][j+l]!=a[k][l])
ch=0;
}
}
catch(Exception e)
{
ch=0;
}
if(ch==1)
{
System.out.println("found at location "+i+""+j);
return;
}
}
}
System.out.println("Not found");
}
}
Comments