We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 37024a5 commit 817de9cCopy full SHA for 817de9c
JavaArray02.txt
@@ -1,7 +1,7 @@
1
/*Write a java program that takes 2 integer numbers as input and calculates how many prime numbers exist between them.*/
2
3
import java.util.Scanner;
4
- public class Task02{
+ public class JavaArray02{
5
public static void main(String[]args){
6
Scanner sc=new Scanner(System.in);
7
int n1= sc.nextInt();
@@ -25,4 +25,4 @@ import java.util.Scanner;
25
count++;}}}
26
System.out.println("There are "+count+" prime numbers between "+ n1+" and "+n2);
27
}
28
- }
+ }
0 commit comments