80分求查错QAQ

 #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int maxn=800+10;
const int MOD=1e9+7;
int map[maxn][maxn],dp[maxn][maxn][16][2];
int main()
{
    freopen("std.in","r",stdin);
    int n,m,x;
    cin>>n>>m>>x;
    x++;
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++)
      {
          scanf("%d",&map[i][j]);
          dp[i][j][map[i][j]][0]=1;
      }  
    int sum=0;
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;sum=(sum+dp[i][j][0][1])%MOD,j++)
        for(int k=0;k<=x;k++)
        {
              if(i>1)
            {
                dp[i][j][k][0]=(dp[i][j][k][0]+dp[i-1][j][(k-map[i][j]+x)%x][1])%MOD;
                dp[i][j][k][1]=(dp[i][j][k][1]+dp[i-1][j][(k+map[i][j])%x][0])%MOD;
            }
              if(j>1)
              {
                  dp[i][j][k][0]=(dp[i][j][k][0]+dp[i][j-1][(k-map[i][j]+x)%x][1])%MOD;
                  dp[i][j][k][1]=(dp[i][j][k][1]+dp[i][j-1][(k+map[i][j])%x][0])%MOD;
            }
        }
    printf("%d",sum);
    return 0;
}