hdu 4016 Magic Bitwise And Operation dfs+位运算剪枝

&的数字越多值越小，所以一直递归下去值是变小的

View Code

#include <stdio.h>
#include <algorithm>
using namespace std;

int n,k;
__int64 ar[50],ans;

void init()
{
    int i;
    scanf("%d%d",&n,&k);
    for (i=0;i<n;i++)
        scanf("%I64d",&ar[i]);
    sort(ar,ar+n);
}

int judge(int id,__int64 num)
{
    int i;
    for (i=id;i<n;i++)
        num&=ar[i];
    return num<ans;
}

void dfs(int index,int j,__int64 num)
{
    int i;
    if(num<ans)ans=num;
    if(index==k)return;
    for (i=j;i<n;i++)
    {
        if(!judge(i,num))continue;
        dfs(index+1,i+1,num&ar[i]);
    }
}

int main()
{
    int i,T,t=0;
    __int64 num=1;
    scanf("%d",&T);
    for (i=0;i<=60;i++)num*=2;
    while (T--)
    {
        init();
        ans=num;
        dfs(0,0,num-1);
        printf("Case #%d: %I64d\n",++t,ans);
    }
    return 0;
}

转载于:https://www.cnblogs.com/104-gogo/archive/2012/07/12/2587687.html