import java.util.

*;
class praeqn
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the string");
String ss = sc.nextLine();
int l = ss.length();
String s = "";
for(int i = 0; i < l; i++)
{
s = s + Character.toUpperCase(ss.charAt(i));
}
StringTokenizer st = new StringTokenizer(s, "!?.");
int c = st.countTokens();
int sum = 0;
for(int i = 0; i < c; i++)
{
String s1 = st.nextToken();
StringTokenizer st1 = new StringTokenizer(s1);
int c1 = st1.countTokens();
int ll = s1.length();
sum = sum + ll;
char ch = s.charAt(sum);
String a[] = new String[c1];
for(int j = 0; j < c1; j++)
{
a[j] = st1.nextToken();
}
for(int m = 0; m < c1; m++)
{
for(int n = 1; n < c1 - m; n++)
{
if(a[n - 1].compareTo(a[n]) > 0)
{
String temp = a[n];
a[n] = a[n - 1];
a[n - 1] = temp;
}
}
}
for(int j = 0; j < c1; j++)
{
System.out.print(a[j]+" ");
}
System.out.print(ch);
sum--;
}
}
}

import java.util.*;
class matrix
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
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();
}
int sum = 0;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
if((i == 0 || i == (m - 1)) && (j == 0 || j == (m
- 1)))
sum = sum + a[i][j];
}
}
System.out.println("Sum of the corner elements = "+sum);
}
}

import java.util.*;
class DDarray
{
Scanner sc = new Scanner(System.in);
int m, n;
int mat[][] = new int[m][n];
DDarray(int nr, int nc)
{
m = nr;
n = nc;
}
 public void readMatrix()
{
System.out.println("Enter matrix elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i+1));
for(int j = 0; j < n; j++)
mat[i][j] = sc.nextInt();
}
}
public void sums()
{
int suml = 0;
int sumr = 0;
int sumb = 0;
int nu = n - 1;
for(int i = 0; i < m; i++)
{
suml = suml + mat[i][i];
sumr = sumr + mat[i][nu];
nu--;
}
System.out.println("Sum of left diagonal numbers =
"+suml);
System.out.println("Sum of right diagonal numbers =
"+sumr);
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(i == 0 || j == 0 || i == (m - 1) || j == (n -
1))
sumb = sumb + mat[i][j];
}
}
System.out.println("Sum of boundary numbers = "+sumb);
}
public void showMats()
{
System.out.println("Original Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
System.out.print(mat[i][j]+"\t");
}
System.out.println();
}
System.out.println("Inner Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
 if(i == 0 || j == 0 || i == (m - 1) || j == (n -
1))
{
}
else
System.out.println(mat[i][j]+"\t");
}
System.out.println();
}
}
public static void main(String arg [])
{
DDarray ob = new DDarray(3,3);
ob.readMatrix();
ob.sums();
ob.showMats();
}
}

import java.util.Scanner;
class skew
{
public static void main(String arg [])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
int b[][] = new int[m][m];
System.out.println("Enter numbers of array 'a'");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
for(int j = 0; j < m; j++)
{
a[i][j] = sc.nextInt();
}
}
System.out.println("Array:");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
for(int k = 0; k < m; k++)
{
for(int l = 0; l < m; l++)
{
b[l][k] = a[k][l];
}
}
 int flag = 0;
for(int k = 0; k < m; k++)
{
for(int l = 0; l < m; l++)
{
if(b[k][l] == -a[k][l])
flag++;
}
}
if(flag == (m * m))
System.out.println("Skew-symmetric matrix");
else
System.out.println("Not a Skew-symmetric matrix");
}
}

import java.util.*;
class praeqn2
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
int mm = m * m;
int b[] = new int[mm];
int q = 0, z = 0;
System.out.println("Enter numbers of array 'a'");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
for(int j = 0; j < m; j++)
{
a[i][j] = sc.nextInt();
}
}
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
b[q] = a[i][j];
q++;
}
}
for(int k = 0; k < mm - 2; k++)
{
for(int l = 0; l < ((mm - 1) - k); l++)
{
if(b[l] > b[l + 1])
{
int temp = b[l];
b[l] = b[l + 1];
b[l + 1] = temp;
 }
}
}
System.out.println("Array:");
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("Sorted Array:");
for(int k = 0; k < m; k++)
{
for(int l = 0; l < m; l++)
{
System.out.print(b[z]+"\t");
z++;
}
System.out.println();
}
}
}

