criyle/codenet-compile-errors huggingface dataset:
Language: C++

#include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };

int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
typedef long long ll;
const int inf = 1000000001;
const ll INF = 1e18 * 4;
const MOD = 1000000007;
using namespace std;

int main(){
    int H, W;
    cin >> H >> W;
    char** S = new char*[H];
    rep(i, 0, H) S[i] = new char[W];
    rep(j, 0, H) cin >> S[j];

    ll dp[1001][1001];
    rep(i, 0, H+1){
       rep(j, 0, W+1){
          dp[i][j] = 0; 
       }
    }

    rep(i, 1, H+1){
        rep(j, 1, W+1){
            if(i == 1 && j == 1) dp[i][j] = 1;
            else if(S[i-1][j-1] == '#'){
                dp[i][j] = 0;
            }
            else{
                dp[i][j] = dp[i-1][j] % MOD + dp[i][j-1] % MOD; 
                dp[i][j] = dp[i][j] % MOD;
            }
        }
    }
    cout << dp[H][W] << endl;
    
    rep(i, 0, H) delete S[i];

    return 0;
}




Compiler output:
a.cc:14:13: error: expected unqualified-id before numeric constant
   14 | #define MOD 1000000007
      |             ^~~~~~~~~~
a.cc:24:7: note: in expansion of macro 'MOD'
   24 | const MOD = 1000000007;
      |       ^~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define mod 10e9 + 7
int main()
{
	int r, c;
	cin>>r>>c;
	int dp[r][c];
	for(int i=0; i<r; i++){
		string s;
		cin>>s;
		for(int j=0; j<c; j++){
			if(s[j] == '.')
				dp[i][j] = 0;
			else
				dp[i][j] = -1;
		}
	}
	dp[r-1][c-1] = 1;
	for(int i=r-2; i>=0; i--){
		if(dp[i][c-1] != -1)
			dp[i][c-1] = dp[i+1][c-1];
	}
	for(int i=c-2; i>=0; i--){
		if(dp[r-1][i] != -1)
			dp[r-1][i] = dp[r-1][i+1];
	}
	for(int i = r-2; i>=0; i--){
		for(int j=c-2; j>=0; j--){
			if(dp[i][j] == -1)
				continue;
			int a=0, b=0;
			if(dp[i+1][j] != -1) 
				a = dp[i+1][j];
			if(dp[i][j+1] != -1)
				b = dp[i][j+1];
			dp[i][j] = (a+b)%mod;
		}
	}
	cout<<dp[0][0];
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:37:41: error: invalid operands of types 'int' and 'double' to binary 'operator%'
   37 |                         dp[i][j] = (a+b)%mod;
      |                                    ~~~~~^
      |                                      |
      |                                      int
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int r, c;
	cin>>r>>c;
	int dp[r][c];
	for(int i=0; i<r; i++){
		string s;
		cin>>s;
		for(int j=0; j<c; j++){
			if(s[j] == '.')
				dp[i][j] = 0;
			else
				dp[i][j] = -1;
		}
	}
	dp[r-1][c-1] = 1;
	for(int i=r-2; i>=0; i--){
		if(dp[i][c-1] != -1)
			dp[i][c-1] = dp[i+1][c-1];
	}
	for(int i=c-2; i>=0; i--){
		if(dp[r-1][i] != -1)
			dp[r-1][i] = dp[r-1][i+1];
	}
	for(int i = r-2; i>=0; i--){
		for(int j=c-2; j>=0; j--){
			if(dp[i][j] == -1)
				continue;
			int a=0, b=0;
			if(dp[i+1][j] != -1) 
				a = dp[i+1][j];
			if(dp[i][j+1] != -1)
				b = dp[i][j+1];
			dp[i][j] = (a+b)%mod;
		}
	}
	cout<<dp[0][0];
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:36:42: error: 'mod' was not declared in this scope; did you mean 'modf'?
   36 |                         dp[i][j] = (a+b)%mod;
      |                                          ^~~
      |                                          modf
Language: C++



#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <climits>
#include <cmath>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>

#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#define size_t unsigned long long
#define ll long long
#define rep(i,a) for(int i=0;i<(a);i++)
#define repr(i,a) for(int i=(int)(a)-1;i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORR(i,a,b) for(int i=(int)(b)-1;i>=a;i--)
#define ALL(a) a.begin(), a.end()
using namespace std;
int si() { int x; scanf("%d", &x); return x; }
long long sl() { long long x; scanf("%lld", &x); return x; }
string ss() { string x; cin >> x; return x; }
void pi(int x) { printf("%d ", x); }
void pl(long long x) { printf("%lld ", x); }
void pd(double x) { printf("%.15f ", x); }
void ps(const string &s) { printf("%s ", s.c_str()); }
void br() { putchar('\n'); }

const int MOD = 1e9 + 7;

struct mint {
    int n;
    mint(int n_ = 0) : n(n_) {}
};

mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }

const int N = 1005;

string s;
int h,w;
char c[505][505];
int gi,gj;
bool memo[505][505];
ll dp[N][N];

long long mod(long long a, long long m) {
    return (a % m + m) % m;
}

// a*b/m
long long mul(long long a, long long b, long long m) {
    a = mod(a, m); b = mod(b, m);
    if (b == 0) return 0;
    long long res = mul(mod(a + a, m), b>>1, m);
    if (b & 1) res = mod(res + a, m);
    return res;
}

ll cal(int i, int j) {

  if(dp[i][j] != -1) return dp[i][j];
  else if(c[i][j] == '#') dp[i][j] = 0;
  else {
    if(i==1 && j==1) dp[i][j] = 1;
    else if(i==1) dp[i][j] = cal(i,j-1);
    else if(j==1) dp[i][j] = cal(i-1, j);
    else dp[i][j] = (cal(i-1,j) + cal(i,j-1)) % MOD;
  }
  return dp[i][j];
}

