【题解】Cow Hopscotch S

4 4 4
1 1 1 1
1 3 2 1
1 2 4 1
1 1 1 1

5

#include<bits/stdc++.h>
#define int long long
const int MOD = 1000000007;
using namespace std;
int r,c,k;
int f[1001][1001],a[1001][1001];
signed main(){
//    freopen("hopscotch.in","r",stdin);
//    freopen("hopscotch.out","w",stdout);
    scanf("%lld%lld%lld",&r,&c,&k);
    for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++){
            scanf("%lld",&a[i][j]);
        }
    }
    f[1][1]=1;
    for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++){
            for(int m=1;m<i;m++){
                for(int n=1;n<j;n++){
                    if(a[i][j]!=a[m][n]){
                        f[i][j]+=f[m][n];
                        f[i][j]%=MOD; 
                    }
                }
            }
        }
    }
    printf("%lld",f[r][c]);
    return 0;
}