import java.util.*;
class StringSep
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the string");
String ss = sc.nextLine();
int l = ss.length();
String s = "";
for(int i = 0; i < l; i++)
{
s = s + Character.toUpperCase(ss.charAt(i));
}
StringTokenizer st = new StringTokenizer(s, "!?.,");
int c = st.countTokens();
int sum = 0;
for(int i = 0; i < c; i++)
{
String s1 = st.nextToken();
StringTokenizer st1 = new StringTokenizer(s1);
int c1 = st1.countTokens();
int ll = s1.length();
sum = sum + ll;
char ch = s.charAt(sum++);
String a[] = new String[c1];
for(int j = 0; j < c1; j++)
{
a[j] = st1.nextToken();
 }
for(int m = 0; m < c1; m++)
{
for(int n = 1; n < c1 - m; n++)
{
if(a[n - 1].compareTo(a[n]) > 0)
{
String temp = a[n];
a[n] = a[n - 1];
a[n - 1] = temp;
}
}
}
for(int j = 0; j < c1; j++)
{
System.out.print(a[j]+" ");
}
System.out.print(ch);
}
System.out.println();
}
}

import java.util.*;
class sort1
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
int p[] = new int[m];
int q[] = new int[m];
int r[] = new int[m];
System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
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();
}
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
switch(i)
 {
case 0: p[j] = a[i][j];
break;
case 1: q[j] = a[i][j];
break;
case 2: r[j] = a[i][j];
break;
default:
}
}
}
for(int i = 0; i < m; i++)
{
for(int j = 1; j < m - i; j++)
{
if(p[j - 1] > p[j])
{
int temp = p[j - 1];
p[j - 1] = p[j];
p[j] = temp;
}
if(q[j - 1] > q[j])
{
int temp = q[j - 1];
q[j - 1] = q[j];
q[j] = temp;
}
if(r[j - 1] > r[j])
{
int temp = r[j - 1];
r[j - 1] = r[j];
r[j] = temp;
}
}
}
System.out.println("Sorted Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
switch(i)
{
case 0: System.out.print(p[j]+"\t");
break;
case 1: System.out.print(q[j]+"\t");
break;
case 2: System.out.print(r[j]+"\t");
break;
default:
}
}
System.out.println();
}
}
}

import java.util.*;
class date
{
public static void main(String arg [])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter Date(dd)");
int dd = sc.nextInt();
System.out.println("Enter Month(mm)");
int mm = sc.nextInt();
System.out.println("Enter Year(yyyy)");
int yyyy = sc.nextInt();
System.out.println("Enter no. of days");
int days = sc.nextInt();
int month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,
30, 31};
int count = 0;
if(yyyy % 4 == 0)
month[2] = 29;
while(count < days)
{
dd++;
count++;
if(dd > month[mm])
{
dd = 1;
mm++;
}
if(mm > 12)
{
mm = 1;
yyyy++;
if(yyyy % 4 == 0)
month[2] = 29;
else
month[2] = 28;
}
}
System.out.println("The Desired Date: "+dd+"-"+mm+"-
"+yyyy);
}
}

import java.util.*;
class printmat
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
 System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
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("Output Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
if((i == 0 || i == (m - 1)) && (j == 0 || j == (m
- 1)))
System.out.print(a[i][j]+"\t");
else if(i == 0 || j == 0 || i == (m - 1) || j ==
(m - 1))
System.out.print(" "+"\t");
else
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
}
}

import java.util.*;
class innersort
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
int n = m - 2;
int nn = n * n;
int b[] = new int[nn];
System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
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();
}
int q = 0;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
if(i == 0 || j == 0 || i == (m - 1) || j == (m -
1))
{
}
else
b[q++] = a[i][j];
}
}
for(int i = 0; i < nn; i++)
{
for(int j = 1; j < nn - i; j++)
{
if(b[j - 1] > b[j])
{
int temp = b[j - 1];
b[j - 1] = b[j];
b[j] = temp;
}
}
}
q = 0;
System.out.println("Output Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
if(i == 0 || j == 0 || i == (m - 1) || j == (m -
1))
System.out.print(a[i][j]+"\t");
else
System.out.print(b[q++]+"\t");
}
System.out.println();
}
}
}

