hdu 2571

#include <cstdio>
#include <cstring>
#include <algorithm>
int num[25][1010];
int dp[25][1010];

int main()
{
int t,n,m;
int i,j,k;

scanf("%d",&t);

while(t-- && scanf("%d%d",&n,&m))
{
memset(dp,0x80,sizeof(dp));//有可能答案是负数，<span style="font-family: 'Times New Roman';">0x80可以把所有值设为最负的值；</span>
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
scanf("%d",&num[i][j]);

dp[1][0] = dp[0][1] = 0;;
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
{
dp[i][j] = std::max(dp[i-1][j],dp[i][j-1]) + num[i][j];
for(k = 2; k <= j; k++)
if(j%k == 0)
dp[i][j] = std::max(dp[i][j],dp[i][j/k]+num[i][j]);
}

printf("%d\n",dp
[m]);
}
return 0;
}