📜  具有给定OR值的子集数

📅  最后修改于: 2021-05-04 18:52:05             🧑  作者: Mango

给定长度为N的数组arr [] ,任务是查找具有给定ORM的子集的数量。
例子:

方法:一种简单的方法是通过生成所有可能的子集,然后通过计算具有给定OR值的子集的数量来解决该问题。但是,对于较小的数组元素值,可以使用动态编程来解决。
我们先来看一下递归关系。

可以将上述递归关系定义为子数组arr [i…N-1]的子集数,以便将它们与curr_or进行或运算将产生所需的OR值。
递归关系是合理的,因为只有路径。要么使用当前元素,然后将其与curr_or进行或运算,要么忽略它并继续前进。
下面是上述方法的实现:

C++
// C++ implementation of the approach
#include 
using namespace std;
#define maxN 20
#define maxM 64
 
// To store states of DP
int dp[maxN][maxM];
bool v[maxN][maxM];
 
// Function to return the required count
int findCnt(int* arr, int i, int curr, int n, int m)
{
    // Base case
    if (i == n) {
        return (curr == m);
    }
 
    // If the state has been solved before
    // return the value of the state
    if (v[i][curr])
        return dp[i][curr];
 
    // Setting the state as solved
    v[i][curr] = 1;
 
    // Recurrence relation
    dp[i][curr]
        = findCnt(arr, i + 1, curr, n, m)
          + findCnt(arr, i + 1, (curr | arr[i]), n, m);
 
    return dp[i][curr];
}
 
// Driver code
int main()
{
    int arr[] = { 2, 3, 2 };
    int n = sizeof(arr) / sizeof(int);
    int m = 3;
 
    cout << findCnt(arr, 0, 0, n, m);
 
    return 0;
}


Java
// Java implementation of the approach
import java.util.*;
class GFG
{
     
static int maxN = 20;
static int maxM = 64;
 
// To store states of DP
static int [][]dp = new int[maxN][maxM];
static boolean [][]v = new boolean[maxN][maxM];
 
// Function to return the required count
static int findCnt(int[] arr, int i,
                   int curr, int n, int m)
{
    // Base case
    if (i == n)
    {
        return (curr == m ? 1 : 0);
    }
 
    // If the state has been solved before
    // return the value of the state
    if (v[i][curr])
        return dp[i][curr];
 
    // Setting the state as solved
    v[i][curr] = true;
 
    // Recurrence relation
    dp[i][curr] = findCnt(arr, i + 1, curr, n, m) +
                  findCnt(arr, i + 1, (curr | arr[i]), n, m);
 
    return dp[i][curr];
}
 
// Driver code
public static void main(String []args)
{
    int arr[] = { 2, 3, 2 };
    int n = arr.length;
    int m = 3;
 
    System.out.println(findCnt(arr, 0, 0, n, m));
}
}
 
// This code is contributed by 29AjayKumar


Python3
# Python3 implementation of the approach
import numpy as np
 
maxN = 20
maxM = 64
 
# To store states of DP
dp = np.zeros((maxN, maxM));
v = np.zeros((maxN, maxM));
 
# Function to return the required count
def findCnt(arr, i, curr, n, m) :
 
    # Base case
    if (i == n) :
        return (curr == m);
 
    # If the state has been solved before
    # return the value of the state
    if (v[i][curr]) :
        return dp[i][curr];
 
    # Setting the state as solved
    v[i][curr] = 1;
 
    # Recurrence relation
    dp[i][curr] = findCnt(arr, i + 1, curr, n, m) + \
                  findCnt(arr, i + 1, (curr | arr[i]), n, m);
 
    return dp[i][curr];
 
# Driver code
if __name__ == "__main__" :
 
    arr = [ 2, 3, 2 ];
    n = len(arr);
    m = 3;
 
    print(findCnt(arr, 0, 0, n, m));
 
# This code is contributed by AnkitRai01


C#
// C# implementation of the approach
using System;
     
class GFG
{
     
static int maxN = 20;
static int maxM = 64;
 
// To store states of DP
static int [,]dp = new int[maxN, maxM];
static Boolean [,]v = new Boolean[maxN, maxM];
 
// Function to return the required count
static int findCnt(int[] arr, int i,
                   int curr, int n, int m)
{
    // Base case
    if (i == n)
    {
        return (curr == m ? 1 : 0);
    }
 
    // If the state has been solved before
    // return the value of the state
    if (v[i, curr])
        return dp[i, curr];
 
    // Setting the state as solved
    v[i, curr] = true;
 
    // Recurrence relation
    dp[i, curr] = findCnt(arr, i + 1, curr, n, m) +
                  findCnt(arr, i + 1, (curr | arr[i]), n, m);
 
    return dp[i, curr];
}
 
// Driver code
public static void Main(String []args)
{
    int []arr = { 2, 3, 2 };
    int n = arr.Length;
    int m = 3;
 
    Console.WriteLine(findCnt(arr, 0, 0, n, m));
}
}
 
// This code is contributed by Rajput-Ji


输出
4