int main () {
  cin >> h >> w;
  memset(dp, -1, sizeof(dp));
  rep(i,h) {
    cin >> s;
    rep(j,w) {
      c[i+1][j+1] = s[j];
    }
  }
  cal(h,w);
  rep(i,h) rep(j,w) {
  }
  cout << cal(h,w) << endl;;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:87:3: error: 'memset' was not declared in this scope
   87 |   memset(dp, -1, sizeof(dp));
      |   ^~~~~~
a.cc:15:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   14 | #include <stack>
  +++ |+#include <cstring>
   15 |
Language: C++

// Example program
#include<bits/stdc++.h>
using namespace std;


int h,w;
	char arr[2000][2000];
	int  ans[2000][2000];
int main(){
	cin>>h>>w;

	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cin>>arr[i][j];
		}
	}
	for(int i=0;i<=h;i++){
		for(int j=0;j<=w;j++){
			ans[i][j]=0;
		}
	}
	ans[1][1]=1;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			if(arr[i][j]=='.')
				(ans[i][j]%1000000007)+=(ans[i-1][j]%1000000007)+(ans[i][j-1]%1000000007);
		}
	}
	cout<<ans[h][w]%1000000007;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:26:43: error: lvalue required as left operand of assignment
   26 |                                 (ans[i][j]%1000000007)+=(ans[i-1][j]%1000000007)+(ans[i][j-1]%1000000007);
      |                                 ~~~~~~~~~~^~~~~~~~~~~~
Language: C++

// Example program
#include<bits/stdc++.h>
using namespace std;


int h,w;
	char arr[2000][2000];
	int  ans[2000][2000];
int main(){
	cin>>h>>w;

	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cin>>arr[i][j];
		}
	}
	for(int i=0;i<=h;i++){
		for(int j=0;j<=w;j++){
			ans[i][j]=0;
		}
	}
	ans[1][1]=1;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			if(arr[i][j]=='.')
				ans[i][j]%1000000007+=ans[i-1][j]%1000000007+ans[i][j-1]%1000000007;
		}
	}
	cout<<ans[h][w]%1000000007;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:26:42: error: lvalue required as left operand of assignment
   26 |                                 ans[i][j]%1000000007+=ans[i-1][j]%1000000007+ans[i][j-1]%1000000007;
      |                                 ~~~~~~~~~^~~~~~~~~~~
Language: C++

// Example program
#include<bits/stdc++.h>
using namespace std;


int h,w;
	char arr[2000][2000];
	int  ans[2000][2000];
int main(){
	cin>>h>>w;

	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cin>>arr[i][j];
		}
	}
	for(int i=0;i<=h;i++){
		for(int j=0;j<=w;j++){
			ans[i][j]=0;
		}
	}
	ans[1][1]=1;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			if(arr[i][j]=='.')
				ans[i][j]1000000007+=ans[i-1][j]1000000007+ans[i][j-1]1000000007;
		}
	}
	cout<<ans[h][w]%1000000007;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:26:42: error: expected ';' before numeric constant
   26 |                                 ans[i][j]1000000007+=ans[i-1][j]1000000007+ans[i][j-1]1000000007;
      |                                          ^~~~~~~~~~
      |                                          ;
Language: C++

#include <iostream>
#include <vector>
using namespace std;

long long int n, m, dp[1001][1001], matrix[1001][1001];

int recursive(int x, int y){
	if(x>n||y>m)return 0;
	if(dp[node])return dp[node];
	if(x==n&&y==m)return 1;
	if(matrix[x][y+1]!='#'&&matrix[x+1][y]!='#')dp[x][y]=recursive(x+1, y)+recursive(x, y+1);
	else if(matrix[x][y+1]!='#')dp[x][y]=recursive(x, y+1);
	else if(matrix[x+1][y]!='#')dp[x][y]=recursive(x+1, y);
	return dp[x][y];
}

int main(void){
	cin>>n>>m;
	for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>matrix[n][m];
	memset(dp, 0, 1001*1001*sizeof(long long int));
	cout<<recursive(0, 0);

	
	return 0;
}


Compiler output:
a.cc: In function 'int recursive(int, int)':
a.cc:9:15: error: 'node' was not declared in this scope
    9 |         if(dp[node])return dp[node];
      |               ^~~~
a.cc: In function 'int main()':
a.cc:20:9: error: 'memset' was not declared in this scope
   20 |         memset(dp, 0, 1001*1001*sizeof(long long int));
      |         ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    2 | #include <vector>
  +++ |+#include <cstring>
    3 | using namespace std;
Language: C++

#include <iostream>
#include <vector>
using namespace std;

long long int n, m, dp[1001][1001], matrix[1001][1001];

long long int recursive(int x, int y){
	if(x>n||y>m)return 0;
	if(dp[node])return dp[node];
	if(x==n&&y==m)return 1;
	dp[x][y]=(recursive(x+1, y)+recursive(x, y+1))%(1e9+7);
	return dp[x][y];
}

int main(void){
	cin>>n>>m;
	for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>arr[n][m];
	cout<<recursive(0, 0);

	
	return 0;
}


Compiler output:
a.cc: In function 'long long int recursive(int, int)':
a.cc:9:15: error: 'node' was not declared in this scope
    9 |         if(dp[node])return dp[node];
      |               ^~~~
a.cc:11:55: error: invalid operands of types 'long long int' and 'double' to binary 'operator%'
   11 |         dp[x][y]=(recursive(x+1, y)+recursive(x, y+1))%(1e9+7);
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
      |                                    |                       |
      |                                    long long int           double
a.cc: In function 'int main()':
a.cc:17:54: error: 'arr' was not declared in this scope
   17 |         for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>arr[n][m];
      |                                                      ^~~
Language: C++

#include<iostream.h>
using namespace std;
int main()
{
    int h,w; 
    cin>>h>>w;
    long long int dp[1001][1001];
    char a[1001][1001];

    for(int i=1;i<=h;i++)
    {
        for(int j=1;j<=w;j++)
        {
            cin >> a[i][j];
        }
    }
    dp[1][1] = 1;
    for(int i=2;i<1001;i++)
    {
        if(a[i][1]=='.') dp[i][1] = dp[i-1][1];
        if(a[1][i]=='.') dp[1][i] = dp[1][i-1];
    }
    for(int i=2;i<=h;i++)
    {
        for(int j=2;j<=w;j++)
        {
            if(a[i][j]=='.') dp[i][j] = (dp[i-1][j]+dp[i][j-1])%1000000007;
        }
    }
    cout<<dp[h][w];
    return 0;
}                            

Compiler output:
a.cc:1:9: fatal error: iostream.h: No such file or directory
    1 | #include<iostream.h>
      |         ^~~~~~~~~~~~
compilation terminated.
Language: C++

