命运

#include<stdio.h>
#define MIN -1147483648   //设置为-2147483648，可能会出负溢出
int f[21][1001];
int c[21][1001];
void main()
{
int t;
int n,m;
int i,j,k;
int temp;
//  freopen("input.txt","r",stdin);
scanf("%d", &t);
while (t--)
{
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= m; j++)
{
scanf("%d", &f[i][j]);
}
}

for (i = 0; i <= n; i++)
{
for (j = 0; j <= m; j++)
{
c[i][j] = MIN;
}
}
c[0][1] = 0;
c[1][0] = 0;  //只需要设置c[0][1],c[1][0]为0即可

for (i = 1; i <= n; i++)
{
for (j = 1; j <= m; j++)
{
if (c[i - 1][j] > c[i][j - 1])
temp = c[i - 1][j] + f[i][j];
else
temp = c[i][j - 1] + f[i][j];
if (temp > c[i][j])
c[i][j] = temp;
//每算出一个c[i][j]，就更新其后面的与j成倍数的c[i][k*j]。
k = 2;
while (k * j <= m)
{
if (c[i][j] + f[i][k * j] > c[i][k * j])
c[i][k * j] = c[i][j] + f[i][k * j];
k++;
}
}
}
printf("%d\n", c
[m]);
}
}