**Red John is Back**

### Problem Statement :

Red John has committed another murder. This time, he doesn't leave a red smiley behind. Instead he leaves a puzzle for Patrick Jane to solve. He also texts Teresa Lisbon that if Patrick is successful, he will turn himself in. The puzzle begins as follows. There is a wall of size 4xn in the victim's house. The victim has an infinite supply of bricks of size 4x1 and 1x4 in her house. There is a hidden safe which can only be opened by a particular configuration of bricks. First we must calculate the total number of ways in which the bricks can be arranged so that the entire wall is covered. The following diagram shows how bricks might be arranged to cover walls where 1 <= n <= 4: image There is one more step to the puzzle. Call the number of possible arrangements M. Patrick must calculate the number of prime numbers P in the inclusive range 0-M. As an example, assume n=3. From the diagram above, we determine that there is only one configuration that will cover the wall properly. 1 is not a prime number, so P=0. A more complex example is n = 5. The bricks can be oriented in total configurations that cover the wall. The two primes 2 and 3 are less than or equal to 3, so P =2. image Function Description Complete the redJohn function in the editor below. It should return the number of primes determined, as an integer. redJohn has the following parameter(s): n: an integer that denotes the length of the wall Input Format The first line contains the integer t, the number of test cases. Each of the next t lines contains an integer n, the length of the 4*n wall. Constraints 1 <= t <= 20 1 <= n <= 40 Output Format Print the integer P on a separate line for each test case.

### Solution :

` ````
Solution in C :
In C++ :
#include <iostream>
#define FOR(i,a) for(int i = 0;i < (a);i++)
#define REP(i,a,b) for(int i = (a);i < (b);i++)
#define SZ(a) ((signed)a.size())
#define PB(a) push_back(a)
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
using namespace std;
int l[1000001],k = 0;
bool prime[1000001] = {0};
void preprocess(){
for(long long i = 2;i < 1000001;i++){
if(!prime[i]){
l[k++] = i;
for(long long j = i*i ; j <= 1000000;j += i) prime[j] = 1;
}
}
}
void solve(){
long long arr[101];
arr[1] = 1,arr[2] = 1,arr[3] = 1,arr[4] = 2;
arr[0] = 1;
REP(i,5,41) arr[i] = (arr[i - 1] + arr[i - 4]);
int c = 0;
int v;
cin>>v;
FOR(i,k){
if(l[i] <= arr[v]) c++;
else break;
}
cout<<c<<"\n";
}
int main(){
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int t;
preprocess();
cin >> t;
FOR(i,t) solve();
return 0;
}
In Java :
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
/**
* Created with IntelliJ IDEA.
* User: Sandesh
* Date: 7/27/13
* Time: 10:47 PM
* To change this template use File | Settings | File Templates.
*/
public class Solution {
static long dp[];
static HashSet<Integer> hs;
public static void main(String arg[]){
hs=new HashSet<Integer>();
dp=new long[41];
Arrays.fill(dp,-1);
Scanner sc=new Scanner(System.in);
int N=sc.nextInt();
setPrime();
for (int j=0;j<N;j++){
int val=sc.nextInt();
int x=(int)(new Solution().get(val));
int ans=0;
for (int i=2;i<=x;i++){
if(hs.contains(i))
ans++;
}
System.out.println(ans);
}
}
public long get(int N){
if(dp[N]!=-1)
return dp[N];
long ans=1;
if(N<=3)
ans=1;
else {
ans=get(N-1)+get(N-4);
}
dp[N]=ans;
return ans;
}
static boolean isPrime(int a){
for (int i=2;i*i<=a;i++){
if(a%i==0)
return false;
}
return true;
}
static void setPrime(){
for (int i=2;i<=217286;i++){
if(isPrime(i))
hs.add(i);
}
}
}
In C :
#include<stdio.h>
#include<stdlib.h>
int sieve[300000][2];
int main()
{
int t,i,j,k,n;
int a[41],x;
a[1]=1;
a[0]=0;
a[2]=1;
a[3]=1;
a[4]=2;
for(i=5;i<=40;i++)
{
a[i]=a[i-1]+a[i-4];
}
// printf("%d\n",a[40]);
for(i=0;i<300000;i++)
{
for(j=0;j<2;j++)
sieve[i][j]=0;
}
for(i=2;i<300000;i++)
{
if(sieve[i][0]==0)
{
sieve[i][1]=sieve[i-1][1]+1;
}
else
{
sieve[i][1]=sieve[i-1][1];
continue;
}
for(j=2*i;j<300000;j=j+i)
{
sieve[j][0]=1;
}
}
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%d",&n);
printf("%d\n",sieve[a[n]][1]);
}
return(0);
}
In Python3 :
nbCombMem = ([],[])
def nbComb(N) :
if N in nbCombMem[0] :
return nbCombMem[1][nbCombMem[0].index(N)]
if N < 0 : return 0
c = 1
for i in range(0,N-3) :
c += nbComb(N-4-i)
nbCombMem[0].append(N)
nbCombMem[1].append(c)
return c
# return the primes (strictly) under n. Use a sieve of erathostene.
def getPrimesUnder(n) :
r = [2]
n2 = n // 2
l = list(True for i in range(0,n2))
l[0] = False
for i in range(1,n2) :
if l[i] :
r.append(2*i+1)
for m in range(2*i*(i+1),n2,2*i+1) :
l[m] = False
return r
# main
T = int(input())
Cs = [nbComb(int(input())) for t in range(0,T)]
Ps = getPrimesUnder(max(Cs)+1)
for t in range(0,T) :
c = 0
while c < len(Ps) and Ps[c] <= Cs[t] : c += 1
print(c)
```

## View More Similar Problems

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →## Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →## Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →## Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →