HDU 1059 Dividing

#include <iostream>
#define n 7
#define maxn 125005
using namespace std;
int main()
{
long t=0, i, j, l, sum, ans[maxn], v
, num
, m;
while(1)
{
t++;
sum = 0;
for(i = 1; i < n; i++)
{
cin >> num[i];
v[i] = i;
sum += v[i]*num[i];
}
if(sum == 0) break;
m = sum/2;
for(i = 0; i <= m; i++)
ans[i] = 0;
for(i = 1; i < n; i++)
{
if(v[i]*num[i] >= m )
{
for(j = 0; j <= m; j++)
if(j >= v[i] && ans[j-v[i]]+v[i] > ans[j])
ans[j] = ans[j-v[i]]+v[i];
}
else
{
for(j = 1; j < num[i];)
{
for(l = m; l >= j*v[i]; l--)
if(ans[l-j*v[i]]+j*v[i] > ans[l])
ans[l] = ans[l-j*v[i]]+j*v[i];
num[i] -= j;
j = j * 2;
}
for(l = m; l >= num[i]*v[i]; l--)
if(ans[l-num[i]*v[i]]+num[i]*v[i] > ans[l])
ans[l] = ans[l-num[i]*v[i]]+num[i]*v[i];
}
}
cout << "Collection #" << t << ":" << endl;
if(ans[m]*2 == sum && m*2 == sum ) cout << "Can be divided." << endl;
else cout << "Can't be divided." << endl;
cout << endl;
}
return 0;
}