Language: C++

#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define inf std::numeric_limits<double>::infinity()
#define DECI(n) fixed<<showpoint<<setprecision(n)
#define MOD 1000000007LL
#define FOR(i,start,end) for (int i=start;i<end;i++)
#define FORR(i,end,start) for(int i=end-1;i>start;i--)
#define INPUT(arr,n) FOR(i,0,n) cin>>arr[i];
#define INPUT2d(arr,n,k) FOR(i,0,n) FOR(j,0,k) cin>>arr[i][j];
#define SIZE 100005
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define SUM cout<<sum<<endl;
#define pr(x) cout<<x<<endl;
#define prs(x) cout<<x<<" ";
#define iii(i)      cin>>i
#define ooo(i)      cout<<i
#define sss         cout<<" "
#define nnn         cout<<"\n"/**
#define iii(i)      iii<<i
#define ooo(i)      ooo<<i
#define sss         ooo<<" "
#define nnn         ooo<<"\n"*/
#define ff          first
#define ss          second
#define psb         push_back

#define maxN 20 
#define maxSum 50 
#define minSum 50 
#define base 50 
int arraySortedOrNot(int arr[], int n) 
{ 
    // Array has one or no element or the 
    // rest are already checked and approved. 
    if (n == 1 || n == 0) 
        return 1; 
  
    // Unsorted pair found (Equal values allowed) 
    if (arr[n - 1] < arr[n - 2]) 
        return 0; 
  
    // Last pair was sorted 
    // Keep on checking 
    return arraySortedOrNot(arr, n - 1); 
} 
void alternateMerge(int arr1[], int arr2[], int n1, 
                    int n2, int arr3[]) 
{ 
    int i = 0, j = 0, k = 0; 
  
    // Traverse both array 
    while (i<n1 && j <n2) 
    { 
        arr3[k++] = arr1[i++]; 
        arr3[k++] = arr2[j++]; 
    } 
  
    // Store remaining elements of first array 
    while (i < n1) 
        arr3[k++] = arr1[i++]; 
  
    // Store remaining elements of second array 
    while (j < n2) 
        arr3[k++] = arr2[j++]; 
} 

void twoParts(string str) 
{ 
    int flag = 0; 
    string a = ""; 
  
    
    for (int i = 0; i < str.length(); i++) { 
        if (str[i] == '7') { 
            str[i] = '3'; 
            a += '1'; 
            flag = 1; 
        } 
  
         
        else if (flag) 
            a += '0'; 
    } 
  
    
    cout << str << " " << a; 
}  
int maxSubArraySum(int a[], int size) 
{ 
    int max_so_far = INT_MIN, max_ending_here = 0; 
  
    for (int i = 0; i < size; i++) 
    { 
        max_ending_here = max_ending_here + a[i]; 
        if (max_so_far < max_ending_here) 
            max_so_far = max_ending_here; 
  
        if (max_ending_here < 0) 
            max_ending_here = 0; 
    } 
    return max_so_far; 
} 
ll countPaths(ll R,ll C,ll maze[][]) 
{ 
    
    if (maze[0][0]==-1) 
        return 0; 
  
     
    for (ll i=0; i<R; i++) 
    { 
        if (maze[i][0] == 0) 
            maze[i][0] = 1; 
  
       
        else
            break; 
    } 
  
     
    for (ll i=1; i<C; i++) 
    { 
        if (maze[0][i] == 0) 
            maze[0][i] = 1; 
  
        
        else
            break; 
    } 
  
    
    for (int i=1; i<R; i++) 
    { 
        for (int j=1; j<C; j++) 
        { 
             
            if (maze[i][j] == -1) 
                continue; 
  
            
            if (maze[i-1][j] > 0) 
                maze[i][j] = (maze[i][j] + maze[i-1][j]); 
  
            
            if (maze[i][j-1] > 0) 
                maze[i][j] = (maze[i][j] + maze[i][j-1]); 
        } 
    } 
  
    
    return (maze[R-1][C-1] > 0)? maze[R-1][C-1] : 0; 
} 
  
int main(){

ll t;cin>>t;
if(t==1){
	cout<<0<<endl;
}
else if(t==0){
	cout<<1<<endl;
}





return 0;
}

Compiler output:
a.cc:108:28: error: declaration of 'maze' as multidimensional array must have bounds for all dimensions except the first
  108 | ll countPaths(ll R,ll C,ll maze[][])
      |                            ^~~~
a.cc: In function 'long long int countPaths(...)':
a.cc:111:9: error: 'maze' was not declared in this scope
  111 |     if (maze[0][0]==-1)
      |         ^~~~
a.cc:115:20: error: 'R' was not declared in this scope
  115 |     for (ll i=0; i<R; i++)
      |                    ^
a.cc:117:13: error: 'maze' was not declared in this scope
  117 |         if (maze[i][0] == 0)
      |             ^~~~
a.cc:126:20: error: 'C' was not declared in this scope
  126 |     for (ll i=1; i<C; i++)
      |                    ^
a.cc:128:13: error: 'maze' was not declared in this scope
  128 |         if (maze[0][i] == 0)
      |             ^~~~
a.cc:137:21: error: 'R' was not declared in this scope
  137 |     for (int i=1; i<R; i++)
      |                     ^
a.cc:139:25: error: 'C' was not declared in this scope
  139 |         for (int j=1; j<C; j++)
      |                         ^
a.cc:142:17: error: 'maze' was not declared in this scope
  142 |             if (maze[i][j] == -1)
      |                 ^~~~
a.cc:146:17: error: 'maze' was not declared in this scope
  146 |             if (maze[i-1][j] > 0)
      |                 ^~~~
a.cc:150:17: error: 'maze' was not declared in this scope
  150 |             if (maze[i][j-1] > 0)
      |                 ^~~~
a.cc:156:13: error: 'maze' was not declared in this scope
  156 |     return (maze[R-1][C-1] > 0)? maze[R-1][C-1] : 0;
      |             ^~~~
a.cc:156:18: error: 'R' was not declared in this scope
  156 |     return (maze[R-1][C-1] > 0)? maze[R-1][C-1] : 0;
      |                  ^
a.cc:156:23: error: 'C' was not declared in this scope
  156 |     return (maze[R-1][C-1] > 0)? maze[R-1][C-1] : 0;
      |                       ^