fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4. const int Mod=1e9+7;
  5. const ll INF = -10000000000000;
  6.  
  7. void solve() {
  8. int n;
  9. cin >> n;
  10. vector<char> a[n];
  11. for(int i=0;i<n;i++){
  12. for(int j=0;j<n;j++){
  13. char c;
  14. cin >> c;
  15. a[i].push_back(c);
  16. }
  17. }
  18. vector<vector<int>> ans(n,vector<int>(n,0));
  19. ans[0][0]=1;
  20. for(int i=0;i<n;i++){
  21. for(int j=0;j<n;j++){
  22. if(a[i][j]=='*') continue;
  23. if(j+1<n) ans[i][j+1]+=ans[i][j]%Mod;
  24. if(i+1<n) ans[i+1][j]+=ans[i][j]%Mod;
  25. }
  26. }
  27. cout << ans[n-1][n-1];
  28. }
  29.  
  30. int main(){
  31. ios::sync_with_stdio(false);
  32. cin.tie(nullptr);
  33.  
  34. /*int t;
  35.   cin >> t;
  36.   while (t--)*/ solve();
  37.  
  38.  
  39. return 0;
  40. }
  41.  
Success #stdin #stdout 0.01s 5272KB
stdin
4
....
.*..
...*
*...
stdout
3