vsooda的专栏

#include using namespace std; const int lmax=300; int c1[lmax+1],c2[lmax+1]; int main() { int n,i,j,k; int elem[17]={1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289}; while(cin>>n && n!=0)

#include using namespace std; const int lmax=125; int c1[lmax+1],c2[lmax+1]; int main() { int n,i,j,k; while (cin>>n) { for (i=0;i<=n;i++) { c1[i]=0; c2[i]=0; } for (i=0;i<=n;i+

#include using namespace std; int c1[10002],c2[10002],a[3]={1,2,5},b[3]; int main() { int n,m,i,j,k,sum; while(cin>>n>>m>>k,n+m+k) { b[0]=n;b[1]=m;b[2]=k; sum=0; for(i=0;i<3;i++) { sum+

#include #include #define Size 60005 #define Max(a,b) a>b?a:b int sum; int dp[Size]; /*01背包*/ void ZeroOnePack(int cost,int weight) { int i; for(i = sum;i>=cost;i--) dp[i]