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

#include <iostream>
#include <arrary>
#include <iterator>

int main(){
	int length,width;

	while(std::cin >> width >> length){
		std::array<int, 256> crossing; //16*16

		if(width == 0 && length == 0) break;

		int construction;
		std::cin >> construction;

		int con_length, con_width;
		for(int i = 0; i < construction; ++i){
			//int con_length, con_width;
			std::cin >> con_width >> con_length;
			crossing[con_width + (width * (con_length - 1)) - 1] = -1; //construction = -1
		}

		crossing.front() = 1; //start
		
		int cros_num = 0;
		for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){

			if(*itr != -1){ //not crossing

				//considering left crossing
				if(cros_num % width != 0){ //no left
					itr -= 1;
					if(*itr != -1){ //left not construction
						int buf = *itr;
						itr += 1;
						*itr += buf; //plus left
					}else{
						itr += 1;
					}
				}
				//considering down crossing
				if(cros_num > width){ //no down
					itr -= width;
					if(*itr != -1){ //down not construction
						int buf = *itr;
						itr += width;
						*itr += buf; //plus down
					}else{
						itr += width;
					}
				}
			
			}
			++cros_num;
			
			if(cros_num == length * width){
				std::cout << *itr << endl;	
				break;
			}
		}

	}
	return 0;
}

Compiler output:
a.cc:2:10: fatal error: arrary: No such file or directory
    2 | #include <arrary>
      |          ^~~~~~~~
compilation terminated.
Language: C++

#include <iostream>
#include <arrary>
#include <iterator>

int main(){
	int length,width;

	while(std::cin >> width >> length){
		std::array<int, 256> crossing; //16*16

		if(width == 0 && length == 0) break;

		int construction;
		std::cin >> construction;

		for(int i = 0; i < construction; ++i){
			int con_length, con_width;
			//std::cin >> con_width >> con_length;
			crossing[con_width + (width * (con_length - 1)) - 1] = -1; //construction = -1
		}

		crossing.front() = 1; //start
		
		int cros_num = 0;
		for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){

			if(*itr != -1){ //not crossing

				//considering left crossing
				if(cros_num % width != 0){ //no left
					itr -= 1;
					if(*itr != -1){ //left not construction
						int buf = *itr;
						itr += 1;
						*itr += buf; //plus left
					}else{
						itr += 1;
					}
				}
				//considering down crossing
				if(cros_num > width){ //no down
					itr -= width;
					if(*itr != -1){ //down not construction
						int buf = *itr;
						itr += width;
						*itr += buf; //plus down
					}else{
						itr += width;
					}
				}
			
			}
			++cros_num;
			
			if(cros_num == length * width){
				std::cout << *itr << endl;	
				break;
			}
		}

	}
	return 0;
}

Compiler output:
a.cc:2:10: fatal error: arrary: No such file or directory
    2 | #include <arrary>
      |          ^~~~~~~~
compilation terminated.
Language: C++

#include <iostream>
#include <arrary>
#include <iterator>

int main(){
	int length,width;

	while(std::cin >> width >> length){
		std::array<int, 256> crossing; //16*16

		if(width == 0 && length == 0) break;

		int construction;
		std::cin >> construction;

		for(int i = 0; i < construction; ++i){
			int con_length, con_width;
			//std::cin >> con_width >> con_length;
			//crossing[con_width + (width * (con_length - 1)) - 1] = -1; //construction = -1
		}

		crossing.front() = 1; //start
		
		int cros_num = 0;
		for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){

			if(*itr != -1){ //not crossing

				//considering left crossing
				if(cros_num % width != 0){ //no left
					itr -= 1;
					if(*itr != -1){ //left not construction
						int buf = *itr;
						itr += 1;
						*itr += buf; //plus left
					}else{
						itr += 1;
					}
				}
				//considering down crossing
				if(cros_num > width){ //no down
					itr -= width;
					if(*itr != -1){ //down not construction
						int buf = *itr;
						itr += width;
						*itr += buf; //plus down
					}else{
						itr += width;
					}
				}
			
			}
			++cros_num;
			
			if(cros_num == length * width){
				std::cout << *itr << endl;	
				break;
			}
		}

	}
	return 0;
}

Compiler output:
a.cc:2:10: fatal error: arrary: No such file or directory
    2 | #include <arrary>
      |          ^~~~~~~~
compilation terminated.
Language: C++

#include <iostream>
#include <array>
#include <iterator>

