HDOJ 1398 背包DP

#include<bits/stdc++.h>
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;

const int MAX = 300+5;
int dp[MAX];
int main(){
int n;
while(cin>>n){
if(!n) break;
memset(dp,0,sizeof(dp));
dp[0] = 1;
for(int i = 1 ; i*i <= n ; i++){
for(int j = i*i ; j <= n ; j++)
dp[j] += dp[j-i*i];
}
cout<<dp
<<endl;
}
return 0;
}