简单dp, 走格子,注意初始化
#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
int a[22][1010];
int dp[22][1010];
int n, m;
int main()
{
int tot;
scanf("%d", &tot );
while( tot-- ) {
scanf("%d %d", &n, &m);
memset( dp, 0, sizeof( dp ) );
for( int i = 1; i <= n; ++i ) {
for( int j = 1; j <= m; ++j ) {
scanf("%d", &a[i][j]);
}
}
dp[1][1] = a[1][1];
for( int i = 1; i <= n; ++i ) {
for( int j = 1; j <= m; ++j ) {
if( i != 1 && j != 1 )
dp[i][j] = max( dp[i-1][j], dp[i][j-1] ) + a[i][j];
else if( i == 1 && j != 1 )
dp[i][j] = dp[i][j-1] + a[i][j];
else if( j == 1 && i != 1 )
dp[i][j] = dp[i-1][j] + a[i][j];
for( int k = 1; k <= j/2; ++k ) {
if( j % k == 0 ) {
dp[i][j] = max( dp[i][j], dp[i][k] + a[i][j] );
}
}
}
}
printf("%d\n", dp[n][m]);
}
return 0;
}