import java.util.

*; }

class Upper_triangle

{ int f=0;

static void main() for(i=0;i<3;i++)

{ {

Scanner sc=new Scanner(System.in); for(j=0;j<3;j++)

System.out.print("enter the array 1st"); {

int a[][]=new int[3][3]; if(i<=j&&a[i][j]==0)

int s=0; f=1;

int i,j; if(i>j&&a[i][j]!=0)

for(i=0;i<3;i++) f=1;

{ }

for(j=0;j<3;j++){ }

a[i][j]=sc.nextInt(); if(f!=1)

} System.out.println("upper triangle
matrix");

else
}
System.out.println("NOT upper triangle
System.out.println(); matrix");
for(i=0;i<3;i++) }
{ }
for(j=0;j<3;j++)
import java.util.*;
System.out.print(a[i][j]+"\t");
class check_rowmajor
System.out.println();
{

static void main()

{
Scanner sc=new Scanner(System.in); for(j=0;j<3;j++)

System.out.println("enter the 2d array"); rm[k++]=a[i][j];

int a[][]=new int[3][3]; }

int s=0;

int i,j; k=0;

for(i=0;i<3;i++) sort(rm);

{ for(i=0;i<9;i++)

for(j=0;j<3;j++) System.out.println(rm[i]);

a[i][j]=sc.nextInt();

for(i=0;i<3;i++)

} for(j=0;j<3;j++)

System.out.println("before sort"); a[i][j]=rm[k++];

for(i=0;i<3;i++)

for(j=0;j<3;j++) }

System.out.print(a[i][j]+" "); System.out.println("after sort");

System.out.println(); for(i=0;i<3;i++)

} for(j=0;j<3;j++)

System.out.print(a[i][j]+" ");

int rm[]=new int[9]; System.out.println();

int k=0;

for(i=0;i<3;i++) }

{ }
 static void sort(int t[]) int n=sc.nextInt();

{ System.out.println("enter the 2d array");

int temp=0; int a[][]=new int[n][n];

int i,j; int s=0,p=1;

for(i=0;i<9-1;i++) int i,j;

{ for(i=0;i<n;i++)

for(j=0;j<9-1-i;j++) {

{ for(j=0;j<n;j++)

if(t[j]>t[j+1]) a[i][j]=sc.nextInt();

{ }

temp=t[j];

t[j]=t[j+1]; for(i=0;i<n;i++)

t[j+1]=temp; {

} for(j=0;j<n;j++){

} if(i==0||j==0||i==n-1||j==n-1)

} s=s+a[i][j];

} else

} p=p*a[i][j];}

import java.util.*;

class sum_product_boundry_elements }

static void main() System.out.println("Sum"+" "+s);

{ System.out.println("Product"+" "+p);

Scanner sc=new Scanner(System.in); }

System.out.println("enter size"); }
***************************************
}
import java.util.*;

