import java.util.

*;
public class program1
{public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number of rows");
int m=sc.nextInt();
System.out.println("Enter the number of columns");
int n=sc.nextInt();
int A[][]=new int[m][n];
System.out.println("Enter "+(m*n)+" elements");
for(int i=0;i<m;i++)
{ for(int j=0;j<n;j++)
{A[i][j]=sc.nextInt();
}
}

System.out.println("Original Matrix");
for(int i=0;i<m;i++)
{ for(int j=0;j<n;j++)
{ System.out.print(A[i][j]+"\t");
}System.out.println();
}
int p= m*n;
int B[]=new int[p];
int x=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
B[x]=A[i][j];
x++;
}
int max=0,pos=0;
int temp;
for(int i=0;i<x-1;i++)
{
max=B[i];
pos=i;
for(int j=i+1;j<x;j++)
{
if(max>B[j])
{
max=B[j];
pos=j;
}
}
temp=B[i];
B[i]=B[pos];
B[pos] = temp;
}
x=0;
 for(int i=0;i<m;i++)
{for(int j=0;j<n;j++)
{
A[i][j]=B[x];
x++;
}
}

System.out.println("Sorted Array : ");

for(int i=0;i<m;i++)
{for(int j=0;j<n;j++)
{
System.out.print(A[i][j]+"\t");
}
System.out.println();
}
System.out.println("Mirror Image :");
for(int i=0;i<m;i++)
{ for(int j=n-1;j>=0;j--)
{
System.out.print(A[i][j]+"\t");
}
System.out.println();
}
}
}

import java.util.*;
public class program2
{ public static void main(String args[])
{ Scanner sc = new Scanner(System.in);
int a[][] = new int[4][4];
System.out.println("Enter array elements");
for(int i=0; i<4; i++)
{ for(int j=0; j<4; j++)
a[i][j] = sc.nextInt();
}
System.out.println("Original Array");
for(int i=0; i<4; i++)
{ for(int j=0; j<4; j++)
System.out.print(a[i][j] +"\t");
System.out.println();
}
int b[] = new int[4*4];
int x=0;
for(int i=0; i<4; i++)
{ for(int j=0; j<4; j++)
b[x++] = a[i][j];
}
sort(b);
x=0;
 for(int i=0; i<4; i++)
{ for(int j=0; j<4; j++)
a[i][j] = b[x++];
}
System.out.println("Sorted Array");
for(int i=0; i<4; i++)
{ for(int j=0; j<4; j++)
System.out.print(a[i][j] +"\t");
System.out.println();
}
System.out.println("Tanspose of the sorted array");
for(int i=0; i<4; i++)
{ for(int j=0; j<4; j++)
System.out.print(a[j][i] +"\t");
System.out.println();
}
}
public static void sort(int a[])
{ for(int j=1; j < a.length; j++)
{ int key = a[j];
int i=j-1;
while((i>-1) && a[i]< key)
{ a[i+1] = a[i];
i--;
}
a[i+1] = key;
}
}
}

import java.util.*;
class program3
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of the Matrix : ");
int m = sc.nextInt();
if (m<3 || m >9)
System.out.println("Invalid Entry");
else
{ int A[][] = new int[m][m];
System.out.println("Enter Elements : ");
for (int i=0; i<m; i++)
{ for (int j=0; j<m; j++)
A[i][j] = sc.nextInt();
}

System.out.println("Original Matrix : ");

for (int i=0; i<m; i++)
{ for (int j=0; j<m; j++)
 System.out.print(A[i][j] + "\t");
System.out.println();
}

System.out.println("Rotated Matrix : ");

for (int i=0; i<m; i++)
{ for (int j=m-1; j>=0; j--)
System.out.print(A[j][i] + "\t");
System.out.println();
}

}
}
}
import java.util.*;
public class program4
{ public static void main(String args[])
{ Scanner sc = new Scanner(System.in);
System.out.println("Enter value of n:");
int n = sc.nextInt();
int a[][] = new int[n][n];
System.out.println("Enter array elements");
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
a[i][j] = sc.nextInt();
}
System.out.println("Original Array");
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
System.out.print(a[i][j] +"\t");
System.out.println();
}
int m = (n*n) - (n-2)*(n-2);
int b[] = new int[m];
int x=0;
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
if (i==0 || j==0 || i==n-1|| j==n-1)
b[x++] = a[i][j];
}
for(int i=0; i<m; i++)
{ for (int j=0; j<m-1; j++)
{ if (b[j] > b[j+1])
{ int temp = b[j];
b[j] = b[j+1];
b[j+1] = temp;
}
}
}

