2013 Multi-University Training Contest 1 Cards

数据不是很大，直接枚举约数，判断4个条件是否满足！

这样就得到4种卡片，总共2^4种情况，枚举各种情况即可！！！

#include<iostream>
#include<cmath>
#include<algorithm>
#define MAX 5000005
#define ll long long
using namespace std;
bool ispri[MAX];
int extra[4];
struct card
{
    int score,num,s;
}p[1002];
bool cmp(const card &aa,const card &bb){
    return aa.score>bb.score?1:0;
}
void init(){
    ll i,j;
    ispri[1]=1;
    for (i=2;i<MAX;i++){
        if (ispri[i]==0){
            for (j=i*i;j<MAX;j+=i)
                ispri[j] = 1;
        }
    }
}
void factor(int n,int k){
    ll i,j,num=0,sum=0,mul=1,t;
    for (i=1;i*i<=n;i++){
        if (n%i==0){
            num ++;
            sum += i;
            mul = (ll)mul*i;
            if (i*i != n){
                num ++;
                sum += n/i;
                mul = (ll)mul*(n/i);
            }
            if (mul == (ll)n*n)
                mul = 1;
        }
    }
    p[k].s =  0;j = 0;
    if (ispri[n]==0){
        p[k].s |= (1<<0);
        j ++;
    }
    if (ispri[num]==0){
        p[k].s |= (1<<1);
        j ++;
    }
    if (ispri[sum]==0){
        p[k].s |= (1<<2);
        j ++;
    }
    t = (ll)sqrt(mul+0.0);
    if (t*t==mul||(t+1)*(t+1)==mul||(t-1)*(t-1)==mul){
        p[k].s |= (1<<3);
        j++;
    }
    p[k].score = j;
}
int main(){
    init();
    int t,i,j,k,n,aa;
    cin>>t;
    while (t--){
        cin>>n>>k;
        for (i=0;i<n;i++){
            cin>>aa>>p[i].num;
            if (aa==1){
                p[i].score = 1;
                p[i].s = (1<<3);
            }
            else factor(aa,i);
        }
        for (i=0;i<4;i++){
            cin>>extra[i];
        }
        cout<<p[0].score;
        for (i=1;i<n;i++){
            cout<<' '<<p[i].score;
        }
        cout<<endl;
        sort(p,p+n,cmp);
        ll ans = -(1<<20);
        for (i=0;i<(1<<4);i++){
            ll temp=0,an=k,flag=0;
            for (j=0;j<n;j++){
                if ((i&p[j].s)==0){
                    if (p[j].num < an){
                        temp += p[j].score*p[j].num;
                        an -= p[j].num;
                        flag |= p[j].s;
                    }
                    else{
                        temp += p[j].score*an;
                        an = 0;
                        flag |= p[j].s;
                        break;
                    }
                }
            }
            for (j=0;j<4;j++){
                if ((flag&(1<<j))==0)
                    temp += extra[j];
            }
            if (an != 0) continue;
            else ans = max(ans,temp);
        }
        cout<<ans<<endl;
    }
    return 0;
}