int main(){
	int length,width;

	while(std::cin >> width >> length){
		std::array<int, 256> crossing; //16*16

		if(width == 0 && length == 0) break;

		int construction;
		std::cin >> construction;

		for(int i = 0; i < construction; ++i){
			int con_length, con_width;
			std::cin >> con_width >> con_length;
			crossing[con_width + (width * (con_length - 1)) - 1] = -1; //construction = -1
		}

		crossing.front() = 1; //start
		
		int cros_num = 0;
		for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){

			if(*itr != -1){ //not crossing

				//considering left crossing
				if(cros_num % width != 0){ //no left
					itr -= 1;
					if(*itr != -1){ //left not construction
						int buf = *itr;
						itr += 1;
						*itr += buf; //plus left
					}else{
						itr += 1;
					}
				}
				//considering down crossing
				if(cros_num > width){ //no down
					itr -= width;
					if(*itr != -1){ //down not construction
						int buf = *itr;
						itr += width;
						*itr += buf; //plus down
					}else{
						itr += width;
					}
				}
			
			}
			++cros_num;
			
			if(cros_num == length * width){
				std::cout << *itr << endl;	
				break;
			}
		}

	}
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:53: error: expected ';' before '!=' token
   25 |                 for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){
      |                                                     ^~~
      |                                                     ;
a.cc:25:54: error: expected primary-expression before '!=' token
   25 |                 for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){
      |                                                      ^~
a.cc:25:78: error: expected ';' before ')' token
   25 |                 for(auto itr = crossing.begin(), itr != crossing.end(), ++itr){
      |                                                                              ^
      |                                                                              ;
a.cc:56:54: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
   56 |                                 std::cout << *itr << endl;
      |                                                      ^~~~
      |                                                      std::endl
In file included from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
  744 |     endl(basic_ostream<_CharT, _Traits>& __os)
      |     ^~~~
Language: C++

#include <iostream>
#include <array>
#include <iterator>

int main(){
	int length,width;

	while(std::cin >> width >> length){
		std::array<int, 256> crossing; //16*16

		if(width == 0 && length == 0) break;

		int construction;
		std::cin >> construction;

		for(int i = 0; i < construction; ++i){
			int con_length, con_width;
			std::cin >> con_width >> con_length;
			crossing[con_width + (width * (con_length - 1)) - 1] = -1; //construction = -1
		}

		crossing.front() = 1; //start
		
		int cros_num = 0;
		for(auto itr = crossing.begin(); itr != crossing.end(); ++itr){

			if(*itr != -1){ //not crossing

				//considering left crossing
				if(cros_num % width != 0){ //no left
					itr -= 1;
					if(*itr != -1){ //left not construction
						int buf = *itr;
						itr += 1;
						*itr += buf; //plus left
					}else{
						itr += 1;
					}
				}
				//considering down crossing
				if(cros_num > width){ //no down
					itr -= width;
					if(*itr != -1){ //down not construction
						int buf = *itr;
						itr += width;
						*itr += buf; //plus down
					}else{
						itr += width;
					}
				}
			
			}
			++cros_num;
			
			if(cros_num == length * width){
				std::cout << *itr << endl;	
				break;
			}
		}

	}
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:56:54: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
   56 |                                 std::cout << *itr << endl;
      |                                                      ^~~~
      |                                                      std::endl
In file included from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
  744 |     endl(basic_ostream<_CharT, _Traits>& __os)
      |     ^~~~
Language: C++

#include <cstdio>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
  while(1){
    long long int a,b,c,d,n;
    long long int way[16][16]={{0}};
    bool flg;
    scanf("%d%d\n",&a,&b);
    if(a==0&&b==0)break;
    scanf("%d\n",&n);
    REP(i,n){
      scanf("%d%d\n",&c,&d);
      way[d-1][c-1]=-1;
    }
    REP(i,a){
      if(way[0][i]==-1||flg){
        way[0][i]=0;
        flg=true;
      }else way[0][i]=1;
    }
    flg=false;
    REP(i,b){
      if(way[i][0]==-1||flg){
        way[i][0]=0;
        flg=true;
      }else way[i][0]=1;
    }
    REP(y,b-1){
      REP(x,a-1){
        if(way[y+1][x+1]==-1)way[y+1][x+1]=0;
        else way[y+1][x+1]=way[y][x+1]+way[y+1][x];
      }
    }
    cout << way[b-1][a-1] << endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:35:5: error: 'cout' was not declared in this scope
   35 |     cout << way[b-1][a-1] << endl;
      |     ^~~~
a.cc:2:1: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
    1 | #include <cstdio>
  +++ |+#include <iostream>
    2 | #define REP(i,n) for(int i=0;i<(int)(n);i++)
a.cc:35:30: error: 'endl' was not declared in this scope
   35 |     cout << way[b-1][a-1] << endl;
      |                              ^~~~
a.cc:2:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
    1 | #include <cstdio>
  +++ |+#include <ostream>
    2 | #define REP(i,n) for(int i=0;i<(int)(n);i++)
Language: C++

#include <iostream>
using namespace std;

int main() {
	while(1)
	int a[17][17]={} ,x ,y ,n ,badpoint ,badpoint1;
	cin>>x>>y>>n;
	if(x==0&&y==0)
	break;
	for(int i=0;i<n;i++){
		cin>>badpoint>>badpoint1;
		a[badpoint][badpoint1]=-1;		
	}
	a[0][1]=1;
	for(int i=1;i<=x;i++){
		for(int j=1;j<=y;j++){
				if(a[i][j]==0)
				a[i][j]=a[i-1][j]+a[i][j-1];
				else
				a[i][j]=0;
			}
		}
		cout<<a[x][y]<<endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:14: error: 'x' was not declared in this scope
    7 |         cin>>x>>y>>n;
      |              ^
a.cc:7:17: error: 'y' was not declared in this scope
    7 |         cin>>x>>y>>n;
      |                 ^
a.cc:7:20: error: 'n' was not declared in this scope
    7 |         cin>>x>>y>>n;
      |                    ^
a.cc:9:9: error: break statement not within loop or switch
    9 |         break;
      |         ^~~~~
a.cc:11:22: error: 'badpoint' was not declared in this scope
   11 |                 cin>>badpoint>>badpoint1;
      |                      ^~~~~~~~
a.cc:11:32: error: 'badpoint1' was not declared in this scope
   11 |                 cin>>badpoint>>badpoint1;
      |                                ^~~~~~~~~
a.cc:12:17: error: 'a' was not declared in this scope
   12 |                 a[badpoint][badpoint1]=-1;
      |                 ^
a.cc:14:9: error: 'a' was not declared in this scope
   14 |         a[0][1]=1;
      |         ^
Language: C++

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

int area[18][18];
int a,b,n;
int ans=0;

int saiki(int x,int y){
  //cout << x << ' ' << y << endl;
  if(area[x][y] == -1) return 0;
  if(x == a && y == b) {
    // cout << 'z' << endl;
    return 1;
  }
  ans += saiki(x,y+1);
  ans += saiki(x+1,y);
  return 0;
}

int main(){
  int x,y;
  memset(area,-1,sizeof(area));
  while(1){
  cin >> a >> b;
  if(a == 0 && b == 0)break;
  for(int i=1;i<=a;i++){
    for(int j=1;j<=b;j++){
      area[i][j]=0;
    }
  }
  cin >> n;
  for(int i=0;i<n;i++){
    cin >> x >> y;
    area[x][y]=-1;
  }
  saiki(1,1);
  cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:38:2: error: expected '}' at end of input
   38 | }
      |  ^
a.cc:20:11: note: to match this '{'
   20 | int main(){
      |           ^
Language: C++

#include <iostream>

typedef std::pair<int, int> P;

const int MAX_AB = 16;
const int MAX_N = 40;
int N, A, B;
int dp[MAX_AB][MAX_AB];
bool obstacle[MAX_AB][MAX_AB] = {false};

void solve(){
    for(int i = 0; i < B; ++i){
        for(int j = 0; j < A; ++j){
            if(obstacle[i][j])
                continue;
            else if(i == 0 || j == 0)
                dp[i][j] = 1;
            else{
                dp[i][j] += dp[i - 1][j] + dp[i][j - 1];
            }
        }
    }

    std::cout << dp[B - 1][A - 1] << std::endl;

    return;
}

int main(){
    memset(dp, 0, MAX_AB * MAX_AB);
    std::cin >> A >> B >> N;
    
    int x, y;
    for(int i = 0; i < N; ++i){
        std::cin >> y >> x;
        --x, --y;
        obstacle[x][y] = true;
    }
    
    solve();

    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:30:5: error: 'memset' was not declared in this scope
   30 |     memset(dp, 0, MAX_AB * MAX_AB);
      |     ^~~~~~
a.cc:2:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    1 | #include <iostream>
  +++ |+#include <cstring>
    2 |
Language: C++

#include <cstdio>
#include <string>
using namespace std;

int main(){
	const int size = 16 + 1;
	int a, b, n, x, y;
	int dp[size][size];
	bool fab[size][size];
	
	while(true){
		scanf("%d%d", &a, &b);
		if(a == 0 && b == 0) break;
		scanf("%d", &n);
		memset(fab, false, sizeof(fab));
		for(int i = 0; i < n; i++){
			scanf("%d%d", &x, &y);
			fab[y][x] = true;
		}
		
		memset(dp, 0, sizeof(dp));
		dp[1][1] = 1;
		for(int i = 1; i <= b; i++){
			for(int j = 1; j <= a; j++){
				if(i == 1 && j == 1) continue;
				if(fab[i][j]) dp[i][j] = 0;
				else{
					dp[i][j] = ((i > 1)? dp[i - 1][j] : 0) + ((j > 1)? dp[i][j - 1] : 0);
				}
			}
		}
		
		printf("%d\n", dp[b][a]);
	}
	
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:15:17: error: 'memset' was not declared in this scope
   15 |                 memset(fab, false, sizeof(fab));
      |                 ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    2 | #include <string>
  +++ |+#include <cstring>
    3 | using namespace std;
Language: C++

#include<stdio.h>
#include<iostream>
long long int memo[20][20],j[1000000000];
long long int a,b,c,i,k=0,A,B,C;
long long int f(int x,int y){
    if(memo[x][y]==-2)return 0;
    if(x==1&&y==1)return 1;
    if(x==1)
    return memo[x][y]=f(x,y-1);
    if(y==1)
    return memo[x][y]=f(x-1,y);
    if(memo[x][y]!=-1){
        return memo[x][y];
    }else{
        return memo[x][y]=f(x-1,y)+f(x,y-1);
}}
int main(){
    using namespace std;
while(1){
    scanf("%lld%lld",&A,&B);
    if(A==0&&B==0)break;
    fill((int*)memo,(int*)memo+400,-1);
    scanf("%lld",&a);
    for(i=0;i<a;i++){
        scanf("%lld %lld",&b,&c);
        memo[b][c]=-2;
    }
    j[k]=f(A,B);
    k=k+1;
}
for(C=0;C<k;C++){
    printf("%lld\n",j[C]);
}

return 0;
}

Compiler output:
/tmp/ccLApzsC.o: in function `main':
a.cc:(.text+0x26d): relocation truncated to fit: R_X86_64_PC32 against symbol `B' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x277): relocation truncated to fit: R_X86_64_PC32 against symbol `A' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x295): relocation truncated to fit: R_X86_64_PC32 against symbol `A' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x2a1): relocation truncated to fit: R_X86_64_PC32 against symbol `B' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x2d8): relocation truncated to fit: R_X86_64_PC32 against symbol `a' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x2f6): relocation truncated to fit: R_X86_64_PC32 against symbol `i' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x303): relocation truncated to fit: R_X86_64_PC32 against symbol `c' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x30d): relocation truncated to fit: R_X86_64_PC32 against symbol `b' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x32b): relocation truncated to fit: R_X86_64_PC32 against symbol `b' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x332): relocation truncated to fit: R_X86_64_PC32 against symbol `c' defined in .bss section in /tmp/ccLApzsC.o
a.cc:(.text+0x361): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
Language: C++

#include<bits/stdc++.h>

using namespace std;

int f(int x,int y)
{
    if(x == 1 && y == 1)return 1;
    if(x <= 0 || y <= 0)return 0;
    if(load[x][y] == 0) return f(x - 1,y) + f(x,y - 1);
    return 0;
}

int main()
{
    int a,b,n,x,y;
    while(1){
        int load[17][17] = {0};
        cin >> a >> b;
        if(a == 0 && b == 0)break;
        cin >> n;
        for(int i = 0;i < n;i++){
            cin >> x >> y;
            load[x][y]=-1;
        }
    cout << f(a,b) << endl;
    }
    return 0;
}

Compiler output:
a.cc: In function 'int f(int, int)':
a.cc:9:8: error: 'load' was not declared in this scope
    9 |     if(load[x][y] == 0) return f(x - 1,y) + f(x,y - 1);
      |        ^~~~
Language: C++

import java.util.Scanner;

public class Main {
  public static void main(String[] args){
    new Main();
  }
  public Main(){
    Scanner sc = new Scanner(System.in);
    while(true){
      int w = sc.nextInt();
      int h = sc.nextInt();
      if(h==0 && w==0)break;
      int[][] dp = new int[h][w];
      dp[0][0] = 1;
      int n = sc.nextInt();
      while(n-->0){
        int x = sc.nextInt();
        int y = sc.nextInt();
        dp[y-1][x-1] = -1;
      }
      for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
          if(dp[i][j]==-1)continue;
          if(i<h-1 && dp[i+1][j]!=-1) dp[i+1][j] += dp[i][j];
          if(j<w-1 && dp[i][j+1]!=-1) dp[i][j+1] += dp[i][j];
        }
      }
      System.out.println(dp[h-1][w-1]);
    }
  }
}

Compiler output:
a.cc:1:1: error: 'import' does not name a type
    1 | import java.util.Scanner;
      | ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:3:1: error: expected unqualified-id before 'public'
    3 | public class Main {
      | ^~~~~~
Language: C++

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int a,b,n,m=0;
    int ans[100];
    int con1[40],con2[40];
    int road[16][16];
    while(1)
    {
        cin>>a>>b;
        if(a==0&&b==0)break;
        cin>>n;
        for(int i=0;i<n;i++)cin>>con1[i]>>con2[i];
        for(int i=1;i<=a;i++)for(int j=1;j<=b;j++)
        {
            if(i==1||j==1)road[i][j]=1;
            else road[i][j]=road[i-1][j]+road[i][j-1];
            for(int k=0;k<n;k++)if(i==con1[k]&&j==con2[k])road[i][j]=0;
        }
        ans[m]=road[a][b];
        m++
    }
    for(int i=0;i<m;i++)cout<<ans[m];
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:12: error: expected ';' before '}' token
   25 |         m++
      |            ^
      |            ;
   26 |     }
      |     ~
Language: C++

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int a,b,n,m=0;
    int ans[100];
    int con1[40],con2[40];
    int road[16][16];
    while(1)
    {
        cin>>a>>b;
        if(a==0&&b==0)break;
        cin>>n;
        for(int i=0;i<n;i++)cin>>con1[i]>>con2[i];
        for(int i=1;i<=a;i++)for(int j=1;j<=b;j++)
        {
            if(i==1||j==1)road[i][j]=1;
            else road[i][j]=road[i-1][j]+road[i][j-1];
            for(int k=0;k<n;k++)if(i==con1[k]&&j==con2[k])road[i][j]=0;
        }
        ans[m]=road[a][b];
        m++
    }
    for(int i=0;i<m;i++)cout<<ans[m]<<endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:12: error: expected ';' before '}' token
   25 |         m++
      |            ^
      |            ;
   26 |     }
      |     ~
Language: C++

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int a,b,n,m=0;
    int ans[1000];
    int con1[40],con2[40];
    int road[16][16];
    while(1)
    {
        cin>>a>>b;
        if(a==0&&b==0)break;
        cin>>n;
        for(int i=0;i<n;i++)cin>>con1[i]>>con2[i];
        for(int i=1;i<=a;i++)for(int j=1;j<=b;j++)
        {
            if(i==1||j==1)road[i][j]=1;
            else road[i][j]=road[i-1][j]+road[i][j-1];
            for(int k=0;k<n;k++)if(i==con1[k]&&j==con2[k])road[i][j]=0;
        }
        ans[m]=road[a][b];
        m++
    }
    for(int i=0;i<m;i++)cout<<ans[m]<<endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:12: error: expected ';' before '}' token
   25 |         m++
      |            ^
      |            ;
   26 |     }
      |     ~
Language: C++

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int a,b,n,m=0;
    int ans[10000];
    int con1[40],con2[40];
    int road[16][16];
    while(1)
    {
        cin>>a>>b;
        if(a==0&&b==0)break;
        cin>>n;
        for(int i=0;i<n;i++)cin>>con1[i]>>con2[i];
        for(int i=1;i<=a;i++)for(int j=1;j<=b;j++)
        {
            if(i==1||j==1)road[i][j]=1;
            else road[i][j]=road[i-1][j]+road[i][j-1];
            for(int k=0;k<n;k++)if(i==con1[k]&&j==con2[k])road[i][j]=0;
        }
        ans[m]=road[a][b];
        m++
    }
    for(int i=0;i<m;i++)cout<<ans[m]<<endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:12: error: expected ';' before '}' token
   25 |         m++
      |            ^
      |            ;
   26 |     }
      |     ~
Language: C++

#include<stdio.h>
int main(void)
|
	int a,b,n,x,y,i,j,dp[101][101]
	scanf("%d%d%d",&a,&b,&n);
	for(i=1;i<=a;i++){
		for(j=1;j<b;j++){
			dp[i][j]=0;
		}
	}
	for(i=1;i<=n;i++){
		scanf("%d%d",&x,&y);
		dp[x][y]=-1;
	}
	dp[1][1]=1;
	for(i=1;i<=a;i++){
		for(j=1;j<=b;j++){
			if(dp[i][j]!=-1){
				if(dp[i+1][j]==0&&i<=a){
					dp[i+1][j]=dp[i][j];
				}
				if(dp[i][j+1]!=-1&&j<=b){
					dp[i][j+1]=dp[i][j]+dp[i][j+1];
				}
			}
		}
	}
	printf("%d\n",dp[a][b]);
	return 0;
}