import java.util.*;
class evil
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter number");
 int n = sc.nextInt();
if(n > 2 && n < 100)
{
int nn = n;
int bi = 0;
int i = 0;
int count = 0;
while(nn > 0)
{
bi = bi + (int)((nn % 2) * Math.pow(10, i++));
if(nn % 2 == 1)
count++;
nn = nn / 2;
}
System.out.println("Binary Equivalent of "+n+" =
"+bi);
if(count % 2 == 0)
System.out.println("Evil number");
else
System.out.println("Not an Evil number");
}
else
System.out.println("Out of Range");
}
}

import java.util.*;
class mat
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
char a[][] = new char[m][m];
System.out.println("Enter characters 1, 2 and 3");
char c1 = sc.next().charAt(0);
char c2 = sc.next().charAt(0);
char c3 = sc.next().charAt(0);
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
if(i == 0 || j == 0 || i == (m - 1) || j == (m -
1))
a[i][j] = c2;
else
a[i][j] = c3;
if((i == 0 || i == (m - 1)) && (j == 0 || j == (m
- 1)))
a[i][j] = c1;
}
}
System.out.println("Output 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();
}
}
}

import java.util.*;
class matRev
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
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("Output Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
int rev = 0, rem = 0, p = 0;
int num = a[i][j];
int n = num;
while(num > 0)
{
p++;
num = num / 10;
}
while(n > 0)
{
rem = n % 10;
rev = rev + (int)(rem * Math.pow(10, --p));
n = n / 10;
}
System.out.print(rev+"\t");
 }
System.out.println();
}
}
}

import java.util.*;
class ArmNum
{
int n, l, co;
ArmNum(int nn)
{
n = nn;
co = 0;
}
public int leng(int q)
{
if(q > 0)
return (1 + leng((q / 10)));
else
return 0;
}
public int sum_pow(int i)
{
if(co == 0)
l = leng(i);
int rem;
if(i > 0)
{
rem = i % 10;
co++;
return (sum_pow((i / 10)) + (int)Math.pow(rem, l));
}
else
return 0;
}
public void isArmstrong()
{
if(n == sum_pow(n))
System.out.println("Armstrong Number");
else
System.out.println("Not an Armstrong Number");
}
public static void main(String arg [])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter Number");
int num = sc.nextInt();
ArmNum ob = new ArmNum(num);
ob.isArmstrong();
}
}

import java.util.*;
class banner
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter 3 strings");
String s1 = sc.nextLine();
String s2 = sc.nextLine();
String s3 = sc.nextLine();
int l1 = s1.length();
int l2 = s2.length();
int l3 = s3.length();
int max = Math.max(l1, Math.max(l2, l3));
if(l1 == max && l2 != max && l3 != max)
{
for(int i = l2; i < max; i++)
s2 = s2 + " ";
for(int i = l3; i < max; i++)
s3 = s3 + " ";
}
else if(l2 == max && l1 != max && l3 != max)
{
for(int i = l1; i < max; i++)
s1 = s1 + " ";
for(int i = l3; i < max; i++)
s3 = s3 + " ";
}
else if(l3 == max && l2 != max && l1 != max)
{
for(int i = l2; i < max; i++)
s2 = s2 + " ";
for(int i = l1; i < max; i++)
s1 = s1 + " ";
}
for(int i = 0; i < max; i++)
System.out.println(s1.charAt(i)+" "+s2.charAt(i)+"
"+s3.charAt(i));
}
}

import java.util.*;
class rowcol
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
for(int j = 0; j < m; j++)
 a[i][j] = sc.nextInt();
}
System.out.println("Original Matrix");
for(int i = 0; i < m; i++)
{
int sum = 0;
for(int j = 0; j < m; j++)
{
System.out.print(a[i][j]+"\t");
sum = sum + a[i][j];
}
System.out.print("|\t"+sum);
System.out.println();
}
for(int i = 0; i < m; i++)
{
int sum = 0;
for(int j = 0; j < m; j++)
{
sum = sum + a[j][i];
}
System.out.print(sum+"\t");
}
}
}

