小a和uim之大逃离

dp
有两个点
1.方案数只跟差值有关（so kk=>差值）
2.会出现负数，将之转换成与之效果等同的正数差
（ps:k1是题目要求转换）

#include<bits/stdc++.h>
#define ll long long
#define re return
#define inc(i,l,r) for(int i=l;i<=r;++i)

const int mod=1000000007;
char buf[1<<21],*p1,*p2;
inline int gc(){re p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}

template<typename T>inline void rd(T&x)
{
	char c;bool f=0;
	while((c=gc())<'0'||c>'9')if(c=='-')f=1;
	x=c^48;
	while((c=gc())>='0'and c<='9')x=x*10+(c^48);
	if(f)x=-x;
}

using namespace std;
int n,m,k,f[805][805][16][2],b[805][805];

int main()
{
	int ans=0,k1;
	rd(n),rd(m),rd(k);k1=k+1;
	inc(i,1,n)inc(j,1,m)rd(b[i][j]),f[i][j][b[i][j]%k1][0]=1;
	
	inc(i,1,n)inc(j,1,m)
	{
		inc(kk,0,k)
		{
			if(i<=n-1)
			{
				f[i+1][j][(kk-b[i+1][j]+k1)%k1][1]=(f[i+1][j][(k1+kk-b[i+1][j])%k1][1]+f[i][j][kk][0])%mod;
				f[i+1][j][(kk+b[i+1][j])%k1][0]=(f[i+1][j][(kk+b[i+1][j])%k1][0]+f[i][j][kk][1])%mod;
			}
			if(j<=m-1)
			{
				f[i][j+1][(k1+kk-b[i][j+1])%k1][1]=(f[i][j+1][(k1+kk-b[i][j+1])%k1][1]+f[i][j][kk][0])%mod;
				f[i][j+1][(kk+b[i][j+1])%k1][0]=(f[i][j+1][(kk+b[i][j+1])%k1][0]+f[i][j][kk][1])%mod;
			}
	
		}
		ans=(ans+f[i][j][0][1])%mod;
	}
	
	
	printf("%d",ans);
	re 0;
}