#include<iostream.h>
using namespace std;
int main()
{
    int h,w; 
    cin>>h>>w;
    long long int dp[1001][1001];
    char a[1001][1001];

    for(int i=1;i<=h;i++)
    {
        for(int j=1;j<=w;j++)
        {
            cin >> a[i][j];
        }
    }
    dp[1][1] = 1;
    for(int i=2;i<1001;i++)
    {
        if(a[i][1]=='.') dp[i][1] = dp[i-1][1];
        if(a[1][i]=='.') dp[1][i] = dp[1][i-1];
    }
    for(int i=2;i<=h;i++)
    {
        for(int j=2;j<=w;j++)
        {
            if(a[i][j]=='.') dp[i][j] = (dp[i-1][j]+dp[i][j-1])%MOD;
        }
    }
    cout<<dp[h][w];
    return 0;
}

Compiler output:
a.cc:1:9: fatal error: iostream.h: No such file or directory
    1 | #include<iostream.h>
      |         ^~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))

#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define MOD 1e9+7

#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain; 

/* dp[i][j]: (i, j)での経路) */ 
int dp[1000][1000];
int h, w;
int dx[] = {-1, 0};
int dy[] = {0, -1};

bool inside(int x, int y) {
    return 0<= x && 0 <= y;
}

int main(){
    cin >> h >> w;
    char a[h][w];
    REP(i, h) REP(j, w) cin >> a[i][j];
    dp[0][0] = 1;

    REPN(i, 0, h) REPN(j, 0, w) {
        REP (k, 2) {
            int x = i + dx[k];
            int y = j + dy[k];
            if(!inside(x, y)) continue;
            if(a[x][y] == '#') continue;
            dp[i][j] += dp[x][y] % MOD;
        }
    }

    cout << dp[h-1][w-1] << endl;

    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:42:34: error: invalid operands of types 'int' and 'double' to binary 'operator%'
   42 |             dp[i][j] += dp[x][y] % MOD;
      |                         ~~~~~~~~ ^
      |                                |
      |                                int
Language: C++

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second

const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

int main(){

}


Compiler output:
a.cc: In function 'll inverse(ll)':
a.cc:48:25: error: 'pow_mod' was not declared in this scope
   48 | ll inverse(ll x){return pow_mod(x, MOD - 2);};
      |                         ^~~~~~~
Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <memory.h>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <queue>
#include <stack>
#include <cstdio>
#include <bitset>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define iii pair<int,pair<int,int> >
#define ll long long
#define ull unsigned long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end() 
#define locR(x) (x).rbegin(),(x).rend()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout  
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';



const ld EPS = 1e-18;
const double DEPS = 1e-9;
const ld PI = 3.141592653589793238;
const ull MOD = 1e9 + 7;
const int N = (int)(5e5) + 1;


ll gcd(ll fx, ll fy)
{
	if (!fy) return fx;
	return gcd(fy, fx % fy);
}

inline void fill(int* ar, int sz, int val)
{
	for (int i = 0; i < sz; i++)
	{
		ar[i] = val;
	}
}

int n, m;
ll dp[1001][1001];
char g[1001][1001];

int main()
{
	inp();
	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			scanf(" %c", g[i] + j);
		}
	}

	dp[n - 1][m - 1] = 1;

	for (int i = n - 1; i >= 0; i--)
	{
		for (int j = m - 1; j >= 0; j--)
		{
			if (g[i][j] == '#')continue;

			if (j + 1 < m)
			{
				dp[i][j] += dp[i][j + 1];
			}

			dp[i][j] %= MOD;

			if (i + 1 < n)
			{
				dp[i][j] += dp[i + 1][j];
			}

			dp[i][j] %= MOD;
		}
	}

	printf("%lld", dp[0][0]);
}

Compiler output:
a.cc: In function 'int main()':
a.cc:71:9: error: 'inp' was not declared in this scope; did you mean 'int'?
   71 |         inp();
      |         ^~~
      |         int
Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <memory.h>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <queue>
#include <stack>
#include <cstdio>
#include <bitset>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define iii pair<int,pair<int,int> >
#define ll long long
#define ull unsigned long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end() 
#define locR(x) (x).rbegin(),(x).rend()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout  
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';

#ifndef ONLINE_JUDGE
#define scanf scanf_s
#endif

const ld EPS = 1e-18;
const double DEPS = 1e-9;
const ld PI = 3.141592653589793238;
const ull MOD = 1e9 + 7;
const int N = (int)(5e5) + 1;

void inp()
{
#ifndef ONLINE_JUDGE
	FILE* stream;
	freopen_s(&stream, "inp.txt", "r", stdin);
#endif
}
void out()
{
#ifndef ONLINE_JUDGE
	FILE* stream;
	freopen_s(&stream, "out.txt", "w", stdout);
#endif
}

ll gcd(ll fx, ll fy)
{
	if (!fy) return fx;
	return gcd(fy, fx % fy);
}

inline void fill(int* ar, int sz, int val)
{
	for (int i = 0; i < sz; i++)
	{
		ar[i] = val;
	}
}

int n, m;
ll dp[1001][1001];
char g[1001][1001];

int main()
{
	inp();
	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			scanf(" %c", g[i] + j);
		}
	}

	dp[n - 1][m - 1] = 1;

	for (int i = n - 1; i >= 0; i--)
	{
		for (int j = m - 1; j >= 0; j--)
		{
			if (g[i][j] == '#')continue;

			if (j + 1 < m)
			{
				dp[i][j] += dp[i][j + 1];
			}

			dp[i][j] %= MOD;

			if (i + 1 < n)
			{
				dp[i][j] += dp[i + 1][j];
			}

			dp[i][j] %= MOD;
		}
	}

	printf("%lld", dp[0][0]);
}

Compiler output:
a.cc: In function 'void inp()':
a.cc:56:9: error: 'freopen_s' was not declared in this scope; did you mean 'freopen64'?
   56 |         freopen_s(&stream, "inp.txt", "r", stdin);
      |         ^~~~~~~~~
      |         freopen64
a.cc: In function 'void out()':
a.cc:63:9: error: 'freopen_s' was not declared in this scope; did you mean 'freopen64'?
   63 |         freopen_s(&stream, "out.txt", "w", stdout);
      |         ^~~~~~~~~
      |         freopen64
a.cc: In function 'int main()':
a.cc:43:15: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
   43 | #define scanf scanf_s
      |               ^~~~~~~
