CP/gridpath.cpp at main · mazhar75/CP · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include<iostream>
#define sz 1010
#define mod 1000000007
#define ll long long int
using namespace std;
char a[sz][sz];
ll dp[sz][sz];
void solve(int n)
{
    dp[0][0]=1;
   // cout<<dp[0][0]<<endl;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(a[i][j]=='*')
            {
                dp[i][j]=0;
            }
            else
            {
                if(i-1>=0 && j-1>=0)
                {
                    dp[i][j]=dp[i-1][j]+dp[i][j-1];
                    dp[i][j]=dp[i][j]%mod;
                }
                else if(i-1>=0)
                {
                    dp[i][j]=dp[i-1][j];
                    dp[i][j]=dp[i][j]%mod;
                }
                else if(j-1>=0)
                {   //cout<<i<<" "<<j<<endl;
                   //cout<<dp[i][j-1]<<endl;
                    dp[i][j]=dp[i][j-1];
                    dp[i][j]=dp[i][j]%mod;
                }


            }
        }
    }


}
void init(int n)
{
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            dp[i][j]=0;
        }
    }
}
int main()
{
    //freopen("input.txt","r+",stdin);
    int n;
    cin>>n;
    string s;
    for(int i=0; i<n; i++)
    {
        string s;
        cin>>s;
        for(int j=0; j<n; j++)
        {
            a[i][j]=s[j];
        }
    }
    init(n);
    solve(n);
   /** for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            cout<<dp[i][j]<<" ";
        }
        cout<<endl;
    }
    */
    cout<<dp[n-1][n-1]<<endl;

    return 0;
}