forked from adityabisoi/ds-algo-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
solution.java
77 lines (63 loc) · 2.05 KB
/
solution.java
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
75
76
77
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class solution {
// Complete the redJohn function below.
static int redJohn(int n) {
if (n < 4)
return 0;
// solve if n >= 4
int[] dp = new int[n + 1];
dp[0] = 0;
dp[1] = 1;
dp[2] = 1;
dp[3] = 1;
dp[4] = 2;
func(dp, n);
return noOfPrimes(dp[n]);
}
static int noOfPrimes(int n) {
if (n < 2)
return 0;
boolean[] prime = new boolean[n + 1];
Arrays.fill(prime, true);
prime[0] = false; // mark 0 as non - prime number
prime[1] = false; // mark 1 ass non- prime number
// logic is any starting true marked boolean is prime 2 3 5 so on
int count = 0; // count the number of prime till n;
for (int i = 2; i <= n; i++) {
if (prime[i]) {
count++;
for (int j = 2; j <= n / i; j++)
prime[j * i] = false;
}
}
return count;
}
static int func(int[] dp, int n) {
// check if we have already stored the solution
if (dp[n] > 0)
return dp[n];
dp[n] = func(dp, n - 1) + ((n > 3) ? func(dp, n - 4) : 0);
return dp[n];
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int t = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int tItr = 0; tItr < t; tItr++) {
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int result = redJohn(n);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
}
bufferedWriter.close();
scanner.close();
}
}