a.cc:94:25: note: in expansion of macro 'scanf'
   94 |                         scanf(" %c", g[i] + j);
      |                         ^~~~~
Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <memory.h>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <queue>
#include <stack>
#include <cstdio>
#include <bitset>

using namespace std;

#define nfs ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f first
#define s second
#define m_p make_pair
#define pb push_back
#define ii pair<int,int>
#define iii pair<int,pair<int,int> >
#define int long long
#define ull unsigned long long
#define ld long double
#define ef else if
#define loc(x) (x).begin(),(x).end() 
#define locR(x) (x).rbegin(),(x).rend()
#define no puts("NO")
#define yes puts("YES")
#define ex puts("-1")
#define en puts("")
#define _ cout  
#define __ <<
#define outV(v) for(int i = 0 ; i < v.size() ; i++)cout << v[i] << ' ';
#define outA(x,l,r) for(int i = l ; i < r ; i++)cout << x[i] << ' ';

#ifndef ONLINE_JUDGE
#define scanf scanf_s
#endif

const ld EPS = 1e-18;
const double DEPS = 1e-9;
const ld PI = 3.141592653589793238;
const int N = (int)(5e5) + 1;



inline void fill(int* ar, int sz, int val)
{
	for (int i = 0; i < sz; i++)
	{
		ar[i] = val;
	}
}

int n, m, dp[1001][1001];
char g[1001][1001];

int rec(int x, int y)
{
	if (g[x][y] == '#')return 0;
	if (x == n - 1 && y == m - 1) return 1;

	int& dp = ::dp[x][y];
	if (dp != -1) return dp;
	dp = 0;
	if (x + 1 < n)
	{
		dp = rec(x + 1, y);
	}
	dp %= MOD;
	if (y + 1 < m)
	{
		dp += rec(x, y + 1);
	}
	dp %= MOD;
	return dp;
}

int main()
{
	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			scanf(" %c", g[i] + j);
		}
	}

	memset(dp, -1, sizeof(dp));

	printf("%d", rec(0, 0));
}

Compiler output:
a.cc: In function 'long long int rec(long long int, long long int)':
a.cc:76:15: error: 'MOD' was not declared in this scope
   76 |         dp %= MOD;
      |               ^~~
At global scope:
cc1plus: error: '::main' must return 'int'
a.cc: In function 'int main()':
a.cc:43:15: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
   43 | #define scanf scanf_s
      |               ^~~~~~~
a.cc:93:25: note: in expansion of macro 'scanf'
   93 |                         scanf(" %c", g[i] + j);
      |                         ^~~~~
Language: C++

int main(){
  int r, c;
  cin>>r>>c;
  vector<vector<int>> vec(r+1, vector<int>(c+1, 0));
  for(int i = 1; i<=r; i++){
      for(int j = 1; j<=c; j++){
        char a;
        cin>>a;
        vec[i][j]=a;    
  }
  }
  
  vector<vector<int>> dp(r+1, vector<int>(c+1, 0));
  dp[1][1]=1;
  for(int i = 1; i<=r; i++){
    if(vec[i][1]!='#') dp[i][1] = dp[i-1][1];
  }
  for(int i = 1; i<=c; i++){
    if(vec[1][i]!='#') dp[1][i] = dp[1][i-1];
  }
  
  for(int i = 2; i<=r; i++){
     for(int j = 2; j<=c; j++){
       dp[i][j] = (dp[i-1][j] + dp[i][j-1])%1000000007;
     }
  }
  cout<<dp[r][c]<<endl;  
  
}

Compiler output:
a.cc: In function 'int main()':
a.cc:3:3: error: 'cin' was not declared in this scope
    3 |   cin>>r>>c;
      |   ^~~
a.cc:4:3: error: 'vector' was not declared in this scope
    4 |   vector<vector<int>> vec(r+1, vector<int>(c+1, 0));
      |   ^~~~~~
a.cc:4:17: error: expected primary-expression before 'int'
    4 |   vector<vector<int>> vec(r+1, vector<int>(c+1, 0));
      |                 ^~~
a.cc:9:9: error: 'vec' was not declared in this scope
    9 |         vec[i][j]=a;
      |         ^~~
a.cc:13:17: error: expected primary-expression before 'int'
   13 |   vector<vector<int>> dp(r+1, vector<int>(c+1, 0));
      |                 ^~~
a.cc:14:3: error: 'dp' was not declared in this scope
   14 |   dp[1][1]=1;
      |   ^~
a.cc:16:8: error: 'vec' was not declared in this scope
   16 |     if(vec[i][1]!='#') dp[i][1] = dp[i-1][1];
      |        ^~~
a.cc:19:8: error: 'vec' was not declared in this scope
   19 |     if(vec[1][i]!='#') dp[1][i] = dp[1][i-1];
      |        ^~~
a.cc:27:3: error: 'cout' was not declared in this scope
   27 |   cout<<dp[r][c]<<endl;
      |   ^~~~
a.cc:27:19: error: 'endl' was not declared in this scope
   27 |   cout<<dp[r][c]<<endl;
      |                   ^~~~
Language: C++