x=0;
 for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
if (i==0 || j==0 || i==n-1|| j==n-1)
a[i][j] = b[x++];
}
int sum=0;
System.out.println("Sorted Array");
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
{ if (i==0||j==0||i==n-1|| j==n-1)
{ System.out.print(a[i][j] +"\t");
sum = sum + a[i][j];
}
else
System.out.print(" " + "\t");
}
System.out.println();
}
System.out.println("Sum of the boundary elements = " + sum);

}
}

import java.util.*;
public class program5
{ public static void main(String args[])
{ Scanner sc = new Scanner(System.in);
System.out.println("Enter value of n:");
int n = sc.nextInt();
int a[][] = new int[n][n];
System.out.println("Enter array elements");
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
a[i][j] = sc.nextInt();
}
System.out.println("Original Array");
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
System.out.print(a[i][j] +"\t");
System.out.println();
}
int m = n+n;
int b[] = new int[m];
int x=0;
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
if (i==j ||((i+j)==(n-1)))
b[x++] = a[i][j];
}
for(int i=0; i<m; i++)
 { for (int j=0; j<m-1; j++)
{ if (b[j] < b[j+1])
{ int temp = b[j];
b[j] = b[j+1];
b[j+1] = temp;
}
}
}

x=0;
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
if (i==j ||((i+j)==(n-1)))
a[i][j] = b[x++];
}
int sum=0;
System.out.println("Sorted Array");
for(int i=0; i<n; i++)
{ for(int j=0; j<n; j++)
{ if (i==j ||((i+j)==(n-1)))
{ System.out.print(a[i][j] +"\t");
sum = sum + a[i][j];
}
else
System.out.print(" " + "\t");
}
System.out.println();
}
System.out.println("Sum of the diagonal elements = " + sum);

}
}

import java.util.*;
public class program6
{ public static void main()
{ Scanner sc = new Scanner(System.in);
program6 ob = new program6();
System.out.println("Enter a number");
int n = sc.nextInt();
int b = ob.automorphic(n);
if(b==1)
System.out.println("Automorphic Number");
else
System.out.println("Not an Automorphic Number");
}
int automorphic(int a)
{ int t=a;
int sq= a*a;
 int ctr=0, d=0;
while(a> 0)
{ d= a%10;
ctr = ctr+1;
a= a/10;
}
int p= (int)Math.pow(10,ctr);
if(sq%p==t)
return 1;
else
return 0;
}}

import java.util.*;
public class program7
{ public static void main(String args[])
{ Scanner sc = new Scanner(System.in);
program7 ob = new program7();
System.out.println("Enter a number :");
int n = sc.nextInt();

boolean t = ob.prime(n);
int copy = n;
int rev = 0;
while(copy> 0)
{ int d = copy%10;
rev = rev*10 + d;
copy = copy/10;
}
boolean t1 = ob.prime(rev);
if(t==true && t1==true)
System.out.println("Twisted Prime");
else
System.out.println("Not a twisted Prime");
}
public boolean prime(int a)
{ int ctr = 0;
for(int i=1; i<=a; i++)
{ if (a%i==0)
ctr = ctr + 1;
}
if(ctr==2)
return true;
else
return false;
}
}
import java.util.*;
public class program8
{ public static void main(String args[])
{ Scanner sc = new Scanner(System.in);
program8 ob = new program8();
System.out.println("Enter value of n ");
int n = sc.nextInt();
ob.tribonacci(n);
}
void tribonacci(int v)
{ int a=0, b=1,c=2, d=0;
System.out.print(a+ "," + b + "," +c);
for(int i=1; i<=v; i++)
{ d= a+b+c;
System.out.print(","+d);
a=b;
b=c;
c=d;
}
}
}