class Unit_matrix_check
int f=0;
{
for(i=0;i<3;i++)
static void main()
{
{
for(j=0;j<3;j++)
Scanner sc=new Scanner(System.in);
{
System.out.print("enter the array 1st");
if(i!=j&&a[i][j]!=1)
int a[][]=new int[3][3];
f=1;
int s=0;
if(i==j&&a[i][j]!=0)
int i,j;
f=1;
for(i=0;i<3;i++)
}
{
}
for(j=0;j<3;j++){
if(f!=1)
a[i][j]=sc.nextInt();
System.out.println("unit matrix");
}
else

System.out.println("not unit matrix");

}
}
System.out.println();
}
for(i=0;i<3;i++)
import java.util.*;
{
class max_ineachrow
for(j=0;j<3;j++)
{
System.out.print(a[i][j]+"\t");
static void main()
System.out.println();
{
 Scanner sc=new Scanner(System.in); }

System.out.println("enter size"); }

int n=sc.nextInt(); import java.util.*;

System.out.println("enter the 2d array"); class Sum
int a[][]=new int[n][n]; {
int max; int x,n;
int i,j; double s;
for(i=0;i<n;i++)

{ Sum(int a,int b)
for(j=0;j<n;j++) {
a[i][j]=sc.nextInt(); s=0.0;
} x=a;

n=b;
for(i=0;i<n;i++) }
{ max=a[i][0]; int fact(int n)
for(j=0;j<n;j++) {
{ int f=1,i;
if(a[i][j]>max) for(i=1;i<n;i++)
{ f=f*i;
max=a[i][j]; return f;
System.out.println("max of each }
row"+" "+max);}
double calc()

int i,k=2,j=3;
}
for(i=1;i<=n;i++)
}
 { {

if(i%2==0) Scanner sc=new Scanner(System.in);

s=s-Math.pow(x,k)/fact(j); int c=5;

else System.out.println("accept the array");

s=s+Math.pow(x,k)/fact(j); int a[]=new int[c];

k+=2;j+=3; int i;

}return s; for(i=0;i<c;i++)

} {

void dispaly() a[i]=sc.nextInt();

{ }

System.out.println(s); System.out.println();

} System.out.println("THE PRIME ARRAY

ARE");
static void main()
for(i=0;i<a.length;i++)
{ Scanner sc=new Scanner(System.in);
{
System.out.println("enter the value");
if(isprime(a[i])==true)
int a=sc.nextInt();int b=sc.nextInt();
System.out.println(a[i]);
Sum s1=new Sum(a,b);

s1.calc();
}
s1.dispaly();
}
}
static boolean isprime(int n)
}
{ int i;
import java.util.*;
int c=0;
class Check_Array_prime
for(i=1;i<=n;i++)
{
{if(n%i==0)
static void main()
c++;
 } {

if(c==2) m=(l+u)/2;

return true; if(a[m]==s)

else {f=1;break;}

return false;

} else if(s>a[m])

} l=m+1;

import java.util.*; else

class Binarysearch u=m-1;

{ }

static void main() if(f==1)

{ System.out.println("found");

Scanner sc=new Scanner(System.in); else

System.out.println("enter the size of the System.out.println("not");

array");
}
int n=sc.nextInt();
}
System.out.println("enter the array");
import java.util.*;
int a[]=new int[n];
class Ranklist
int i;
{
for(i=0;i<n;i++)
int roll[];
a[i]=sc.nextInt();
int size;
System.out.println("enter the element to
search"); double mark[];

int s=sc.nextInt(); String name[];

int l=0,u=n-1,f=0,m;

while(l<=u) Ranklist(int s)
{ int j;

size=s; int temp;

roll=new int[size]; double temp1;

mark=new double[size]; String temp2="";

name =new String[size];

void accept() for(i=0;i<size-1;i++)

{Scanner sc=new Scanner (System.in); {int p=size-1;

Scanner sc2=new Scanner (System.in); for(j=0;j<size-i-1;j++)

int i; { if(mark[j]<mark[j+1])

System.out.println("enter the roll"); {

for(i=0;i<size;i++) temp1=mark[j];

{ mark[j]=mark[j+1];

roll[i]=sc.nextInt();} mark[j+1]=temp1;

System.out.println("enter the mark");

for(i=0;i<size;i++){ temp=roll[j];

mark[i]=sc.nextDouble();} roll[j]=roll[j+1];

System.out.println("enter the name"); roll[j+1]=temp;

for(i=0;i<size;i++){

name[i]=sc2.nextLine();} temp2=name[j];

} name[j]=name[j+i];

name[j+i]=temp2;

void prepare() }

{int i; }
 } System.out.println("Enter the size of first
and second array");
void print()
Scanner sc=new Scanner(System.in);
{ System.out.println(" ");
int n=sc.nextInt();
System.out.println("s\troll\tname\tmark");
int y=sc.nextInt();
for(int i=0;i<size;i++)
System.out.println("accept the array");
System.out.println((i+1)+"\t "+roll[i]+"\t
"+name[i]+"\t "+mark[i]); int a[]=new int[n];

} int b[]=new int[y];

static void main() int c[]=new int[n+y];

{ int k=0;

Scanner sc1=new Scanner(System.in); int i;

System.out.println("enter the size"); System.out.println("first array");

int s=sc1.nextInt(); for(i=0;i<n;i++)

Ranklist e1=new Ranklist(s); a[i]=sc.nextInt();

System.out.println("2 array");

e1.accept(); for(i=0;i<y;i++)

e1.prepare(); b[i]=sc.nextInt();

e1.print();

} for(i=0;i<a.length;i++)

} c[k++]=a[i];

*************** for(i=0;i<b.length;i++)

import java.util.*; c[k++]=b[i];

class Merge System.out.println("the merged array");

{ for(i=0;i<c.length;i++)

static void main() System.out.println(c[i]);

{ }}
import java.util.*; System.out.print("equal");

class Reverse_array_check }

{ }

static void main() import java.util.*;

{ class Check_if_two_array_are_equal
System.out.println("Enter the size of the {
array");
static void main()
Scanner sc=new Scanner(System.in);
{
int n=sc.nextInt();
System.out.println("Enter the size of first
System.out.println("accept the array"); and second array");
int a[]=new int[n]; Scanner sc=new Scanner(System.in);
int f=0; int n=sc.nextInt();
int i; int y=sc.nextInt();
System.out.println(" array"); System.out.println("accept the array");
for(i=0;i<n;i++) int a[]=new int[n];
a[i]=sc.nextInt(); int b[]=new int[y];
for(i=0;i<a.length;i++)

{ int f=0;
if(a[i]!=a[n-i-1]) int i;
{f=1; System.out.println("first array");
break; for(i=0;i<n;i++)
} a[i]=sc.nextInt();
} System.out.println();
if(f!=0) System.out.println("2 array");
System.out.print("not equal"); for(i=0;i<y;i++)
else b[i]=sc.nextInt();
 System.out.println(); Scanner sc=new Scanner(System.in);

if(a.length!=b.length) System.out.println("enter the word");

{f=1; String s=sc.nextLine();

} int i;

else String a="";

{ StringTokenizer st=new StringTokenizer(s);

for(i=0;i<a.length;i++) int ct=st.countTokens();

{ for(i=0;i<ct;i++)

if(a[i]!=b[i]) { a=st.nextToken();

{f=1;break;} isencode(a);

} }

if(f!=0) static void isencode(String n)

System.out.println("not equal"); {

else int l,i;

System.out.println("equal");

} String s3="";

} l=n.length();

***************************** char ch;

import java .util.*; for(i=0;i<l;i++)

class Encoding {

{ ch=n.charAt(i);

static void main() ch=(char)(ch+2);

{ if(ch=='y')
 ch='a'; int j=0;

if(ch=='Y') while(temp!=0)

ch='A'; {

if(ch=='z') temp=temp/10;

ch='b'; c++;

if(ch=='Z')

ch='B'; }

s3=s3+ch; int n[]=new int[c];

} while(a!=0)

System.out.print(s3+" "); {

d=a%10;

} a=a/10;

} n[i++]=d;

import java.util.*;

class Descending }

{ int t=0;

static void main() for(i=0;i<c-1;i++)

{ {

Scanner sc=new Scanner(System.in); for(j=0;j<c-i-1;j++)

System.out.println("Enter the number to {

sort");
if(n[j]<n[j+1])
int a=sc.nextInt();
{
int d;
t=n[j];
int c=0;
n[j]=n[j+1];
int temp=a;
n[j+1]=t;
int i=0;
 } System.out.print(ch);

} }

} }

System.out.println("Enter the number is"); }

for(i=0;i<n.length;i++){ }

System.out.print(n[i]);} }

import java.util.*;
} class trail
} {

import java.util.*; static void main()

class Arrange {

{ Scanner sc=new Scanner(System.in);

static void main() System.out.println("enter the word");

{ String s=sc.nextLine();

Scanner sc=new Scanner(System.in); int i;

System.out.println("enter the word"); String a="";

String s=sc.nextLine(); StringTokenizer st=new StringTokenizer(s);

int l=s.length(); int ct=st.countTokens();

char ch; for(i=0;i<ct;i++)

int i=0; { a=st.nextToken();

for(ch='A';ch<='Z';ch++) if(a.length()==1)

{ System.out.print(a+" ");

for(i=0;i<l;i++) else

{ check(a);

if(ch==s.charAt(i)){
 } System.out.println("enter the word");

} String s=sc.nextLine();

static void check(String n) int i;

{ String a="";

int l,i; StringTokenizer st=new StringTokenizer(s);

int ct=st.countTokens();

String s3=""; for(i=0;i<ct;i++)

String b=""; { a=st.nextToken();

l=n.length(); System.out.println(a);

char ch,ch1; if(ispalin(a)==true)

ch=n.charAt(0); System.out.println(a);

ch1=n.charAt(l-1);

s3=n.substring(1,l-1); }

b=ch1+s3+ch; }

System.out.print(b+" "); static boolean ispalin(String s)

} {

int l=s.length();

} int i;char ch;String s1="";

**************** for(i=l-1;i>=0;i--)

import java.util.*; { ch=s.charAt(i);

class palin s1=s1+ch;

{ }

static void main() if(s1.equalsIgnoreCase(s))

{ return true;

Scanner sc=new Scanner(System.in); else

 return false; int i,d=0;

} for(i=1;i<=n;i++)

} {if(n%i==0)

import java.util.*; d++;

class Testprime }if(d==2)

{ return true;

static void main() else

{ return false;

Scanner sc=new Scanner(System.in); }

int i; }

int c=0;int k=0; import java.util.*;

for(i=1;;i++) class Series

{ {

if(prime(i)==true){ static void main()

System.out.println(i); {

c++;} Scanner sc=new Scanner(System.in);

if(c==10) System.out.println("Enter the number x

and limite");
break;
int x=sc.nextInt();
else
int n=sc.nextInt();int i;
continue;
double s=0.0;int j=2,k=2;
}System.out.println("these are the
number"); for(i=1;i<=n;i++)

} {

if(i%2==0)

static boolean prime(int n) s=s-(Math.pow(x,k)/fact(j));

{ else
 s=s+(Math.pow(x,k)/fact(j)); n=n/10;

j+=3; if(d>1){

}System.out.println("SUM IS="+" "+s); f=false;

} break;}

static double fact(int n) if(d==1)

{ double f=1; c++;

int i; }

for(i=1;i<=n;i++) if(c%2==0&&f==true)

f=f*i; System.out.println("CHATHAN number");

return f; else

} System.out.println("not evil number");

} }

import java.util.*; }

class Evil import java.util.*;

{ class Febonaci

static void main() {

{ static void main()

Scanner sc=new Scanner(System.in); {

System.out.println("Enter the number"); Scanner sc=new Scanner(System.in);

int n=sc.nextInt(); System.out.println("ENTER THE NUMBER");

boolean f=true; int n=sc.nextInt();

int d,c=0; int i;

while(n!=0) int a=0,b=1,c=0;

{ System.out.print("0 1");

d=n%10; for(i=1;i<=n;i++)
 {

c=a+b; a=b;b=c;

if(isprime(c)==true);

System.out.print(" "+c); int i;

} for(i=10;i<=1000;i++)

} if(isprime(i)==true&&ispalin(i)==true)

static boolean isprime(int n)

{int d=0;

int p=0; System.out.println("prime palindrome"+i);}

for(p=1;p<=n;p++) }

{ if(n%p==0) static boolean isprime(int n)

d++;} {int c=0;

if(d==2) int p=0;

return true; for(p=1;p<=n;p++)

else { if(n%p==0)

return false; c++;}

} if(c==2)

} return true;

else

class Prime return false;

static void main() }

{ static boolean ispalin(int n)

 { int d=0,temp=0,r=0,b=0,s=0;

temp=n; switch(ch)

while(n!=0){ {

d=n%10; case 'A':a=10;

n=n/10; break;

s=s*10+d;} case 'B':a=11;

if(temp==s) break;

return true; case 'C':a=12;

else break;

return false; case 'D':a=13;

} break;

} case 'E':a=14;

import java.util.*; break;

class hextodec case 'F':a=15;

{ break;

static void main() default:a=ch-48;}

{Scanner sc=new Scanner (System.in);

System.out.println("enter Hexadecimal"); d=d+a*(int)Math.pow(16,r);

String s=sc.nextLine();//BEEF r++;

s=s.toUpperCase(); }

int l=s.length();int a;int r=0; System.out.print(d);

char ch;int d=0; }

int i=0; }

for(i=l-1;i>=0;i--)

{ch=s.charAt(i);//F
 *************** case 13:a="D";

import java.util.*; s=a+s;

class Dectohex break;

{ case 14:a="E";

static void main() s=a+s;

{ break;

System.out.println("Enter the number"); case 15:a="F";

Scanner sc=new Scanner(System.in); s=a+s;

int n=sc.nextInt(); break;

String s="";String a=""; default:s=d+s;}}

int d=0; System.out.print(s);

while(n!=0) }

{ }

d=n%16; **********************

n=n/16; import java.util.*;

switch(d) class Decimaltobinary

{case 10:a="A"; {

s=a+s; static void main()

break; {

case 11:a="B"; System.out.println("Enter the number");

s=a+s; Scanner sc=new Scanner(System.in);

break; int n=sc.nextInt();

case 12:a="C"; String s="";

s=a+s; int d=0;

break; while(n!=0)
 {

d=n%2;

n=n/2; String a="";

s=d+s;} StringTokenizer st=new StringTokenizer(s);

System.out.println(s); int ct=st.countTokens();

int i;

} for(i=0;i<ct;i++)

} {

************************** a=st.nextToken();

import java.util.*; System.out.println("vowels"+"

"+countvo(a));
class Count_Vow
}
{
}
String s;
int countvo(String si)
Count_Vow()
{
{
int i,l,vow=0;
s="";
l=si.length();
}
char ch;si=si.toUpperCase();
void accept()
for(i=0;i<l;i++)
{
{
Scanner sc=new Scanner(System.in);
ch=si.charAt(i);
System.out.println("e");
if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||
s=sc.nextLine(); ch=='U')
} vow++;
void extract() }
{ return vow;
 } }

static void main() }

Count_Vow s1=new Count_Vow();

s1.accept();

s1.extract();

import java.util.*;

class Binarytodec

static void main()

{Scanner sc=new Scanner (System.in);

System.out.println("enter binary");

int n=sc.nextInt();

int s=0;

int d=0,i=0;

while(n!=0)

{d=n%10;

n=n/10;

s=s+d*(int)Math.pow(2,i);

i++;

System.out.print(s);