#include<bits/stdc++.h> 
#define ll long long
#define pb push_back
#define mp make_pair
#define mod 1000000007;
using namespace std;
char a[1001][1001];
ll gcd(ll a,ll b) 
{ 
	if (a == 0) 
		return b; 
	return gcd(b % a, a); 
} 
bool isprime(ll n)
{
    for(ll i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}
ll dp[1001][1001]={0};
ll ways(ll h,ll w)
{
	//cout<<h<<" "<<w<<endl;
	if(h==0&&w==0)
		return 1;
	if(dp[h][w]!=0)
		return dp[h][w];
	ll ans1=0,ans2=0,ans;
	if(w-1>=0&&a[h][w-1]=='.')
	ans1=ways(w-1,h)%mod;
	if(h-1>=0&&a[h-1][w]=='.')
	ans2=ways(w,h-1)%mod;
	ans=(ans1%mod+ans2%mod)%mod;
	dp[h][w]=ans;
	return ans;
}
int main()
{
	ll h,w,i,j;
	cin>>h>>w;
	for(i=0;i<h;i++)
	{
		for(j=0;j<w;j++)
		{
			cin>>a[i][j];
		}
	}
	ll ans=ways(h-1,w-1)%mod;
	cout<<ans;
	return 0;
}

Compiler output:
a.cc: In function 'long long int ways(long long int, long long int)':
a.cc:5:23: error: expected ')' before ';' token
    5 | #define mod 1000000007;
      |                       ^
a.cc:36:19: note: in expansion of macro 'mod'
   36 |         ans=(ans1%mod+ans2%mod)%mod;
      |                   ^~~
a.cc:36:13: note: to match this '('
   36 |         ans=(ans1%mod+ans2%mod)%mod;
      |             ^
a.cc:36:31: error: expected primary-expression before ')' token
   36 |         ans=(ans1%mod+ans2%mod)%mod;
      |                               ^
Language: C++

#include<cstdio>

using namespace std;

char mp[2000][2000];
int dp[2000][2000],MOD=1e9+7;

int main()
{
  int h=0,w=0;scanf("%d%d",&h,&w);
  for(int i=1;i<=h;i++)scanf("%s",mp[i]+1);
  for(int i=1;i<=h;i++)
  {
    for(int j=1;j<=w;j++)
    {
      if(i==1&&j==1)dp[i][j]=1;
      else if(mp[i][j]=='#')dp[i][j]=0;
      else dp[i][j]=(dp[i-1][j]+dp[i][j-1]))%MOD;
    }
  }
  printf("%d",dp[h][w]);
  return 0;
}
  

Compiler output:
a.cc: In function 'int main()':
a.cc:18:44: error: expected ';' before ')' token
   18 |       else dp[i][j]=(dp[i-1][j]+dp[i][j-1]))%MOD;
      |                                            ^
      |                                            ;
Language: C++


const int mod = 1e9 +7 ;
char ch[1007][1007];
 int H,W;


int dp[1007][1007];
int main(){
    ios_base::sync_with_stdio(false);
  	cin.tie(NULL);
    cout.tie(NULL);
    cin>>H>>W;
    memset(dp,0,sizeof(dp));
    for(int i=0;i<H;i++){
        cin>>ch[i];
    }
   
    dp[0][0] = 1;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(ch[i][j] == '.'){
                if(i-1>=0) dp[i][j] = (dp[i-1][j]+dp[i][j])%mod;
                if(j-1>=0) dp[i][j] = (dp[i][j-1]+dp[i][j]) % mod;
            }
            cout<<dp[i][j]<<" ";
        }
        cout<<"\n";
    }
    cout<<dp[H-1][W-1];
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:9:5: error: 'ios_base' has not been declared
    9 |     ios_base::sync_with_stdio(false);
      |     ^~~~~~~~
a.cc:10:9: error: 'cin' was not declared in this scope
   10 |         cin.tie(NULL);
      |         ^~~
a.cc:10:17: error: 'NULL' was not declared in this scope
   10 |         cin.tie(NULL);
      |                 ^~~~
a.cc:1:1: note: 'NULL' is defined in header '<cstddef>'; this is probably fixable by adding '#include <cstddef>'
  +++ |+#include <cstddef>
    1 | 
a.cc:11:5: error: 'cout' was not declared in this scope
   11 |     cout.tie(NULL);
      |     ^~~~
a.cc:13:5: error: 'memset' was not declared in this scope
   13 |     memset(dp,0,sizeof(dp));
      |     ^~~~~~
a.cc:1:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
  +++ |+#include <cstring>
    1 |
Language: C++

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll ans[1001][1001];
#define m 1000000007;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	ll h,w;
	cin>>h>>w;
	char arr[h][w];
	for(ll i=0;i<h;i++)
	{
		for(ll j=0;j<w;j++)
		{
			cin>>arr[i][j];
		}
	}
	for(ll i=0;i<h;i++)
	{
		if(arr[0][i]=='.')
		{
			ans[0][i]=1;
		}
		else
		{
			break;
		}
	}
	for(ll i=0;i<w;i++)
	{
		if(arr[0][i]=='.')
		{
			ans[i][0]=1;
		}
		else
		{
			break;
		}
	}
	for(ll i=1;i<h;i++)
	{
		for(ll j=1;j<w;j++)
		{
			if(arr[i-1][j]=='#' && arr[i][j-1]=='#')
			{
				ans[i][j]=0;
			}
			else if(arr[i-1][j]=='#')
			{
				ans[i][j]=ans[i][j-1]%m;
			}
			else if(arr[i][j-1]=='#')
			{
				ans[i][j]=ans[i-1][j]%m;
			}
			else
			{
				ans[i][j]=((ans[i-1][j])%m+(ans[i][j-1])%m)%m;
			}
		}
	}
	cout<<ans[h-1][w-1]%m<<endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:6:21: error: expected ')' before ';' token
    6 | #define m 1000000007;
      |                     ^
a.cc:61:58: note: in expansion of macro 'm'
   61 |                                 ans[i][j]=((ans[i-1][j])%m+(ans[i][j-1])%m)%m;
      |                                                          ^
a.cc:61:43: note: to match this '('
   61 |                                 ans[i][j]=((ans[i-1][j])%m+(ans[i][j-1])%m)%m;
      |                                           ^
a.cc:61:75: error: expected primary-expression before ')' token
   61 |                                 ans[i][j]=((ans[i-1][j])%m+(ans[i][j-1])%m)%m;
      |                                                                           ^
a.cc:65:30: error: expected primary-expression before '<<' token
   65 |         cout<<ans[h-1][w-1]%m<<endl;
      |                              ^~
Language: C++

#include <bits/stdc++.h>
using namespace std;
 
 
int main() {
    int h,w; cin>>h>>w;
    char a[h][w];
    long long int dp[h][w];
 
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
           cin>>a[i][j];
        }
    }
 
 
   for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            if(a[i][j]=='#')dp[i][j]=0;
            else if(i==0&&j==0)dp[i][j]=1;
            else if(i==0)dp[i][j]=dp[i][j-1]%1000000007;
            else if(j==0)dp[i][j]=dp[i-1][j]%1000000007;
            
            else dp[i][j]=(dp[i][j-1]+dp[i-1][j])%1000000007;//左からと上から
          
        }
    }
 
    cout<<dp[h-1][w-1]<<endl;
}
#include <bits/stdc++.h>
using namespace std;


