poj 1837

#include "stdafx.h"//TLE
#include "cstdio"
#include "vector"
#include "algorithm"
#include "set"
#include "iostream"
#include "string"
#include "map"
#include "vector"
typedef long long LL;
using namespace std;
int main()
{ int C[24], G[24];
int c, g;//c代表钩子数，g代表砝码数
map<int,int> oldd, neww;
set<int> olddd, newww;
std::ios::sync_with_stdio(false);
cin.tie(0);
scanf("%d%d", &c, &g);
// cin >> c>> g;
for (int i = 0; i < c; ++i)
{
scanf("%d", C + i);
// cin >> C[i];
}
for (int i = 0; i < g; ++i)
{
scanf("%d", G + i);
// cin >> G[i];
}
olddd.insert(0);
oldd.insert(pair<int, int>(0, 1));
for (int i = 0; i < g; ++i)
{
for (int j = 0; j < c; ++j)
{
set<int>::iterator iter = olddd.begin();
while(iter!=olddd.end())
{
int m1= G[i] * C[j] + *iter;
if (newww.count(m1) == 0)
{
neww.insert(pair<int, int>(m1,oldd[*iter]));
newww.insert(m1);
}
else
{
neww[m1] += oldd[*iter];
}
++iter;
}
}
oldd = neww;
olddd = newww;
neww.clear();
newww.clear();
}
//cout << oldd[0]<< endl;
printf("%d\n", oldd[0]);
    return 0;

}

#include<iostream>

#include<cstring>

using namespace std;

 

int dp[ 25 ][ 15001 ];

int pos[ 25 ],wei[ 25 ];

 

int main()

{

     int c,g;

     int i,j,k;

 

     while (cin>>c>>g)

     {

         for (i= 1 ; i<=c; i++)

             cin>>pos[i];

         for (i= 1 ; i<=g; i++)

             cin>>wei[i];

 

         memset(dp, 0 ,sizeof(dp));

         dp[ 0 ][ 7500 ]= 1 ;    //一个砝码也不挂

 

         for (i= 1 ; i<=g; i++)   //g个砝码

             for (j= 0 ; j<= 15000 ; j++)

                 if (dp[i- 1 ][j])  //说明可以在往上面挂

                     for (k= 1 ; k<=c; k++)   //c个位置

                         dp[i][j+wei[i]*pos[k]]+=dp[i- 1 ][j];

 

         cout<<dp[g][ 7500 ]<<endl;

}

}