Compiler output:
a.cc:3:1: error: expected initializer before '|' token
    3 | |
      | ^
a.cc:6:9: error: expected unqualified-id before 'for'
    6 |         for(i=1;i<=a;i++){
      |         ^~~
a.cc:6:17: error: 'i' does not name a type
    6 |         for(i=1;i<=a;i++){
      |                 ^
a.cc:6:22: error: 'i' does not name a type
    6 |         for(i=1;i<=a;i++){
      |                      ^
a.cc:11:9: error: expected unqualified-id before 'for'
   11 |         for(i=1;i<=n;i++){
      |         ^~~
a.cc:11:17: error: 'i' does not name a type
   11 |         for(i=1;i<=n;i++){
      |                 ^
a.cc:11:22: error: 'i' does not name a type
   11 |         for(i=1;i<=n;i++){
      |                      ^
a.cc:15:9: error: 'dp' does not name a type
   15 |         dp[1][1]=1;
      |         ^~
a.cc:16:9: error: expected unqualified-id before 'for'
   16 |         for(i=1;i<=a;i++){
      |         ^~~
a.cc:16:17: error: 'i' does not name a type
   16 |         for(i=1;i<=a;i++){
      |                 ^
a.cc:16:22: error: 'i' does not name a type
   16 |         for(i=1;i<=a;i++){
      |                      ^
a.cc:28:15: error: expected constructor, destructor, or type conversion before '(' token
   28 |         printf("%d\n",dp[a][b]);
      |               ^
a.cc:29:9: error: expected unqualified-id before 'return'
   29 |         return 0;
      |         ^~~~~~
a.cc:30:1: error: expected declaration before '}' token
   30 | }
      | ^
Language: C++

{
int a,b,n,x,y;
while(1){
cin>>a>>b;
if(a==0)break;
int route[a+1][b+1];
cin>>n;
for(int i=1;i<=a;i++){
    for(int j=1;j<=b;j++){
        route[i][j]=0;
    }
}
for(int i=0;i<n;i++){
cin>>x>>y;
route[x][y]=-1;
}

route[1][1]=1;
for(int i=1;i<=a;i++){
for(int j=1;j<=b;j++){
if(route[i][j]==-1){
route[i][j]=0;
}else{
if(i>1) route[i][j]+=route[i-1][j];
if(j>1) route[i][j]+=route[i][j-1];
}



}
}


cout<<route[a][b]<<endl;

}
return 0;
}

Compiler output:
a.cc:1:1: error: expected unqualified-id before '{' token
    1 | {
      | ^
Language: C++

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

#define loop(i,n) for(int i=1;i<=n;i++)
int pat[17][17];
bool out[17][17];

int solve(){
	int a, b, n, x, y;
	cin >> a >> b;
	if (a == 0)return 0;
	cin >> n;
	loop(i, n){
		cin >> x;
		cin >> y;
		out[x][y] = 1;
	}
	loop(i, a)pat[i][1] = 1;
	loop(j, b)pat[1][j] = 1;
	loop(i, a){
		if (i == 1)continue;
		loop(j, b){
			if (j == 1)continue;
			if (out[i][j])continue;
			pat[i][j] = pat[i - 1][j] + pat[i][j - 1];
		}
	}
	cout << pat[a][b] << endl;
	return 1;
}

int main(){
	while (solve());
	return 0;
}

Compiler output:
a.cc:1:10: fatal error: bits/std/c++.h: No such file or directory
    1 | #include <bits/std/c++.h>
      |          ^~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

 
 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 #include<queue>
 
 using namespace std;
 
 int dir_x[2]={1,0};
 int dir_y[2]={0,1};
 int start_x,start_y;
 
 typedef pair<int,int> P;
 
 int n,m;
 int map[16][16];
 
 int bfs()
 {
   queue<P> que;
   int count=0;
   que.push(P(start_x,start_y));
   while(que.size())
   {
     P p=que.front();
     que.pop();
     if(p.first==n-1&&p.second==m-1)
     {
       count++;
       break;
     }
     for(int i=0;i<2;i++)
     {
       int next_x=p.first+dir_x[i];
       int next_y=p.second+dir_y[i];
       if(next_x<n&&next_y<m&&(map[next_x][next_y]==0)) 
       {
         que.push(P(next_x,next_y));                                              
       }
     }        
   }      
   return count;
 }
  
 int main()
 {
   int count=0;
   start_x=start_y=0;
   cin>>n>>m;
   for(int i=0;i<n;i++) for(int j=0;j<m;j++) map[i][j]=0;
   int obj;
   cin>>obj;
   while(obj--) 
   {
     int x,y;
     cin>>x>>y;
     map[x-1][y-1]=1;             
   }
   int count=bfs();
   cout<<count<<endl;
   //while(1);      
   return 0;    
 }
 

Compiler output:
a.cc: In function 'int bfs()':
a.cc:46:32: error: reference to 'map' is ambiguous
   46 |        if(next_x<n&&next_y<m&&(map[next_x][next_y]==0))
      |                                ^~~
In file included from /usr/include/c++/14/map:63,
                 from a.cc:10:
/usr/include/c++/14/bits/stl_map.h:102:11: note: candidates are: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:26:6: note:                 'int map [16][16]'
   26 |  int map[16][16];
      |      ^~~
a.cc: In function 'int main()':
a.cc:60:46: error: reference to 'map' is ambiguous
   60 |    for(int i=0;i<n;i++) for(int j=0;j<m;j++) map[i][j]=0;
      |                                              ^~~
/usr/include/c++/14/bits/stl_map.h:102:11: note: candidates are: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:26:6: note:                 'int map [16][16]'
   26 |  int map[16][16];
      |      ^~~
a.cc:67:6: error: reference to 'map' is ambiguous
   67 |      map[x-1][y-1]=1;
      |      ^~~
/usr/include/c++/14/bits/stl_map.h:102:11: note: candidates are: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:26:6: note:                 'int map [16][16]'
   26 |  int map[16][16];
      |      ^~~
a.cc:69:8: error: redeclaration of 'int count'
   69 |    int count=bfs();
      |        ^~~~~
a.cc:57:8: note: 'int count' previously declared here
   57 |    int count=0;
      |        ^~~~~
Language: C++

 
 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 #include<queue>
 
 using namespace std;
 
 int dir_x[2]={1,0};
 int dir_y[2]={0,1};
 int start_x,start_y;
 
 typedef pair<int,int> P;
 
 int n,m;
 //int map[16][16];
 
 int bfs()
 {
   queue<P> que;
   int count=0;
   que.push(P(start_x,start_y));
   while(que.size())
   {
     P p=que.front();
     que.pop();
     if(p.first==n-1&&p.second==m-1)
     {
       count++;
       break;
     }
     for(int i=0;i<2;i++)
     {
       int next_x=p.first+dir_x[i];
       int next_y=p.second+dir_y[i];
       if(next_x<n&&next_y<m&&map[next_x][next_y]==0) 
       {
         que.push(P(next_x,next_y));                                              
       }
     }        
   }      
   return count;
 }
  
 int main()
 {
   int count=0;
   int map[16][16];
   start_x=start_y=0;
   cin>>n>>m;
   for(int i=0;i<n;i++) for(int j=0;j<m;j++) map[i][j]=0;
   int obj;
   cin>>obj;
   while(obj--) 
   {
     int x,y;
     cin>>x>>y;
     map[x-1][y-1]=1;             
   }
   int count=bfs();
   cout<<count<<endl;
   //while(1);      
   return 0;    
 }
 

Compiler output:
a.cc: In function 'int bfs()':
a.cc:46:34: error: missing template arguments before '[' token
   46 |        if(next_x<n&&next_y<m&&map[next_x][next_y]==0)
      |                                  ^
a.cc: In function 'int main()':
a.cc:70:8: error: redeclaration of 'int count'
   70 |    int count=bfs();
      |        ^~~~~
a.cc:57:8: note: 'int count' previously declared here
   57 |    int count=0;
      |        ^~~~~
Language: C++

 
 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 #include<queue>
 
 using namespace std;
 
 struct stu
 {
   int x;
   int y;       
 };
 
 stu f;
 
 int dir_x[2]={1,0};
 int dir_y[2]={0,1};
 int start_x,start_y;
 
 int n,m;
 int map[16][16];
 
 int bfs()
 {
   queue<stu> que;
   int count=0;
   f.x=start_x;
   f.y=start_y;
   que.push(f);
   while(que.size())
   {
     stu p=que.front();
     que.pop();
     if(p.x==n-1&&p.y==m-1)
     {
       count++;
       break;
     }
     for(int i=0;i<2;i++)
     {
       stu q;
       q.x=p.x+dir_x[i];
       q.y=p.y+dir_y[i];
       if((q.x<n)&&(q.y<m)&&(map[q.x][q.y]!=1)) 
       {
         que.push(q);                                              
       }
     }        
   }      
   return count;
 }
  
 int main()
 {
   count=0;
   //int map[16][16];
   start_x=start_y=0;
   cin>>n>>m;
   for(int i=0;i<n;i++) for(int j=0;j<m;j++) map[i][j]=0;
   int obj;
   cin>>obj;
   while(obj--) 
   {
     int x,y;
     cin>>x>>y;
     map[x-1][y-1]=1;             
   }
   int count=bfs();
   cout<<count<<endl;
   //while(1);      
   return 0;    
 }
 


 

Compiler output:
a.cc: In function 'int bfs()':
a.cc:55:30: error: reference to 'map' is ambiguous
   55 |        if((q.x<n)&&(q.y<m)&&(map[q.x][q.y]!=1))
      |                              ^~~
In file included from /usr/include/c++/14/map:63,
                 from a.cc:10:
/usr/include/c++/14/bits/stl_map.h:102:11: note: candidates are: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:32:6: note:                 'int map [16][16]'
   32 |  int map[16][16];
      |      ^~~
a.cc: In function 'int main()':
a.cc:66:10: error: overloaded function with no contextual type information
   66 |    count=0;
      |          ^
a.cc:70:46: error: reference to 'map' is ambiguous
   70 |    for(int i=0;i<n;i++) for(int j=0;j<m;j++) map[i][j]=0;
      |                                              ^~~
/usr/include/c++/14/bits/stl_map.h:102:11: note: candidates are: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:32:6: note:                 'int map [16][16]'
   32 |  int map[16][16];
      |      ^~~
a.cc:77:6: error: reference to 'map' is ambiguous
   77 |      map[x-1][y-1]=1;
      |      ^~~
/usr/include/c++/14/bits/stl_map.h:102:11: note: candidates are: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map'
  102 |     class map
      |           ^~~
a.cc:32:6: note:                 'int map [16][16]'
   32 |  int map[16][16];
      |      ^~~
Language: C++

#include<iostream>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
using namespace std;
long long sousuu = 1, ans;

int main()
{
	int machi[20][20] = { 0,0 }, a, b, n; cin >> a >> b;
	bool kouji[20][20] = { false };
	a--; b--;
	while (scanf_s("%d",&n)) {
		if (n == 0) { break; }cout << n << endl;
		for (int i = 0; i < n; i++)
		{
			int d, e; cin >> d >> e;
			kouji[d - 1][e - 1] = true;
		}
		machi[0][0] = 1;
		REP(i, a + 1) {
			if (kouji[i][0]) {
				machi[i][0] = 1;
			}
			else {
				break;
			}
		}

		REP(i, b + 1) {
			if (kouji[0][i]) {
				machi[0][i] = 1;
			}
			else { break; }
		}
		FOR(i, 1, a + 1) {
			FOR(j, 1, b + 1) {
				if (kouji[i][j] != true) {
					machi[i][j] = machi[i - 1][j] + machi[i][j - 1];
					//cout << i << " " << j << " " << machi[i][j] << endl;
				}
			}
		}
		cout << machi[a][b] << endl;
	}

	cout << "s";
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:16: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
   12 |         while (scanf_s("%d",&n)) {
      |                ^~~~~~~
      |                scanf
Language: C++

#include<iostream>
#include<cstdio>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
using namespace std;
long long sousuu = 1, ans;

int main()
{
	int machi[20][20] = { 0,0 }, a, b, n; cin >> a >> b;
	bool kouji[20][20] = { false };
	a--; b--;
	while (scanf_s("%d",&n)) {
		if (n == 0) { break; }//cout << n << endl;
		for (int i = 0; i < n; i++)
		{
			int d, e; cin >> d >> e;
			kouji[d - 1][e - 1] = true;
		}
		machi[0][0] = 1;
		REP(i, a + 1) {
			if (kouji[i][0]) {
				machi[i][0] = 1;
			}
			else {
				break;
			}
		}

		REP(i, b + 1) {
			if (kouji[0][i]) {
				machi[0][i] = 1;
			}
			else { break; }
		}
		FOR(i, 1, a + 1) {
			FOR(j, 1, b + 1) {
				if (kouji[i][j] != true) {
					machi[i][j] = machi[i - 1][j] + machi[i][j - 1];
					//cout << i << " " << j << " " << machi[i][j] << endl;
				}
			}
		}
		cout << machi[a][b] << endl;
	}

//	cout << "s";
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:13:16: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
   13 |         while (scanf_s("%d",&n)) {
      |                ^~~~~~~
      |                scanf
Language: C++

import Control.Monad
import Control.Applicative

main :: IO ()
main = do
  [a, b] <- getInts
  if (a == 0 && b == 0) then return ()
  else do
    n <- getInt
    ss <- getIntsLines n
    print $ solve [1,1] (ss ++ [[a+1, x] | x <- [1..b]] ++ [[x,b+1]|x<-[1..a]]) a b
    main

solve p ss a b 
  | p == [a,b] = 1
  | notElem (add1 p) ss && notElem (add2 p) ss = solve (add1 p) ss a b + solve (add2 p) ss a b
  | elem (add1 p) ss && notElem (add2 p) ss = solve (add2 p) ss a b
  | notElem (add1 p) ss && elem (add2 p) ss = solve (add1 p) ss a b
  | otherwise = 0



---

getInt :: IO Integer
getInt = read <$> getLine

getInts :: IO [Integer]
getInts = map read . words <$> getLine

getIntLines :: Integral a => a -> IO [Integer]
getIntLines n = replicateM (fromIntegral n :: Int) getInt

getIntsLines :: Integral a => a -> IO [[Integer]]
getIntsLines n = replicateM (fromIntegral n :: Int) getInts

add1 [n,m] = [n + 1, m]
add2 [n,m] = [n, m + 1]

Compiler output:
a.cc:11:50: error: too many decimal points in number
   11 |     print $ solve [1,1] (ss ++ [[a+1, x] | x <- [1..b]] ++ [[x,b+1]|x<-[1..a]]) a b
      |                                                  ^~~~
a.cc:11:73: error: too many decimal points in number
   11 |     print $ solve [1,1] (ss ++ [[a+1, x] | x <- [1..b]] ++ [[x,b+1]|x<-[1..a]]) a b
      |                                                                         ^~~~
a.cc:1:1: error: 'import' does not name a type
    1 | import Control.Monad
      | ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
Language: C++

#include <iostream>
#include <vector>

/*
substitute 0 for cannot through path
'x' and 'y' is point of construction
'row' is a
'column' is b
*/
/*
void cannotThroughPath(int x, int y, int row, int column){
	int v[row][column];

	if(x == 1 && y != 1){
		for(int i = 0; i < column; ++i){
			v[x-1][i] = 0;
		}
	} else if(x != 1 && y == 1){
		for(int i = 0; i < row; ++i){
			v[i][y-1] = 0;
		}
	} else if(x != 1 && y != 1){
		v[x-1][y-1] = 0;
	}
}
*/
int main(void){
	int a,b; //number of road

	while(std::cin >> a >> b){ //input road
		if(a == 0 && b == 0) //end of input
			break;

		//make matrix a x b
		int path[a][b];

		for(int i = 0; i < a; ++i){
			for(int j = 0; j < b; ++j){
				path[i][j] = -1;
			}
		}
		
		path[0][0] = 0;
		for(int i = 1; i < a; ++i){
			path[i][0] = 1;
		}

		for(int j = 1; j < b; ++j){
			path[0][j] = 1;
		}

		int num; //number of construction
		std::cin >> num;

		int x, y; //point of construction
		for(int i = 0; i < num; ++i){
			std::cin >> x >> y;
			//cannotThroughPath(x, y, a, b);
			if(x == 1 && y != 1){
				for(int i = 0; i < column; ++i){
					path[x-1][i] = 0;
				}
			} else if(x != 1 && y == 1){
				for(int i = 0; i < row; ++i){
					path[i][y-1] = 0;
				}
			} else if(x != 1 && y != 1){
				path[x-1][y-1] = 0;
			}
		}

		for(int i = 1; i < b; ++i){
			for(int j = 1; j < a; ++j){
				if(path[j][i] == 0){
					path[j][i] = 0;
				} else if(path[j][i] != 0){
					path[j][i] = path[j-1][i] + path[j][i-1];
				}
			}
		}
		
		std::cout << path[a-1][b-1] << std::endl; //output answer
	}
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:60:52: error: 'column' was not declared in this scope
   60 |                                 for(int i = 0; i < column; ++i){
      |                                                    ^~~~~~
a.cc:64:52: error: 'row' was not declared in this scope
   64 |                                 for(int i = 0; i < row; ++i){
      |                                                    ^~~
Language: C++

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;

int main()
{
  int h, w;
  while(cin >> w >> h) {
    if(h == 0 && w == 0) return 0;
    int n; cin >> n;
    int ng[h][w]; CLR(ng);
    FOR(i,0,n) {
      int a, b; cin >> a >> b;
      --a;--b;
      ng[b][a] = true;
    }
    ll dp[h][w]; CLR(dp);
    FOR(y,0,h) {
      if(ng[y][x]) dp[y][0] = 1;
      else break;
    }
    FOR(x,0,w) {
      if(ng[y][x]) dp[0][x] = 1;
      else break;
    }
    FOR(y,1,h) {
      FOR(x,1,w) {
        if(ng[y][x]) continue;
        dp[y][x] = dp[y-1][x] + dp[y][x-1];
      }
    }
    cout << dp[h-1][w-1] << endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:35:16: error: 'x' was not declared in this scope
   35 |       if(ng[y][x]) dp[y][0] = 1;
      |                ^
a.cc:39:13: error: 'y' was not declared in this scope
   39 |       if(ng[y][x]) dp[0][x] = 1;
      |             ^
Language: C++

#include <stdio.h>
#include <queue>
#include <iostream>
using namespace std;
??
int main (){
??
while (1){
??
int a,b,s,k,s2,i[18][18]={0},count=0;
??
stack <pair<int,int> > que;
??
pair <int,int> p,g;
??
p.first=1;
p.second=1;
??
que.push(p);
??
scanf ("%d %d",&a,&b);
??
if (a==0&&b==0) break;
??
for (s=0;s<=a+1;s++){
??????????for (s2=0;s2<=b+1;s2++){
????????????if (s==a+1||s==0){
????????????????i[s][s2]=1;
????????????????}
????????????if (s2==b+1||s2==0){
????????????????i[s][s2]=1;
????????????????????????????????}
????????}
}
??
g.first=a;
g.second=b;
??
scanf ("%d",&k);
??
for (s=0;s<k;s++){
??
scanf ("%d %d",&a,&b);
??
i[a][b]=1;
??
}
??
while (!que.empty()){
????????p=que.front();
????????que.pop();
????????if (i[p.first+1][p.second]==0){
????????????????p.first=p.first+1;
????????????????que.push(p);
????????????????p.first=p.first-1;
????????}
??
????????if (i[p.first][p.second+1]==0){
????????????????p.second=p.second+1;
????????????????que.push(p);
????????????????p.second=p.second-1;
????????}
??
????????????????if (p==g){
????????????????count++;
????????}
??
}
??
printf ("%d\n",count);
??
}
??
return 0;
}

Compiler output:
a.cc:5:1: error: expected unqualified-id before '?' token
    5 | ??
      | ^
Language: C++

#include <stdio.h>
#include <queue>
#include <iostream>
using namespace std;
??
int main (){
??
while (1){
??
int a,b,s,k,s2,i[18][18]={0},count=0;
??
queue <pair<int,int> > que;
??
pair <int,int> p,g;
??
p.first=1;
p.second=1;
??
que.push(p);
??
scanf ("%d %d",&a,&b);
??
if (a==0&&b==0) break;
??
for (s=0;s<=a+1;s++){
??????????for (s2=0;s2<=b+1;s2++){
????????????if (s==a+1||s==0){
????????????????i[s][s2]=1;
????????????????}
????????????if (s2==b+1||s2==0){
????????????????i[s][s2]=1;
????????????????????????????????}
????????}
}
??
g.first=a;
g.second=b;
??
scanf ("%d",&k);
??
for (s=0;s<k;s++){
??
scanf ("%d %d",&a,&b);
??
i[a][b]=1;
??
}
??
while (!que.empty()){
????????p=que.front();
????????que.pop();
????????if (i[p.first+1][p.second]==0){
????????????????p.first=p.first+1;
????????????????que.push(p);
????????????????p.first=p.first-1;
????????}
??
????????if (i[p.first][p.second+1]==0){
????????????????p.second=p.second+1;
????????????????que.push(p);
????????????????p.second=p.second-1;
????????}
??
????????????????if (p==g){
????????????????count++;
????????}
??
}
??
printf ("%d\n",count);
??
}
??
return 0;
}

Compiler output:
a.cc:5:1: error: expected unqualified-id before '?' token
    5 | ??
      | ^
Language: C++

#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#define INF 2147483647
#define IN 2047483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long

using namespace std;
int main(){
  int a,b;
  while(cin>>a>>b,a+b){
    int n;
    cin>>n;
    int dp[a*2][b*2];
    fill(dp,IN);
    for(int i=0;i<n;i++){
      int x,y;
      cin>>x>>y;
      dp[x][y]=INF;
    }
    dp[1][1]=0;
    for(int i=1;i<=a;i++){
      for(int j=1;j<=b;j++){
	if(dp[i][j]==-1)
	  continue;
	dp[i][j]=min(dp[i][j-1]+1,dp[i][j]);
      }
    }
    cout<<dp[a][b]<<endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:24:9: error: no matching function for call to 'fill(int [(a * 2)][(b * 2)], int)'
   24 |     fill(dp,IN);
      |     ~~~~^~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:1022:5: note: candidate: 'template<class _ForwardIterator, class _Tp> void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&)'
 1022 |     fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
      |     ^~~~
/usr/include/c++/14/bits/stl_algobase.h:1022:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:86,
                 from a.cc:6:
/usr/include/c++/14/pstl/glue_algorithm_defs.h:191:1: note: candidate: 'template<class _ExecutionPolicy, class _ForwardIterator, class _Tp> __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void> std::fill(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&)'
  191 | fill(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value);
      | ^~~~
/usr/include/c++/14/pstl/glue_algorithm_defs.h:191:1: note:   candidate expects 4 arguments, 2 provided
Language: C++

#include<iostream>

using namespace std;

bool cant[20][20];
ll mp[20][20];
int a,b,ans;

int main()
{
	while(cin >> a >> b,a)
	{
		for(int i = 0;i < 20;i++)for(int j = 0;j < 20;j++)
		{
			mp[i][j] = 0;
			cant[i][j] = false;
		}
		ans = 0;
		
		int n;
		cin >> n;
		
		for(int i = 0;i < n;i++)
		{
			int x,y;
			cin >> x >> y;
			cant[x-1][y-1] = true;
		}
		
		for(int i = 0;i < 20;i++)
		{
			if(cant[i][0])break;
			mp[i][0]=1;		
		}
		for(int i = 0;i < 20;i++)
		{
			if(cant[0][i])break;
			mp[0][i]=1;		
		}
		
		
		for(int i = 1;i < a ;i++)for(int j = 1;j < b;j++)
		{
			int tmp = 0;
			if(i > 0)tmp += mp[i-1][j];
			if(j > 0)tmp += mp[i][j-1];
			if(!cant[i][j])
			{
				mp[i][j] = tmp;
			}
			else
			{
				mp[i][j] = 0;
			}
			
		}

		cout << mp[a-1][b-1] << endl;
	}
	
	return 0;
}	

Compiler output:
a.cc:6:1: error: 'll' does not name a type
    6 | ll mp[20][20];
      | ^~
a.cc: In function 'int main()':
a.cc:15:25: error: 'mp' was not declared in this scope
   15 |                         mp[i][j] = 0;
      |                         ^~
a.cc:33:25: error: 'mp' was not declared in this scope
   33 |                         mp[i][0]=1;
      |                         ^~
a.cc:38:25: error: 'mp' was not declared in this scope
   38 |                         mp[0][i]=1;
      |                         ^~
a.cc:45:41: error: 'mp' was not declared in this scope; did you mean 'tmp'?
   45 |                         if(i > 0)tmp += mp[i-1][j];
      |                                         ^~
      |                                         tmp
a.cc:46:41: error: 'mp' was not declared in this scope; did you mean 'tmp'?
   46 |                         if(j > 0)tmp += mp[i][j-1];
      |                                         ^~
      |                                         tmp
a.cc:49:33: error: 'mp' was not declared in this scope; did you mean 'tmp'?
   49 |                                 mp[i][j] = tmp;
      |                                 ^~
      |                                 tmp
a.cc:53:33: error: 'mp' was not declared in this scope; did you mean 'tmp'?
   53 |                                 mp[i][j] = 0;
      |                                 ^~
      |                                 tmp
a.cc:58:25: error: 'mp' was not declared in this scope
   58 |                 cout << mp[a-1][b-1] << endl;
      |                         ^~
Language: C++

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

typedef pair<int,int> pii ;

int a = 0 ;
int b = 0 ;
int n = 0 ;
int dp[16][16] = {1} ;
vector<pii> construct ;
int inf = pow(10,9) ;

int solve()
{
  for ( int i = 0 ; i < 16 ; i++ )
  {
    for ( int j = 0 ; j < 16 ; j++ )
    {
      dp[i][j] = 0 ;
    }
  }
  for ( int i = 0 ; i < construct.size() ; i++ )
  {
    dp[ construct[i].first - 1 ][ construct[i].second - 1 ] = inf ;
  }
  dp[0][0] = 1 ;
  for ( int i = 0 ; i < a ; i++ )
  {
    for ( int j = 0 ; j < b ; j++ )
    {
      if ( dp[i][j] == inf ) continue ;
      if ( i < a - 1 )
      {
        if ( dp[ i + 1 ][j] != inf )
        {
          dp[ i + 1 ][j] += dp[i][j] ;
        }
      }
      if ( j < b - 1 )
      {
        if ( dp[i][ j + 1 ] != inf )
        {
          dp[i][ j + 1 ] += dp[i][j] ;
        }
      }
    }
  }
  return dp[ a - 1 ][ b - 1 ] ;
}

int main()
{
  while (1)
  {
    cin >> a >> b ;
    if ( !a && !b ) break ;
    cin >> n ;
    for ( int i = 0 ; i < n ; i++ )
    {
      int x, y ;
      cin >> x >> y ;
      construct.push_back( pii(x,y) ) ;
    }
    printf("%d\n", solve()) ;
  }
  return 0 ;
}

Compiler output:
a.cc:2:9: fatal error: windows.h: No such file or directory
    2 | #include<windows.h>
      |         ^~~~~~~~~~~
compilation terminated.