int main() {
    int h,w; cin>>h>>w;
    char a[h][w];
    long long int dp[h][w];

    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
           cin>>a[i][j];
        }
    }


   for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            if(a[i][j]=='#')dp[i][j]=0;
            else if(i==0&&j==0)dp[i][j]=1;
            else if(i==0)dp[i][j]=dp[i][j-1]%1000000007;
            else if(j==0)dp[i][j]=dp[i-1][j]%1000000007;
            
            else dp[i][j]=(dp[i][j-1]+dp[i-1][j])%1000000007;//左からと上から
          
        }
    }

    cout<<dp[h-1][w-1]<<endl;
}


Compiler output:
a.cc:35:5: error: redefinition of 'int main()'
   35 | int main() {
      |     ^~~~
a.cc:5:5: note: 'int main()' previously defined here
    5 | int main() {
      |     ^~~~
Language: C++

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstdint>
const uint32_t MODULE = 1e9 + 7;

int main() {
	int h;
	std::cin>>h;
	int w;
	std::cin>>w;
	int wall[h][w];
	memset(wall, 0, sizeof(wall));
	for (int i = 0; i < h; ++i) {
		std::string c;
		std::cin>>c;
		for (int j = 0; j < c.size(); ++j) {
			if (c[j] == '#') {
				wall[i][j] = -1;
			} else {
				wall[i][j] = 1;
			}
		}
	}
	uint64_t dp[h][w];
	memset(dp, 0, sizeof(dp));
	bool flag = false;
	for (int i = 0; i < h; ++i) {
		if (wall[i][0] > 0 && !flag) {
			dp[i][0] = 1;
		} else {
			flag = true;
		}
	}
	flag = false;
	for (int i = 0; i < w; ++i) {
		if (wall[0][i] > 0 && !flag) {
			dp[0][i] = 1;
		} else {
			flag = true;
		}
	}
	for (int i = 1; i < h; ++i) {
		for (int j = 1; j < w; ++j) {
			if (wall[i][j] < 0)
				continue;
			if (i - 1 >= 0 && j - 1 >= 0) {
				dp[i][j] = dp[i-1][j] + dp[i][j-1];
			}
		}
	}
	printf("%lu\n", dp[h-1][w-1] % MODULE);
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:9: error: 'memset' was not declared in this scope
   14 |         memset(wall, 0, sizeof(wall));
      |         ^~~~~~
a.cc:6:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    5 | #include <cstdint>
  +++ |+#include <cstring>
    6 | const uint32_t MODULE = 1e9 + 7;
Language: C++

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstdint>
const uint32_t MODULE = 1e9 + 7;

int main() {
	int h;
	std::cin>>h;
	int w;
	std::cin>>w;
	int wall[h][w];
	memset(wall, 0, sizeof(wall));
	for (int i = 0; i < h; ++i) {
		std::string c;
		std::cin>>c;
		for (int j = 0; j < c.size(); ++j) {
			if (c[j] == '#') {
				wall[i][j] = -1;
			} else {
				wall[i][j] = 1;
			}
		}
	}
	uint64_t dp[h][w];
	memset(dp, 0, sizeof(dp));
	bool flag = false;
	for (int i = 0; i < h; ++i) {
		if (wall[i][0] > 0 && !flag) {
			dp[i][0] = 1;
		} else {
			flag = true;
		}
	}
	flag = false;
	for (int i = 0; i < w; ++i) {
		if (wall[0][i] > 0 && !flag) {
			dp[0][i] = 1;
		} else {
			flag = true;
		}
	}
	for (int i = 1; i < h; ++i) {
		for (int j = 1; j < w; ++j) {
			if (wall[i][j] < 0)
				continue;
			if (i - 1 >= 0 && j - 1 >= 0) {
				dp[i][j] = dp[i-1][j] + dp[i][j-1];
			}
		}
	}
	printf("%llu\n", dp[h-1][w-1] % MODULE);
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:9: error: 'memset' was not declared in this scope
   14 |         memset(wall, 0, sizeof(wall));
      |         ^~~~~~
a.cc:6:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    5 | #include <cstdint>
  +++ |+#include <cstring>
    6 | const uint32_t MODULE = 1e9 + 7;
Language: C++

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair 
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)

int main(){
	//input
	ll H,W; cin>>H>>W;
	char field[1001][1001];
	rep1(i,H){
		string tmp; cin>>tmp;
		rep1(j,W) field[i][j]=tmp[j-1];
	}

	//solve
	ll dp[1001][1001];
	rep(i,1001)rep(j,1001) dp[i][j]=0;
	rep1(i,H){
		if(field[i][1]=='#') break;
		else dp[i][1]=1;
	}
	rep1(i,W){
		if(field[1][i]=='#') break;
		else dp[1][i]=1;
	}
	FOR(i,2,H+1){
		FOR(j,2,W+1){
			if(field[i][j]=='#') dp[i][j]=0;
			else dp[i][j]=(dp[i][j-1]+dp[i-1][j])%MOD;
		}
	}
  
	//output
	cout<<dp[H][W];
}

Compiler output:
a.cc: In function 'int main()':
a.cc:41:63: error: 'MOD' was not declared in this scope
   41 |                         else dp[i][j]=(dp[i][j-1]+dp[i-1][j])%MOD;
      |                                                               ^~~
Language: C++

#include<bits/stdc++.h>
#define for0(i,n) for(int i=0;i<n;i++)
#define rep(i,s,n) for(int i=s;i<n;i++)
#define sp <<" "<<					// giving space
#define MOD 1000000007				// for mod
#define ll_max 1000000000000000000
#define ll long long
#define ld long double
#define BOOST ios_base::sync_with_stdio ( false ); cin.tie ( nullptr ); cout.tie ( nullptr );
using namespace std;
// Vector
#define vi vector<int>					//integer vector
#define vll vector<ll>
#define pb push_back				//vector element insertion
#define pf push_front
#define er(v,i) v.erase(v.begin()+i)			// erase ith element in a vector
#define erng(v,x) v.erase(v.begin(),v.begin()+x)       	// delete a range in array

//Stack
/*  stack<int> s;						//declaring stack
s.push(1)						// enter  element in stack
s.top()							//returns top element in stack
s.pop()							//removes top element in  stack
*/
// pair
#define pii pair<int,int>					//pair integers
#define ff first
#define ss second
#define mp(a,b) make_pair(a,b)			// entering pair element in vector(size not defined)

//Hashmap
/* map<string,string> a;				//declaration
a[“abc”]=”xyz”;					// element entry in map;
gquiz1.insert(pair<int, int>(1, 40));
map<string,string>::iterator itr;			//iterating map
for (itr = a.begin(); itr!=a.end(); itr++){
    cout <<(*itr).first  << itr->second <<endl;
  }
  itr = companies.find("abc");		//finding element in map
  cout << itz->second;

//*/

int dp[1005][1005];
int solve(int i,int j)
{
    if(dp[i][j]==-2)return 0;
    if(i==1&&j==1)return 1;
    if(i==0||j==0)return 0;
    if(dp[i][j]!=-1)return dp[i][j];
    dp[i][j]=(solve(i-1,j)+solve(i,j-1))%MOD;
    return dp[i][j];
}
int main()
{
   int h,w;
   char c;
   cin>>h>>w;
   for0(i,h)
   {
       for0(j,w)
       {
           cin>>c;
           if(c=='#')dp[i+1][j+1]=-2;
            else dp[i+1][j+1]=-1
       }
   }
    int ans=solve(h,w);
    cout<<ans;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:65:33: error: expected ';' before '}' token
   65 |             else dp[i+1][j+1]=-1
      |                                 ^
      |                                 ;
   66 |        }
      |        ~
Language: C++

//ehhhhh...... i hate you......

/* optimizations and other useless stuff*/
#pragma warning(disable:4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include<bits/stdc++.h>
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define INF 1e14
#define ull unsigned long long int
using namespace std;
/* TYPE DEFINITIONS */
typedef     long long int   ll;
typedef     vector<ll>      vi;
typedef     pair<ll,ll>     pi;


/* Basic  Math!!! */
bool isPrime(ull n) 
{ 
    if (n <= 1)  return false; 
    if (n <= 3)  return true; 
    if (n%2 == 0 || n%3 == 0) return false; 
  
    for (ull i=5; i*i<=n; i=i+6) 
        if (n%i == 0 || n%(i+2) == 0) 
           return false; 
  
    return true; 
} 
ll ncr(int n, int k)  
{  
    ll res = 1;  
    if ( k > n - k )  
        k = n - k;  
    for (int i = 0; i < k; ++i)  
    {  
        res *= (n - i);  
        res /= (i + 1);  
    }  
  
    return res;  
} 

/* MACROS */
#define  all(A)         (A).begin() , (A).end()
#define  rall(A)        (A).rbegin() , (A).rend()
#define  sz(A)          (int)(A).size()
#define  pb             push_back
#define  ppb            pop_back
#define  mp             make_pair
#define  ln(X)          (int)(X).length()
#define  square(X)      ((X)*(X))
#define  cube(X)        ((X)*(X)*(X))
#define  forn(i, n)  for (int i = 0; i < int(n); i++)
#define  forr(i, n)  for (int i = int(n - 1); i >= 0; i--)
#define  fora(i, a, b)  for (int i = int(a); i <= int(b); i++)
#define  forb(i, a, b)  for (int i = int(a); i >= int(b); i--)
#define  fore(it, a)    for(__typeof((a).sbegin()) it = (a).begin(); it != (a).end(); it++)  
ll dp[1005][1005];
void solve()
{
    int n,m;
    cin>>n>>m;
    char grid[n][m];
    forn(i,n)forn(j,m)cin>>grid[i][j];
    dp[0][0]=1;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(grid[i][j]=='#')
            {
                dp[i][j]=0;
                continue;
            }
            dp[i][j]+=(dp[i-1][j]+dp[i][j-1])%MOD;
        }
    }
   /* forn(i,n)
    {
        forn(j,m)cout<<dp[i][j]<<" ";
        cout<<endl;
    }*/
    cout<<dp[n-1][m-1]<<endl;
}

int main()
{
    FastIO;
   // cin>>t;
    while(t--)
    {
        //cout<<"Case "<<++c<<": ";
        solve();
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:96:11: error: 't' was not declared in this scope; did you mean 'tm'?
   96 |     while(t--)
      |           ^
      |           tm
Language: C++

#include <bits/stdc++.h>
 
using namespace std;
 
#define MOD 1000000007
int main()
{
  int n,m;
  cin>>n>>m;
  char a[n][m];
  for(int i=0;i<n;i++)
  for(int j=0;j<m;j++)
   cin>>a[i][j];
  int dp[n][m];
  for(int i=0;i<n;i++)
   for(int j=0;j<n;j++)
   {
     if(i==0 && j==0) dp[i][j]=1;
     else if(i==0) 
     {  if(a[i][j]=='.'
        dp[i][j]=dp[i][j-1];
        else
         dp[i][j]=0  
     }
     else if(j==0) 
     {  if(a[i][j]=='.')
        dp[i][j]=dp[i-1][j];
        else
         dp[i][j]=0  
     }
     else if(a[i][j]=='.')
     {
        dp[i][j]=((long long)dp[i-1][j]%MOD+dp[i][j-1]%MOD)%MOD     
             
     }
     else
     dp[i][j]=0;
             
    }
  
  cout<<dp[n-1][m-1];
  
  
}

Compiler output:
a.cc: In function 'int main()':
a.cc:20:24: error: expected ';' before 'dp'
   20 |      {  if(a[i][j]=='.'
      |                        ^
      |                        ;
   21 |         dp[i][j]=dp[i][j-1];
      |         ~~              
a.cc:22:9: error: expected primary-expression before 'else'
   22 |         else
      |         ^~~~
a.cc:21:29: error: expected ')' before 'else'
   21 |         dp[i][j]=dp[i][j-1];
      |                             ^
      |                             )
   22 |         else
      |         ~~~~                 
a.cc:20:11: note: to match this '('
   20 |      {  if(a[i][j]=='.'
      |           ^
a.cc:24:6: error: expected primary-expression before '}' token
   24 |      }
      |      ^
a.cc:29:20: error: expected ';' before '}' token
   29 |          dp[i][j]=0
      |                    ^
      |                    ;
   30 |      }
      |      ~              
a.cc:35:6: error: expected ';' before '}' token
   35 |      }
      |      ^
Language: C++

#include <bits/stdc++.h>
 
using namespace std;
 
#define MOD 1000000007
int main()
{
  int n,m;
  cin>>n>>m;
  char a[n][m];
  for(int i=0;i<n;i++)
  for(int j=0;j<m;j++)
   cin>>a[i][j];
  int dp[n][m];
  for(int i=0;i<n;i++)
   for(int j=0;j<n;j++)
   {
     if(i==0 && j==0) dp[i][j]=1;
     else if(i==0) 
     {  if(a[i][j]=='.'
        dp[i][j]=dp[i][j-1];
        else
         dp[i][j]=0  
     }
     else if(j==0) 
     {  if(a[i][j]=='.'
        dp[i][j]=dp[i-1][j];
        else
         dp[i][j]=0  
     }
     else if(a[i][j]=='.')
     {
        dp[i][j]=((long long)dp[i-1][j]%MOD+dp[i][j-1]%MOD)%MOD     
             
     }
     else
     dp[i][j]=0;
             
    }
  
  cout<<dp[n-1][m-1];
  
  
}

Compiler output:
a.cc: In function 'int main()':
a.cc:20:24: error: expected ';' before 'dp'
   20 |      {  if(a[i][j]=='.'
      |                        ^
      |                        ;
   21 |         dp[i][j]=dp[i][j-1];
      |         ~~              
a.cc:22:9: error: expected primary-expression before 'else'
   22 |         else
      |         ^~~~
a.cc:21:29: error: expected ')' before 'else'
   21 |         dp[i][j]=dp[i][j-1];
      |                             ^
      |                             )
   22 |         else
      |         ~~~~                 
a.cc:20:11: note: to match this '('
   20 |      {  if(a[i][j]=='.'
      |           ^
a.cc:24:6: error: expected primary-expression before '}' token
   24 |      }
      |      ^
a.cc:26:24: error: expected ';' before 'dp'
   26 |      {  if(a[i][j]=='.'
      |                        ^
      |                        ;
   27 |         dp[i][j]=dp[i-1][j];
      |         ~~              
a.cc:28:9: error: expected primary-expression before 'else'
   28 |         else
      |         ^~~~
a.cc:27:29: error: expected ')' before 'else'
   27 |         dp[i][j]=dp[i-1][j];
      |                             ^
      |                             )
   28 |         else
      |         ~~~~                 
a.cc:26:11: note: to match this '('
   26 |      {  if(a[i][j]=='.'
      |           ^
a.cc:30:6: error: expected primary-expression before '}' token
   30 |      }
      |      ^
a.cc:35:6: error: expected ';' before '}' token
   35 |      }
      |      ^
Language: C++

#include <bits/stdc++.h>
 
using namespace std;
 
#define MOD 1000000007
int main()
{
  int n,m;
  cin>>n>>m;
  char a[n][m];
  for(int i=0;i<n;i++)
  for(int j=0;j<m;j++)
   cin>>a[i][j];
  int dp[n][m];
  int dp[0][0]=1;
  for(int i=0;i<n;i++)
   for(int j=0;j<n;j++)
   {
     if(i==0 && j==0) dp[i][j]=1;
     else if(i==0) 
     {  if(a[i][j]=='.'
        dp[i][j]=dp[i][j-1];
        else
         dp[i][j]=0  
     }
     else if(j==0) 
     {  if(a[i][j]=='.'
        dp[i][j]=dp[i-1][j];
        else
         dp[i][j]=0  
     }
     else if(a[i][j]=='.')
     {
        dp[i][j]=((long long)dp[i-1][j]%MOD+dp[i][j-1]%MOD)%MOD     
             
     }
     else
     dp[i][j]=0;
             
    }
  
  cout<<dp[n-1][m-1];
  
  
}

Compiler output:
a.cc: In function 'int main()':
a.cc:15:7: error: conflicting declaration 'int dp [0][0]'
   15 |   int dp[0][0]=1;
      |       ^~
a.cc:14:7: note: previous declaration as 'int dp [n][m]'
   14 |   int dp[n][m];
      |       ^~
a.cc:21:24: error: expected ';' before 'dp'
   21 |      {  if(a[i][j]=='.'
      |                        ^
      |                        ;
   22 |         dp[i][j]=dp[i][j-1];
      |         ~~              
a.cc:23:9: error: expected primary-expression before 'else'
   23 |         else
      |         ^~~~
a.cc:22:29: error: expected ')' before 'else'
   22 |         dp[i][j]=dp[i][j-1];
      |                             ^
      |                             )
   23 |         else
      |         ~~~~                 
a.cc:21:11: note: to match this '('
   21 |      {  if(a[i][j]=='.'
      |           ^
a.cc:25:6: error: expected primary-expression before '}' token
   25 |      }
      |      ^
a.cc:27:24: error: expected ';' before 'dp'
   27 |      {  if(a[i][j]=='.'
      |                        ^
      |                        ;
   28 |         dp[i][j]=dp[i-1][j];
      |         ~~              
a.cc:29:9: error: expected primary-expression before 'else'
   29 |         else
      |         ^~~~
a.cc:28:29: error: expected ')' before 'else'
   28 |         dp[i][j]=dp[i-1][j];
      |                             ^
      |                             )
   29 |         else
      |         ~~~~                 
a.cc:27:11: note: to match this '('
   27 |      {  if(a[i][j]=='.'
      |           ^
a.cc:31:6: error: expected primary-expression before '}' token
   31 |      }
      |      ^
a.cc:36:6: error: expected ';' before '}' token
   36 |      }
      |      ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int row,col;
  cin>>row>>col;
  vector<vector<char> > v;
  for(int i=0;i<row,i++)
  {
    vector<char> r;
    for(int j=0;j<col;j++)
    {
      char ch;
      cin>>ch;
      r.push_back(ch);
    }
    v.push_back(r);
  }
  int dp[row][col];
  for(int i=0;i<col;i++)
  {
    if(v[0][i]!='#')
      dp[0][i]=1;
    else
      dp[0][i]=0;
  }
  for(int i=0;i<row;i++)
  {
    if(v[i][0]!='#')
      dp[i][0]=1;
    else
      dp[i][0]=0;
  }
  for(int i=1;i<row;i++)
  {
    for(int j=1;j<col;j++)
    {
      dp[i][j]=((dp[i-1][j])%(1000000007)+(dp[i][j-1])%(1000000007))%(1000000007);
    }
  }
  cout<<dp[row-1][col-1];
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:24: error: expected ';' before ')' token
    8 |   for(int i=0;i<row,i++)
      |                        ^
      |                        ;