Repository navigation
Expand file tree
/
Copy pathCheckAllPrimesInArray.java
More file actions
74 lines (70 loc) · 1.73 KB
/
Copy pathCheckAllPrimesInArray.java
File metadata and controls
74 lines (70 loc) · 1.73 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// Program to return true if all the primes from the smallest prime of the array to largest prime of the array are available in the array.
// Else return false.
import java.util.Scanner;
public class CheckAllPrimesInArray
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] arr=new int[n];
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
System.out.println(checkAllPrimesInArray(arr));
sc.close();
}
public static boolean checkAllPrimesInArray(int[] arr)
{
int minPrime=0;
int maxPrime=0;
for(int i=0;i<arr.length;i++)
{
if(isPrime(arr[i]))
minPrime=arr[i];
maxPrime=arr[i];
}
for(int i=0;i<arr.length;i++)
{
if(isPrime(arr[i]) && arr[i]<minPrime)
{
minPrime=arr[i];
}
}
for(int i=0;i<arr.length;i++)
{
if(isPrime(arr[i]) && arr[i]>maxPrime)
{
maxPrime=arr[i];
}
}
while(minPrime<maxPrime)
{
if(isPrime(minPrime))
{
int c=0;
for(int i=0;i<arr.length;i++)
{
if(arr[i]==minPrime)
c++;
}
if(c==0)
return false;
}
minPrime++;
}
return true;
}
public static boolean isPrime(int n)
{
for(int i=2;i<n/2;i++)
{
if(n%i==0)
{
return false;
}
}
return true;
}
}