思路:DP
#include<bits\stdc++.h>
using namespace std;
int mp[25][1050];
int dp[25][1050];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n,m;
scanf("%d%d",&n,&m);
for (int i =1 ;i<=n;i++)
for (int j = 1;j<=m;j++)
scanf("%d",&mp[i][j]);
for (int i = 0;i<=n;i++)
for (int j = 0;j<=m;j++)
dp[i][j]=-1e9;
dp[0][1]=dp[1][0]=0;
for (int i = 1;i<=n;i++)
for (int j = 1;j<=m;j++)
{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
for (int k = 2;k<=m;k++)
{
if (j%k==0)
dp[i][j]=max(dp[i][j],dp[i][j/k]);
}
dp[i][j]+=mp[i][j];
}
printf("%d\n",dp[n][m]);
}
}