import java.util.*;
class vowcon
{
public static void main(String args[])
{
String rest = "";
Scanner sc =new Scanner(System.in);
System.out.println("ENTER A SENTENCE");
String str = sc.nextLine();
StringTokenizer st = new StringTokenizer(str);
int l1 = st.countTokens();

System.out.println("WORD"+"\t\t"+"VOWEL"+"\t\t"+"CONSONANTS");
for(int i = 0; i < l1; i++)
{
String s = st.nextToken();
int l2 = s.length();
String word = s.substring(0,1).toUpperCase();
s = word + s.substring(1,l2);
int cc = 0, cv = 0;
for(int j = 0; j < l2; j++)
{
char c = s.charAt(j);
if(c == 'a'||c == 'e'||c == 'i'||c == 'o'||c ==
'u'||c == 'A'||c == 'E'||c == 'I'||c == 'O'||c == 'U')
{
cv++;
}
 else
{
cc++;
}
}
if(l2 < 7)
System.out.println(s+"\t\t\t"+cv+"\t\t"+cc);
else
System.out.println(s+"\t\t"+cv+"\t\t"+cc);
}
}
}

import java.util.*;
class trimat
{
public static void main(String arg [])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
int a[][] = new int[m][m];
System.out.println("Enter numbers of array 'a'");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
for(int j = 0; j < m; j++)
{
a[i][j] = sc.nextInt();
}
}
System.out.println("Array:");
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("Upper Triangular Array:");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < m; j++)
{
if(i > j)
System.out.print(" "+"\t");
else
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
System.out.println("Lower Triangular Array:");
for(int i = 0; i < m; i++)
 {
for(int j = 0; j < m; j++)
{
if(i < j)
System.out.print(" "+"\t");
else
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
}
}

import java.util.*;
class primorial
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter number");
int n = sc.nextInt();
int prod = 1;
int i = 0;
int count = 0;
while(i <= n)
{
int l = 2;
while(l <= i)
{
if(i % l == 0)
count++;
l++;
}
if(count > 2)
{
prod = prod * i;
}
i++;
}
System.out.println(prod);
}
}

import java.util.*;
class reverse
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the string");
String s = sc.nextLine();
int l = s.length();
StringTokenizer st = new StringTokenizer(s);
int c = st.countTokens();
 String a[] = new String[c];
for(int i = 0; i < c; i++)
{
String s1 = st.nextToken();
a[i] = s1;
}
for(int k = c - 1; k >= 0; k--)
{
System.out.print(a[k]+" ");
}
}
}

import java.util.*;
class maxmin
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter M");
int m = sc.nextInt();
System.out.println("Enter N");
int n = sc.nextInt();
int a[][] = new int[m][n];
int nn = m * n;
int b[] = new int[nn];
int max, min;
System.out.println("Enter elements");
for(int i = 0; i < m; i++)
{
System.out.println("Row "+(i + 1));
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 q = 0;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
b[q++] = a[i][j];
}
}
for(int i = 0; i < nn; i++)
{
for(int j = 1; j < nn - i; j++)
{
if(b[j - 1] > b[j])
 {
int temp = b[j - 1];
b[j - 1] = b[j];
b[j] = temp;
}
}
}
max = b[nn - 1];
min = b[0];
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(a[i][j] == max)
{
System.out.println("Largest Number = "+max);
System.out.println("Row = "+(i + 1));
System.out.println("Column = "+(j + 1));
}
if(a[i][j] == min)
{
System.out.println("Smallest Number = "+min);
System.out.println("Row = "+(i + 1));
System.out.println("Column = "+(j + 1));
}
}
}
q = 0;
System.out.println("Rearranged Matrix");
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
System.out.print(b[q++]+"\t");
}
System.out.println();
}
}
}

import java.util.*;
class repalin
{
public int rev(int num)
{
int rem = 0;
int sum = 0;
int n = num;
int i = 0;
while(n > 0)
{
rem = n % 10;
sum = sum + (int)(rem * Math.pow(10, i++));
n = n / 10;
 }
return sum;
}
public static void main(String args[])
{
repalin ob = new repalin();
Scanner sc = new Scanner(System.in);
System.out.println("Enter number");
int n = sc.nextInt();
System.out.println(ob.rev(n));
/*int sum = 0;
int i = 0;
while((i == 0)||(sum != ob.rev(sum)))
{
i = 1;
sum = sum + n + ob.rev(n);
n = sum;
}*/
}
}

