Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletions Vaishnavi_PerfectNumber.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
import java.util.Scanner;
public class Vaishnavi_PerfectNumber {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 0;
for (int i = 1; i <= n / 2; i++) {
if (n % i == 0)
sum += i;
}
if (sum == n)
System.out.println("Perfect Number");
else
System.out.println("Not a Perfect Number");
sc.close();
}
}
11 changes: 11 additions & 0 deletions Vaishnavi_PowerOfNumber.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
import java.util.Scanner;
public class Vaishnavi_PowerOfNumber {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int base = sc.nextInt();
int power = sc.nextInt();
double result = Math.pow(base, power);
System.out.println(result);
sc.close();
}
}
24 changes: 24 additions & 0 deletions Vaishnavi_StrongNumber.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
import java.util.Scanner;

public class Vaishnavi_StrongNumber {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int temp = n;
int sum = 0;
while (temp > 0) {
int d = temp % 10;
int fact = 1
for (int i = 1; i <= d; i++) {
fact *= i;
}
sum += fact;
temp /= 10;
}
if (sum == n)
System.out.println("Strong Number");
else
System.out.println("Not a Strong Number");
sc.close();
}
}