CCCPaste

Untitled

#include 
#include
#include
#include
#include
using namespace std;
int n;
int dp[1000][1000];
char square[1000][1000];
int MOD;
int rec(int i=0, int j=0){
    if((i==n-1)and(j==n-1)){
        return 1;
    }

    if(dp[i][j]!=-1){
        return dp[i][j];
    }

int result=0;
if((square[i+1][j]!='*')and(i+1>n;

for(int i=0; i>square[i][j];
    }
}
for(int i=0; i