import java.util.*;
class GFG {
public static int unvisitedpositions(int N, int d,
int A[])
{
int positionStatus[] = new int[d + 1];
for (int i = 0; i < N; i++) {
if (A[i] <= d && positionStatus[A[i]] == 0) {
for (int j = A[i]; j <= d; j += A[i]) {
positionStatus[j] = 1;
}
}
}
int positionCount = d;
for (int i : positionStatus) {
if (i == 1) {
positionCount--;
}
}
return positionCount;
}
public static void main(String[] args)
{
int N = 3;
int d = 4;
int[] A = { 3, 2, 4 };
int unvisited = unvisitedpositions(N, d, A);
System.out.println(unvisited);
}
}
import java.util.*;
class GFG {
public static int unvisitedpositions(int N, int d,
int A[])
{
int positionStatus[] = new int[d + 1];
for (int i = 0; i < N; i++) {
if (A[i] <= d && positionStatus[A[i]] == 0) {
for (int j = A[i]; j <= d; j += A[i]) {
positionStatus[j] = 1;
}
}
}
int positionCount = d;
for (int i : positionStatus) {
if (i == 1) {
positionCount--;
}
}
return positionCount;
}
public static void main(String[] args)
{
int N = 3;
int d = 4;
int[] A = { 3, 2, 4 };
int unvisited = unvisitedpositions(N, d, A);
System.out.println(unvisited);
}
}