POJ 2453

 #include <iostream>
 #include <algorithm>
 #include <cmath>
 #define MAXN 1000
 #define M_15 15
 using namespace std;

 int _b[M_15];
 struct node
 {
     int tot;
     int v;
     int d[];
     node()
     {
         v = ;
         tot = ;
     }
 };

 void fun_3();
 node _[MAXN];
 int fun_2(int sum);
 int fun_1(int d,int k);
 int n;
 int d;
 int main()
 {
     //freopen("acm.acm","r",stdin);

     int k;
     int i;
     int j;
     int p;
     int tem;
     cin>>n;
     cin>>d;
     cin>>k;

     for(i = ; i < n; ++ i)
     {
         cin>>_[i].tot;
         for(j = ; j < _[i].tot; ++ j)
         {
             //cin>>_[i].d[j];
             cin>>tem;
             _[i].d[tem-] = ;
         }
     }
     fun_3();
     cout<<fun_1(d,k)<<endl;
 }

 int fun_1(int d,int k)
 {
     int i;
     int j;
     int sum;
     int max = -;
     for(i = ; i < k; ++ i)
     {
         _b[i] = ;
     }
     sort(_b,_b+d);
     sum = ;
     int tem = ;
     for(i = d-; i >= ; -- i)
     {
         sum += _b[i]*pow((double),tem);
         ++ tem;
     }
 //    cout<<sum<<endl;
     if((tem = fun_2(sum) ) > max)
     {
         max = tem;
     }
 //    cout<<tem<<endl;
     while(next_permutation(_b,_b+d))
     {
         sum = ;
         int tem = ;
         for(i = d-; i >= ; -- i)
         {
             sum += _b[i]*pow((double),tem);
             ++ tem;
         }
 //        cout<<sum<<endl;
         tem = fun_2(sum);
 //        cout<<tem<<endl;
         if(tem > max)
         {
             max = tem;
         }
     }
     return max;

 }

 int fun_2(int sum)
 {
     int i;
     int j;
     int t = ;
     for(i = ; i < n; ++ i)
     {
         if(sum == (sum|_[i].v) )
         {
             ++ t;
         }
     //    cout<<sum<<"_"<<_[i].v<<endl;
     }
 //    cout<<"000000000000000000000————————"<<t<<endl;
     return t;
 }

 void fun_3()
 {
     int tem = ;
     int i;
     int j;
     for(i = ; i < n; ++ i)
     {
         tem = ;
         for(j = d-; j >= ; -- j)
         {
             _[i].v += _[i].d[j]*pow((double),tem);
             ++ tem;
         }
     //    cout<<_[i].v<<endl;
     //    cout<<" d "<<d<<endl;
     }
 }