Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Prime or Not
import java.io.*; import java.util.Scanner; class Rextester { public static void main(String[] args)throws IOException { Scanner sc =new Scanner(System.in); System.out.println("Enter a Number"); int n= sc.nextInt(); int s=0; for (int i=1;i<=n;i++) { if (n%i==0) { s++; } } if (s==2) {System.out.println("Prime number it is "+n); } else {System.out.println("Prime number it is not "+n); } } }
run
|
edit
|
history
|
help
0
OBF-7
1
Add Two Numbers saved in linked lists
Prime Numbers
loding
Word Destructor
練習3-6
Ip address
pattern of the day (code formatting fixed)
Fraction implementation using oops in java