Anmol 3
Anmol 3
Anmol 3
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
while (true) {
while (true) {
System.out.println("enter number to be prime ");
int i = scanner.nextInt();
k = i;
System.out.println("exit for 1");
i = scanner.nextInt();
if (i == 1) {
break;
} else {
}
}
int o, u = 0, c = 0, min = 0, max, lc = 0;
o = 0;
}
if (min > 0) {
System.out.println("not prime");
} else {
System.out.println(" prime");
}
System.out.println("exit for 1"); int i = scanner.nextInt();
if (i == 1) { break;
} else {
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
while (true) {
System.out.println("enter number to be reverse");
int i = scanner.nextInt();
int o = i, c = 0;
while (o != 0) {
o /= 10;
c += 1;
}
System.out.println(c);
int u = c / 2;
Double r = Math.pow(10, u);
System.out.println(r + " " + u);
double t = (i % r);
double y = (i / r);
double g = (t * r * 10) + y;
System.out.println(t + " " + y);
System.out.println(g);
System.out.println("exit for 1");
i = scanner.nextInt();
if (i == 1) {
break;
} else {
}
}
import java.util.ArrayList; import java.util.List; import java.util.Scanner;
while (true) {
System.out.println("enter number to be lcm ");
int i = scanner.nextInt();
list.add(i); System.out.println("exit for 1");
i = scanner.nextInt();
if (i == 1) {
break;
} else {
}
}
}
list.clear();
}
}
import
java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
List<Integer> h = new
ArrayList<>(); int k;
while (true) {
while (true)
{
i = scanner.nextInt();
if (i == 1) {
break;
} else {
}
}
int o, u = k, c = 0, min = 0, max, lc = 0;
o = 0;
list.add(c);
if (k == 0) {
break;
}
k = k / 10;
}
c = list.size();
lc += list.get(j);
}
if (u % lc == 0) {
System.out.println("yes");
} else {
System.out.println("no");
}
}
}
import
java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
List<Integer> h = new
ArrayList<>(); int k, p;
while (true) {
while (true)
int i = scanner.nextInt();
k = i;
System.out.println("x is seed ");
i = scanner.nextInt();
p = i;
System.out.println("exit for 1");
i = scanner.nextInt();
if (i == 1) {
break;
} else {
}
}
int o, u = k, c = 0, min = 0, max, lc = 0;
o = 0;
break;
} else {
c = k % 10;
list.add(c);
}
k = k / 10;
}
c = list.size();
min = u;
} else {
System.out.println("no" + min + " " + p);
}
System.out.println("exit for 1"); int i = scanner.nextInt();
if (i == 1) { break;
} else {
import
java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
List<Integer> h = new
ArrayList<>(); int lcm;
System.out.println("enter number to be arm strong number like
153 ");
int i = scanner.nextInt();
int o = i, g = 0;
if (o == 0) {
break;
} else {
}
int p = t * t * t;
g += p;
o /= 10;
}
if (i == g) {
System.out.println("arm strong number of the given array of
numbers : " + g);
} else {
System.out.println(
"No. It is not an Armstrong No.");
}
}
list.clear();
}
}