import java.util.*;
class SortedBoundary_SpiralArrange
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the no of rows and column");
int m=sc.nextInt();
int A[][]=new int[m][m];
int B[]=new int[m*m];
int sum=0;
System.out.println("Enter the array");
for (int i=0;i<m;i++)
{
for (int j=0;j<m;j++)
{
A[i][j]=sc.nextInt();

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

int x=0;
for(int i=0;i<m;i++)
{
for(int j=0;j<m;j++)
 {
if(i == 0 || j == 0 || i == m-1 || j == m-1) //
Condition for boundary elements
{
B[x] = A[i][j];
x++;
sum = sum + A[i][j]; // Finding sum of
boundary elements
}
}
}

for(int i=0; i<x-1; i++)

{
for(int j=0; j<x-i-1; j++)
{
if(B[j]>B[j+1]) // for ascending use B[i]>B[j]
{
int temp = B[j];
B[j] = B[j+1];
B[j+1] = temp;
}
}
}

int R1=0, R2=m-1, C1=0, C2=m-1; x=0;

for(int i=C1;i<=C2;i++) // accessing the top row
{
A[R1][i]=B[x++];
}
for(int i=R1+1;i<=R2;i++) // accessing the right column
{
A[i][C2]=B[x++];
}
for(int i=C2-1;i>=C1;i--) // accessing the bottom row
{
A[R2][i]=B[x++];
}
for(int i=R2-1;i>=R1+1;i--) // accessing the left column
{
A[i][C1]=B[x++];
}

for(int i=0;i<m;i++)
{
for(int j=0;j<m;j++)
{
System.out.print(A[i][j]+"\t");
}
System.out.println();
}
}
}
class c1Fraction
{
int Nr, Dr;
c1Fraction()
{
}
c1Fraction(int pn, int pd)
{
Nr = pn;
Dr = pd;
}
public void fnPrintFraction()
{
System.out.println(Nr+"/"+Dr);
}
c1Fraction fnReduceFraction(c1Fraction F1)
{
int hc = fnHCF(F1.Nr, F1.Dr);
System.out.println("HCF of Nr & Dr = "+hc);
F1.Nr = F1.Nr / hc;
F1.Dr = F1.Dr / hc;
return F1;
}
int fnHCF(int p, int q)
{
int hcf = 1;
int sm = (p < q) ? p : q;
for(int i = sm; i >= 1; i--)
{
if(p % i == 0 && q % i == 0)
{
hcf = i;
break;
}
}
return hcf;
}
public static void main(String arg [])
{
c1Fraction obj = new c1Fraction(90, 55);
System.out.println("Fraction Before Reduction:");
obj.fnPrintFraction();
obj = obj.fnReduceFraction(obj);
System.out.println("Fraction After Reduction:");
obj.fnPrintFraction();
}
}

import java.util.*;
class numbernames
{
public static void main(String arg [])
{
 Scanner sc = new Scanner(System.in);
System.out.println("Enter number");
int n = sc.nextInt();
if(n < 1000)
{
String less20[] = {"ZERO", "ONE", "TWO", "THREE",
"FOUR", "FIVE", "SIX", "SEVEN", "EIGHT", "NINE", "TEN", "ELEVEN",
"TWELVE", "THIRTEEN", "FOURTEEN", "FIFTEEN", "SIXTEEN",
"SEVENTEEN", "EIGHTEEN", "NINETEEN"};
String tens[] = {"", "", "TWENTY", "THIRTY", "FORTY",
"FIFTY", "SIXTY", "SEVENTY", "EIGHTY", "NINETY"};
int num = n;
int rem = 0;
int set = 0;
int p = 0;
String name = "";
while(num > 0)
{
rem = (num % 10);
set = set + (num % 10) * (int)Math.pow(10, p++);
if(set < 20)
name = less20[set];
if(set >= 20 && set < 100)
{
while(rem > 9)
{
rem = rem / 10;
}
if(name == "ZERO")
name = tens[rem];
else
name = tens[rem] +" "+ name;
}
if(set >= 100 && set < 1000)
{
while(rem > 9)
{
rem = rem / 10;
}
if(name == "ZERO")
name = less20[rem] +" HUNDRED";
else
name = less20[rem] +" HUNDRED AND "+ name;
}
num = num / 10;
}
System.out.println(name);
}
else
{
System.out.println("Error! Number exceeds limit");
}
}
}