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

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main() {
	int n = 0;
	int m = 0;

	scanf("%d", &n);
	scanf("%d", &m);

	int a[51][51] = { 0 };
	int b[51][51] = { 0 };
	char tmp;


	//a読み込み部
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			scanf("%c", &tmp);
			if (tmp == '\n') { scanf("%c", &tmp); }
			if (tmp == '.') { a[i][j] = 0; }
			else if(tmp == '#'){ a[i][j] = 1; }

		}
	}

	//b読み込み部
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < m; j++) {
			scanf("%c", &tmp);
			if (tmp == '\n') { scanf("%c", &tmp); }

			if (tmp == '.') { b[i][j] = 0; }
			else if (tmp == '#') { b[i][j] = 1; }

		}
	}

	if (n - m < 0) {
		printf("No");
		return 0;
	}

	for (int i = 0; i < n - m; i++) {
		for (int j = 0; i < n - m; i++) {

			for (int x = 0; x < m; x++) {
				for (int y = 0; y < m; y++) {
					if (a[i+x][j+y] != b[x][y]) { goto next; }
				}

				if (x == m - 1 && y == m-1) { printf("Yes"); 
				return 0; }
			}

		next:;
		}
	}

	printf("No");

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:52:51: error: 'y' was not declared in this scope
   52 |                                 if (x == m - 1 && y == m-1) { printf("Yes");
      |                                                   ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define N 55
int n,m;
string s[N],r[N];

bool che(int i,int j){
	for(int a=0;a<m;a++){
		for(int b=0;b<m;b++){
			if(s[a+i][b+j]!=r[a][b])
				return 0;
		}
	}
	return 1;
}

bool solve(){
	for(int i=0;i<=n-m;i++)
		for(int j=0;j<=n-m;j++)
			if(che(i,j))
				return 1;
	return 0;		 
}

int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++)
			cin>>s[i];
	for(int i=0;i<m;i++)
			cin>>r[i];
	if(solve())cout<<"Yes\n";
	else cout<<"No\n";


Compiler output:
a.cc: In function 'int main()':
a.cc:32:27: error: expected '}' at end of input
   32 |         else cout<<"No\n";
      |                           ^
a.cc:25:11: note: to match this '{'
   25 | int main(){
      |           ^
Language: Java

public class Main {
    
    static int n;
    static int m;
    
    public static void main(String[] args) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(br.readLine());
        n=Integer.parseInt(st.nextToken());
        m=Integer.parseInt(st.nextToken());
        boolean[][] n_map=new boolean[n][n];
        boolean[][] m_map=new boolean[m][m];
        String str;
        for(int i=0;i<n;i++){
            str=br.readLine();
            for(int j=0;j<n;j++){
                n_map[i][j]=(str.charAt(j)=='#');
            }
        }
        for(int i=0;i<m;i++){
            str=br.readLine();
            for(int j=0;j<m;j++){
                m_map[i][j]=(str.charAt(j)=='#');
            }
        }
        
        for(int i=0;i<=n-m;i++){
            for(int j=0;j<=n-m;j++){
                if(check(n_map,m_map,i,j)){
                    System.out.println("Yes");
                    System.exit(0);
                }
            }
        }System.out.println("No");
        
    }
    
    static boolean check(boolean[][] a,boolean[][] b,int start1,int start2){
        
        for(int i=0;i<m;i++){
            
            for(int j=0;j<m;j++){
                if(a[i+start1][j+start2]!=b[i][j]){ return false; }
            }
        }
        System.out.println(start1+" "+start2);
        return true;
    }
}


Compiler output:
Main.java:6: error: cannot find symbol
    public static void main(String[] args) throws IOException {
                                                  ^
  symbol:   class IOException
  location: class Main
Main.java:7: error: cannot find symbol
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        ^
  symbol:   class BufferedReader
  location: class Main
Main.java:7: error: cannot find symbol
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                              ^
  symbol:   class BufferedReader
  location: class Main
Main.java:7: error: cannot find symbol
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                                                 ^
  symbol:   class InputStreamReader
  location: class Main
Main.java:8: error: cannot find symbol
        StringTokenizer st=new StringTokenizer(br.readLine());
        ^
  symbol:   class StringTokenizer
  location: class Main
Main.java:8: error: cannot find symbol
        StringTokenizer st=new StringTokenizer(br.readLine());
                               ^
  symbol:   class StringTokenizer
  location: class Main
6 errors
Language: C++

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

using namespace std;

#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define mst(a,n)  memset(a,n,sizeof(a))
#define ll long long
#define N 55
#define mod 1000000007
#define INF 0x3f3f3f3f

const double eps=1e-8;
const double pi=acos(-1.0);

int n,m;
char a[N][N],b[N][N];

bool cmp(int x,int y)
{
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(a[i+x][j+y]!=b[i][j])
                return false;
        }
    }
    return true;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);


    scann(n,m);
    getchar();
    for(int i=0;i<n;i++)
        gets(a[i]);
    for(int i=0;i<m;i++)
        gets(b[i]);
    for(int i=0;i<n-m;i++)
    {
        for(int j=0;j<n-m;j++)
        {
            if(a[i][j]==b[0][0])
            {
                if(cmp(i,j))
                {
                    printf("Yes\n");
                    return 0;
                }
            }
        }
    }
    printf("No\n");
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:54:9: error: 'gets' was not declared in this scope; did you mean 'getw'?
   54 |         gets(a[i]);
      |         ^~~~
      |         getw
a.cc:56:9: error: 'gets' was not declared in this scope; did you mean 'getw'?
   56 |         gets(b[i]);
      |         ^~~~
      |         getw
Language: C++

#include <iostream>
#include <string>

using namespace std;
int main() {
    int n, m; cin >> n >> m;
    string* a = new string [n];
    string* b = new string [m];
    for(int i = 0; i < n; ++i) { cin >> a[i]; }
    for(int i = 0; i < m; ++i) { cin >> b[i]; }
    for(int top = 0; top < n-m+1; ++top)
    {
        for(int lef = 0; lef < n-m+1; ++lef)
        {
            found = true;
            for(int bt = 0; bt < m; ++bt)
            {
                for(int bl = 0; bl < m; ++bl)
                {
                    if (b[bt][bl] != a[top+bt][lef+bl]) {found = false; goto nf;}
                }
            }
            nf:
            if (found) goto ff;
        }
    }
    ff:
    cout << (found ? "Yes" : "No") << endl;
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:15:13: error: 'found' was not declared in this scope
   15 |             found = true;
      |             ^~~~~
a.cc:28:14: error: 'found' was not declared in this scope
   28 |     cout << (found ? "Yes" : "No") << endl;
      |              ^~~~~
Language: C++

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

vector<string>A, B;

int main()
{
    int N, M;
    cin>>N>>M;
   
    string inp;
    for(int i = 0; i < N; i++)
    {
        cin>>inp;
        A.push_back(inp);
    }
    for(int i = 0; i < M; i++)
    {
        cin>>inp;
        B.push_back(inp);
    }
    int i, j, k, l;
    int ans = 0;
    for(i = 0; i + M - 1 < N; i++)
    {
        for(j = 0; j + M - 1 < N; j++)
        {
             for(k = 0; k < M; k++)
             {
                 for(l = 0; l < M; l++)
                 {
                         if(A[i + k][j + l] != B[k][l]) break;
                 }
                 if(l < M) break;
             }
             if(k == M) ans++;
        }
    }
    if(ans) cout<<"Yes"<<endl;
    else cout<<"No<<endl;
    return 0;
}


Compiler output:
a.cc:40:16: warning: missing terminating " character
   40 |     else cout<<"No<<endl;
      |                ^
a.cc:40:16: error: missing terminating " character
   40 |     else cout<<"No<<endl;
      |                ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:41:5: error: expected primary-expression before 'return'
   41 |     return 0;
      |     ^~~~~~
Language: C++

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <map>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <set>
#include <queue>
#include <list>

using namespace std;
char a[55][55],b[55][55];
int main()
{
    int n,m;
    bool ju=false;
    scanf("%d%d",&n,&m);
    getchar();
    for(int i=0;i<n;++i)
        gets(a[i]);
    for(int i=0;i<m;++i)
        gets(b[i]);
    int k=n-m;
    for(int i=0;i<=k;++i)
    {
        if(ju) break;
        for(int j=0;j<=k;++j)
        {
            bool juu=true;
            for(int x=0;x<m;++x)
                for(int y=0;y<m;++y)
            {
                if(a[i+x][j+y]!=b[x][y])
                {
                    juu=false;
                    break;
                }
            }
            if(juu)
            {
                ju=true;
                break;
            }
        }
    }
    if(ju) printf("Yes\n");
    else printf("No\n");
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:25:9: error: 'gets' was not declared in this scope; did you mean 'getw'?
   25 |         gets(a[i]);
      |         ^~~~
      |         getw
a.cc:27:9: error: 'gets' was not declared in this scope; did you mean 'getw'?
   27 |         gets(b[i]);
      |         ^~~~
      |         getw
Language: C++

#include <iostream>
#include <string>

using namespace std;
int main() {
int n, m; cin >> n >> m;
string* a = new string [n];
string* b = new string [m];
for(int i = 0; i < n; ++i) { cin >> a[i]; }
for(int i = 0; i < m; ++i) { cin >> b[i]; }
bool found = true;
for(int top = 0; top < n-m; ++top)
{
for(int lef = 0; lef < n-m; ++lef)
{

for(int bt = 0; bt < m; ++bt)
{
for(int bl = 0; bl < m; ++bl)
{
if (b[bt][bl] != a[top][lef]) {found = false; goto nf;}
}
}
nf:
if (found) goto ff:
}
}
ff:
cout << (found ? "Yes" : "No") << endl;
return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:19: error: expected ';' before ':' token
   25 | if (found) goto ff:
      |                   ^
      |                   ;
a.cc:25:19: error: expected primary-expression before ':' token
Language: C++


#include <cstdio>
#include <iostream>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)

char a[60][60];
char b[60][60];

int main(void) {
  int n, m;
  scanf("%d %d ", &n, &m);
  REP(i, n)
    gets(a[i]);
  REP(i, m)
    gets(b[i]);
  REP(i, n-m+1) REP(j, n-m+1) {
    bool ok = true;
    REP(ii, m) REP(jj, m) {
      if (a[i+ii][j+jj] != b[ii][jj]) {
        ok = false;
      }
    }
    if (ok) {
      puts("Yes");
      return 0;
    }
  }

  puts("No");
   
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:5: error: 'gets' was not declared in this scope; did you mean 'getw'?
   14 |     gets(a[i]);
      |     ^~~~
      |     getw
a.cc:16:5: error: 'gets' was not declared in this scope; did you mean 'getw'?
   16 |     gets(b[i]);
      |     ^~~~
      |     getw
Language: C++

#include<cstdio>
char a[50][51],b[50][51];
int main()
[
int i,j,k,l,n,m;scanf("%d%d",&n,&m);
for(i=0;i<n;i++)scanf("%s",a[i]);
for(i=0;i<m;i++)scanf("%s",b[i]);
for(i=0;i<n-m;i++)
for(j=0;j<n-m;j++){
bool f=true;
for(k=0;k<m&&f;k++)
for(l=0;l<m&&f;l++)
if(a[i+k][j+l]!=b[k][l])f=false;
if(f)return puts("Yes"),0;
}
puts("No");
return 0;
}

Compiler output:
a.cc:5:1: error: expected primary-expression before 'int'
    5 | int i,j,k,l,n,m;scanf("%d%d",&n,&m);
      | ^~~
a.cc:4:2: error: expected ']' before 'int'
    4 | [
      |  ^
      |  ]
    5 | int i,j,k,l,n,m;scanf("%d%d",&n,&m);
      | ~~~
a.cc:5:22: error: expected constructor, destructor, or type conversion before '(' token
    5 | int i,j,k,l,n,m;scanf("%d%d",&n,&m);
      |                      ^
a.cc:6:1: error: expected unqualified-id before 'for'
    6 | for(i=0;i<n;i++)scanf("%s",a[i]);
      | ^~~
a.cc:6:9: error: 'i' does not name a type
    6 | for(i=0;i<n;i++)scanf("%s",a[i]);
      |         ^
a.cc:6:13: error: 'i' does not name a type
    6 | for(i=0;i<n;i++)scanf("%s",a[i]);
      |             ^
a.cc:7:1: error: expected unqualified-id before 'for'
    7 | for(i=0;i<m;i++)scanf("%s",b[i]);
      | ^~~
a.cc:7:9: error: 'i' does not name a type
    7 | for(i=0;i<m;i++)scanf("%s",b[i]);
      |         ^
a.cc:7:13: error: 'i' does not name a type
    7 | for(i=0;i<m;i++)scanf("%s",b[i]);
      |             ^
a.cc:8:1: error: expected unqualified-id before 'for'
    8 | for(i=0;i<n-m;i++)
      | ^~~
a.cc:8:9: error: 'i' does not name a type
    8 | for(i=0;i<n-m;i++)
      |         ^
a.cc:8:15: error: 'i' does not name a type
    8 | for(i=0;i<n-m;i++)
      |               ^
a.cc:9:9: error: 'j' does not name a type
    9 | for(j=0;j<n-m;j++){
      |         ^
a.cc:9:15: error: 'j' does not name a type
    9 | for(j=0;j<n-m;j++){
      |               ^
a.cc:16:5: error: expected constructor, destructor, or type conversion before '(' token
   16 | puts("No");
      |     ^
a.cc:17:1: error: expected unqualified-id before 'return'
   17 | return 0;
      | ^~~~~~
a.cc:18:1: error: expected declaration before '}' token
   18 | }
      | ^
Language: C++

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,n) for(int i = 1; i < n; i++)
#define repv(i,n) for(int i = n-1; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
using namespace std;
typedef long long ll;

char BUF[3500000];
inline void I(int&a){scanf("%d",&a);}
inline void I(int&a,int&b){scanf("%d%d",&a,&b);}
inline void I(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void I(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void L(ll&a){scanf("%lld",&a);}
inline void L(ll&a,ll&b){scanf("%lld%lld",&a,&b);}
inline void L(ll&a,ll&b,ll&c){scanf("%lld%lld%lld",&a,&b,&c);}
inline void L(ll&a,ll&b,ll&c,ll&d){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);}
inline void S(string&str){str.clear();scanf("%s",BUF);int s=strlen(BUF);rep(i,s)str.pb(BUF[i]);}
inline void SV(vector<int>&v){v.clear();scanf("%s",BUF);int s=strlen(BUF);rep(i,s)if('a'<=BUF[i]&&BUF[i]<='z')v.pb(BUF[i]-'a');else v.pb(BUF[i]-'A');}

const auto EPS = 1e-10;
const auto INF = 100000000;
const auto MOD = 1000000007;
typedef pair<ll,ll> P;

int n, m;
char a[50][50], b[50][50];

int main(){
    I(n,m);
    rep(i,n) rep(j,n) cin >> a[i][j];
    rep(i,m) rep(j,m) cin >> b[i][j];
    rep(i,n){
        rep(j,n){
            bool ok = true;
            if(i+m-1 >= n) continue;
            rep(k,m){
                rep(l,m){
                    if(a[i+k][j+l] != b[k][l]){
                        ok = false;
                        break;
                    }
                }
                if(!ok) break;
            }
            if(ok){
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout << "No" << endl;
    


Compiler output:
a.cc: In function 'int main()':
a.cc:54:26: error: expected '}' at end of input
   54 |     cout << "No" << endl;
      |                          ^
a.cc:31:11: note: to match this '{'
   31 | int main(){
      |           ^
Language: C++

#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 8;
vector <int> g[MAXN+1];
int n,m;
long long int res=0;
dfs(int v, long long int mask){
	if(mask==((1LL<<n)-1)){
		res+=1;
	}
	else{
		for(int i=0; i<g[v].size(); i++){
			if(!((1LL<<g[v][i])&(mask))){
				dfs(g[v][i], mask|(1LL<<g[v][i]));
			}
		}
	}
}

int main(){
	cin>>n>>m;
	for(int i=0; i<m; i++){
		int u,v;
		cin>>u>>v;
		g[u-1].push_back(v-1);
		g[v-1].push_back(u-1);
	}

	dfs(0,1);

	cout<<res<<endl;
}

Compiler output:
a.cc:8:1: error: ISO C++ forbids declaration of 'dfs' with no type [-fpermissive]
    8 | dfs(int v, long long int mask){
      | ^~~
a.cc: In function 'int dfs(int, long long int)':
a.cc:19:1: warning: no return statement in function returning non-void [-Wreturn-type]
   19 | }
      | ^
Language: C++

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

int N,M,a,b,startingPoint,visit,ans;
vector<int> adj[100100];
bool visited[100100];

void dfs(int x){
	if(visited[x]) return;
	visited[x] = true;
    visit++;
	for(int i = 0;i < adj[x].size();i++){
		int y = adj[x][i];
		dfs(y);
	}
    if (visit == N) ans++;
	visited[x] = false;
    visit--;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>N>>M;
	for(int i = 1;i <= M;i++){
		cin>>a>>b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dfs(1);
    cout<<ans<<endl;
	return 0;
}

Compiler output:
a.cc: In function 'void dfs(int)':
a.cc:11:5: error: reference to 'visit' is ambiguous
   11 |     visit++;
      |     ^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:80,
                 from a.cc:1:
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:4:27: note:                 'int visit'
    4 | int N,M,a,b,startingPoint,visit,ans;
      |                           ^~~~~
a.cc:16:9: error: reference to 'visit' is ambiguous
   16 |     if (visit == N) ans++;
      |         ^~~~~
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:4:27: note:                 'int visit'
    4 | int N,M,a,b,startingPoint,visit,ans;
      |                           ^~~~~
a.cc:18:5: error: reference to 'visit' is ambiguous
   18 |     visit--;
      |     ^~~~~
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:4:27: note:                 'int visit'
    4 | int N,M,a,b,startingPoint,visit,ans;
      |                           ^~~~~
Language: C++

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

int N,M,a,b,startingPoint,visit,ans;
vector<int> adj[100100];
bool visited[100100];

void dfs(int x){
	if(visited[x]) return;
	visited[x] = true;
    visit++;
	for(int i = 0;i < adj[x].size();i++){
		int y = adj[x][i];
		dfs(y);
	}
    if (visit == N) ans++;
	visited[x] = false;
    visit--;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>N>>M;
	for(int i = 1;i <= M;i++){
		cin>>a>>b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	cin>>startingPoint;
	dfs(startingPoint);
    cout<<ans<<endl;
	return 0;
}


Compiler output:
a.cc: In function 'void dfs(int)':
a.cc:11:5: error: reference to 'visit' is ambiguous
   11 |     visit++;
      |     ^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:80,
                 from a.cc:1:
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:4:27: note:                 'int visit'
    4 | int N,M,a,b,startingPoint,visit,ans;
      |                           ^~~~~
a.cc:16:9: error: reference to 'visit' is ambiguous
   16 |     if (visit == N) ans++;
      |         ^~~~~
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:4:27: note:                 'int visit'
    4 | int N,M,a,b,startingPoint,visit,ans;
      |                           ^~~~~
a.cc:18:5: error: reference to 'visit' is ambiguous
   18 |     visit--;
      |     ^~~~~
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:4:27: note:                 'int visit'
    4 | int N,M,a,b,startingPoint,visit,ans;
      |                           ^~~~~
Language: C++

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

#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){

    int n,m;
    cin >> n >> m;
    vector<int> v(n);
    rep(i,n) v[i]=i+1;
    vector<vector<int>> l(n+1);
    int a,b;
    rep(i,m){
        cin >> a >> b;
        l[a].push_back(b);
        l[b].push_back(a);
    }

    int sum=0;
    bool ans;
    do{
        if(v[0]!=1) break;
        int p=1;
        rep2(i,1,n){
            ans=false;
            rep(j,l[p].size(){
                if(v[i]==l[p][j]){
                    ans=true;
                    p=v[i];
                    break;
                }
            }
            if(!ans) break;
        }
        if(ans) sum++;
    }while(next_permutation(v.begin(),v.end()));

    cout << sum << endl;

    return 0;
}

Compiler output:
a.cc:46:2: error: unterminated argument list invoking macro "rep"
   46 | }
      |  ^
a.cc: In function 'int main()':
a.cc:31:13: error: 'rep' was not declared in this scope
   31 |             rep(j,l[p].size(){
      |             ^~~
a.cc:31:16: error: expected '}' at end of input
   31 |             rep(j,l[p].size(){
      |                ^
a.cc:29:20: note: to match this '{'
   29 |         rep2(i,1,n){
      |                    ^
a.cc:31:16: error: expected '}' at end of input
   31 |             rep(j,l[p].size(){
      |                ^
a.cc:26:7: note: to match this '{'
   26 |     do{
      |       ^
a.cc:31:16: error: expected 'while' at end of input
   31 |             rep(j,l[p].size(){
      |                ^
a.cc:31:16: error: expected '(' at end of input
   31 |             rep(j,l[p].size(){
      |                ^
      |                (
a.cc:31:16: error: expected primary-expression at end of input
a.cc:31:16: error: expected ')' at end of input
   31 |             rep(j,l[p].size(){
      |                ^
      |                )
a.cc:31:16: error: expected ';' at end of input
   31 |             rep(j,l[p].size(){
      |                ^
      |                ;
a.cc:31:16: error: expected '}' at end of input
a.cc:10:11: note: to match this '{'
   10 | int main(){
      |           ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
int main(){
  int N,M; cin>>N>>M;
  vector<vector<bool>>C(N,vector<bool>(N,false));
  for(int i=0;i<M;i++){
    int a,b; cin>>a>>b;
    C[a][b]=true;
    C[b][a]=true;
  }
  int count=1;
  for(int i=1;i<N;i++)count*=i;
  int ans=0;
  vector<int>B(N);
  for(int i=0;i<count;i++){
    for(int j=1;j<N;j++){
      if(!B[j][j-1])break;
      if(j==N-1)ans++;
    }
    next_permutation(B.begin(),B.end());
  }
  cout<<ans<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:17:15: error: invalid types '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type {aka int}[int]' for array subscript
   17 |       if(!B[j][j-1])break;
      |               ^
Language: C++

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

bool graph[8][8];

int dfs(int t, int N, bool visited) {
  bool all_visited = true;
  
  for(int i = 0; i < N; i++) {
    if(visited[i] == false) {
      all_visited = false;
    }
  }
  if(all _visited) {
    return 1;
  }
  
  int ret = 0;
  
  for(int i = 0; i < N; i++) {
    if(graph[t][i] == false) {
      continue;
    }
    if(visited[i]) {
      continue;
    }
    
    visited[i] = true;
    ret += dfs(i, N, visited);
    visited[i] = false;
  }
  return ret;
}

int main() {
  int N, M;
  cin >> N >> M;
  for(int i = 0; i < N; i++) {
    int a, b;
    cin >> a >> b;
    graph[a-1][b-1] = graph[b-1][a-1] = true;
  }
  
  bool visited[8];
  for(int i = 0; i < N; i++) {
    visited[i] = false;
  }
  
  visited[0] = true;
  cout << dfs(0, N, visited) << endl;
  return 0;
}

Compiler output:
a.cc: In function 'int dfs(int, int, bool)':
a.cc:10:15: error: invalid types 'bool[int]' for array subscript
   10 |     if(visited[i] == false) {
      |               ^
a.cc:14:6: error: 'all' was not declared in this scope; did you mean 'std::filesystem::perms::all'?
   14 |   if(all _visited) {
      |      ^~~
      |      std::filesystem::perms::all
In file included from /usr/include/c++/14/filesystem:51,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:200,
                 from a.cc:1:
/usr/include/c++/14/bits/fs_fwd.h:158:7: note: 'std::filesystem::perms::all' declared here
  158 |       all               =  0777,
      |       ^~~
a.cc:14:9: error: expected ')' before '_visited'
   14 |   if(all _visited) {
      |     ~   ^~~~~~~~~
      |         )
a.cc:24:15: error: invalid types 'bool[int]' for array subscript
   24 |     if(visited[i]) {
      |               ^
a.cc:28:12: error: invalid types 'bool[int]' for array subscript
   28 |     visited[i] = true;
      |            ^
a.cc:30:12: error: invalid types 'bool[int]' for array subscript
   30 |     visited[i] = false;
      |            ^
Language: C++

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

bool graph[8][8];

int dfs(int t, int N, bool visited) {
  bool all_visited = true;
  
  for(int i = 0; i < N; i++) {
    if(visited[i] == false) {
      all_visited = false;
    }
  }
  if(all _visited) {
    return 1;
  }
  
  int ret = 0;
  
  for(int i = 0; i < N; i++) {
    if(graph[t][i] == false) {
      continue;
    }
    if(visited[i]) {
      continue;
    }
    
    visited[i] = true;
    ret += dfs(i, N, visited);
    visited[i] = false;
  }
  return ret;
}

int main() {
  int N, M;
  cin >> N >> M;
  for(int i = 0; i < N; i++) {
    int a, b;
    cin >> a >> b;
    graph[a-1][b-1] = graph[b-1][a-1] = true;
  }
  
  bool visited[8];
  for(int i = 0; i < N; i++) {
    visited[i] = false;
  }
  
  visited[0] = true;
  cout << dfs(0, N, visited) << endl;
}

Compiler output:
a.cc: In function 'int dfs(int, int, bool)':
a.cc:10:15: error: invalid types 'bool[int]' for array subscript
   10 |     if(visited[i] == false) {
      |               ^
a.cc:14:6: error: 'all' was not declared in this scope; did you mean 'std::filesystem::perms::all'?
   14 |   if(all _visited) {
      |      ^~~
      |      std::filesystem::perms::all
In file included from /usr/include/c++/14/filesystem:51,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:200,
                 from a.cc:1:
/usr/include/c++/14/bits/fs_fwd.h:158:7: note: 'std::filesystem::perms::all' declared here
  158 |       all               =  0777,
      |       ^~~
a.cc:14:9: error: expected ')' before '_visited'
   14 |   if(all _visited) {
      |     ~   ^~~~~~~~~
      |         )
a.cc:24:15: error: invalid types 'bool[int]' for array subscript
   24 |     if(visited[i]) {
      |               ^
a.cc:28:12: error: invalid types 'bool[int]' for array subscript
   28 |     visited[i] = true;
      |            ^
a.cc:30:12: error: invalid types 'bool[int]' for array subscript
   30 |     visited[i] = false;
      |            ^
Language: C++

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

bool graph[8][8];

int dfs(int t, int N, bool visited) {
  bool all_visited = true;
  
  for(int i = 0; i < N; i++) {
    if(visited[i] == false) {
      all_visited = false;
    }
  }
  if(all _visited) {
    return 1;
  }
  
  int ret = 0;
  
  for(int i = 0; i < N; i++) {
    if(graph[t][i] == false) {
      continue;
    }
    if(visited[i]) {
      continue;
    }
    
    visited[i] = true;
    ret += dfs(t, N, visited);
    visited[i] = false;
  }
  return ret;
}

int main() {
  int N, M;
  cin >> N >> M;
  for(int i = 0; i < N; i++) {
    int a, b;
    cin >> a >> b;
    graph[a-1][b-1] = graph[b-1][a-1] = true;
  }
  
  bool visited[8];
  for(int i = 0; i < N; i++) {
    visited[i] = false;
  }
  
  visited[0] = true;
  cout << dfs(0, N, visited) << endl;
}

Compiler output:
a.cc: In function 'int dfs(int, int, bool)':
a.cc:10:15: error: invalid types 'bool[int]' for array subscript
   10 |     if(visited[i] == false) {
      |               ^
a.cc:14:6: error: 'all' was not declared in this scope; did you mean 'std::filesystem::perms::all'?
   14 |   if(all _visited) {
      |      ^~~
      |      std::filesystem::perms::all
In file included from /usr/include/c++/14/filesystem:51,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:200,
                 from a.cc:1:
/usr/include/c++/14/bits/fs_fwd.h:158:7: note: 'std::filesystem::perms::all' declared here
  158 |       all               =  0777,
      |       ^~~
a.cc:14:9: error: expected ')' before '_visited'
   14 |   if(all _visited) {
      |     ~   ^~~~~~~~~
      |         )
a.cc:24:15: error: invalid types 'bool[int]' for array subscript
   24 |     if(visited[i]) {
      |               ^
a.cc:28:12: error: invalid types 'bool[int]' for array subscript
   28 |     visited[i] = true;
      |            ^
a.cc:30:12: error: invalid types 'bool[int]' for array subscript
   30 |     visited[i] = false;
      |            ^
Language: C++

#include "pch.h"
#include <bits/stdc++.h>

using namespace std;

int n;
int counter;

void dfs(vector<vector<int>> &G, int s, int depth, vector<bool> &seen) {
	if (depth == n) {

		counter++;
		return;
	}

	for (int i = 0; i < G[s].size(); i++) {
		if (seen[G[s][i]] == true) {
			continue;
		}
		seen[G[s][i]] = true;
		dfs(G, G[s][i], depth+1, seen);
		seen[G[s][i]] = false;

	}

}

int main() {
	int m;
	cin >> n >> m;
	counter = 0;
	vector < vector<int>> G(n + 1);

	//グラフ隣接リスト読み込み
	int a, b;
	for (int i = 1; i <= m; i++) {
		cin >> a >> b;
		G[a].push_back(b);
		G[b].push_back(a);
	}

	int depth = 1;
	vector<bool> seen(n + 1, false);
//	for (int i = 1; i <= n; i++) {
	int i = 1;
//	if (seen[i]) { continue; }
		seen[i] = true;
		dfs(G, i, depth, seen);
//	}

	cout << counter << endl;
	return 0;

}

Compiler output:
a.cc:1:10: fatal error: pch.h: No such file or directory
    1 | #include "pch.h"
      |          ^~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
const int nmax = 8;
bool graph[nmax][nmax];

int dfs(int v, int n, bool visited[nmax]){
    bool all_visited = true;

    for(int i = 0; i < n; i++){
        if(visited[i] == false){
            all_visited = false;
        }
    }

    if(all_visited){
        return 1;
    }

    int ret = 0;

    for(int i = 0; i < n; i++){
        if(graph[v][i] == false) continue;
        if(visited[i]) continue;

        visited[i] = true;
        ret += dfs(i, n, visited);
        visited[i] = false;
    }

    return ret;
}

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

    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        graph[a - 1][b - 1] = graph[b - 1][a - 1] = true;
    }

    bool visited[nmax];

    for(int i = 0; i < n; i++){
        visited[i] = false;
    }

    visited[0] = true;

    cout << dfs(0, n, nmax) << endl;
    
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:54:23: error: invalid conversion from 'int' to 'bool*' [-fpermissive]
   54 |     cout << dfs(0, n, nmax) << endl;
      |                       ^~~~
      |                       |
      |                       int
a.cc:9:28: note:   initializing argument 3 of 'int dfs(int, int, bool*)'
    9 | int dfs(int v, int n, bool visited[nmax]){
      |                       ~~~~~^~~~~~~~~~~~~
Language: C++


// delete when proceedig next 
#define EXE
#ifdef EXE
// -------------------------------------------------------
#include <iostream>
#include <string>
#include <stdio.h>
#include <cassert>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

int result_num = 0;

int N = 3;
int M = 3;
// pair<int, int> ab0(1, 2);
vector<pair<int, int>>  ab_map{ make_pair(1,2), make_pair(1,3), make_pair(2,3) };

// string s;



//vector<pair<int, int>> find_reverse(multimap<int, int> map, int i) {
vector<pair<int, int>> find_reverse(vector<pair<int, int>> map, int i) {
	vector<pair<int, int>> out_vec;
	int index = 0;
	for (auto m : map) {
		if (m.second == i) {
			out_vec.push_back(make_pair(index, m.first));
		}
		index++;
	}
	return out_vec;
}

vector<pair<int, int>> find(vector<pair<int, int>> map, int i) {
	vector<pair<int, int>> out_vec;
	int index = 0;
	for (auto m : map) {
		if (m.first == i) {
			out_vec.push_back(make_pair(index, m.second));
		}
		index++;
	}
	return out_vec;
}

void a(const int i, vector<bool> foot_print, bool reverse) {
	foot_print[i] = true;
	// for (auto ab : ab_map) {
	int dist = 0;
	if (reverse) {
		dist = ab_map[i].first;
	}
	else {
		dist = ab_map[i].second;
	}
	if (all_of(foot_print.begin(), foot_print.end(), [](int x) { return x; })) {
		result_num++;
		return;
	}
	auto found_vec = find(ab_map, dist);
	for (auto vec : found_vec) {
		if (foot_print[vec.first] == true) continue;
		a(vec.first, foot_print, false /*reverse*/);
	}
	auto found_reverse_vec = find_reverse(ab_map, dist);
	for (auto vec : found_reverse_vec) {
		if (foot_print[vec.first] == true) continue;
		a(vec.first, foot_print, true /*reverse*/);
	}
	// }
}

int main() {
#ifdef DEBUG

#else
	cin >> sx >> sy >> tx >> ty;
#endif
	vector<bool> foot_print(ab_map.size(), false);
	int index = 0;
	for (auto ab : ab_map) {
		if (ab.first != 1)continue;
		a(index, foot_print, false /*reverse*/);
		index++;

	}
	std::cout << result_num << endl;

#ifdef DEBUG
	int z;
	cin >> z;
#endif
	return 0;
}


// -------------------------------------------------------
#endif

Compiler output:
a.cc: In function 'int main()':
a.cc:82:16: error: 'sx' was not declared in this scope
   82 |         cin >> sx >> sy >> tx >> ty;
      |                ^~
a.cc:82:22: error: 'sy' was not declared in this scope
   82 |         cin >> sx >> sy >> tx >> ty;
      |                      ^~
a.cc:82:28: error: 'tx' was not declared in this scope; did you mean 'tm'?
   82 |         cin >> sx >> sy >> tx >> ty;
      |                            ^~
      |                            tm
a.cc:82:34: error: 'ty' was not declared in this scope; did you mean 'tm'?
   82 |         cin >> sx >> sy >> tx >> ty;
      |                                  ^~
      |                                  tm
Language: C++

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

map<int,vector<int>> P;
set<string> RT;
vector<bool> ans;
int count=0;
void prog(int a,vector<bool>T){
    T.at(a-1)=true;
    if(T==ans){
        count++;
        return;
    }
    for(int i:P.at(a)){
        if(T.at(i-1))continue;
      prog(i,T);
    }
}

int main (){
    int N,M;
    cin >> N >> M;
    for(int i=0;i<M;i++){
        int j,k;
        cin >> j >> k;
        P[j].push_back(k);
        P[k].push_back(j);
    }
    
    
    ans=vector<bool>(N,true);
    
    prog(1,vector<bool>(N,false));
    
    
    cout << count << endl;
    
}


Compiler output:
a.cc: In function 'void prog(int, std::vector<bool>)':
a.cc:11:9: error: reference to 'count' is ambiguous
   11 |         count++;
      |         ^~~~~
In file included from /usr/include/c++/14/algorithm:86,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/pstl/glue_algorithm_defs.h:101:1: note: candidates are: 'template<class _ExecutionPolicy, class _ForwardIterator, class _Tp> __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, typename std::iterator_traits<_II>::difference_type> std::count(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&)'
  101 | count(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value);
      | ^~~~~
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:4025:5: note:                 'template<class _IIter, class _Tp> typename std::iterator_traits< <template-parameter-1-1> >::difference_type std::count(_IIter, _IIter, const _Tp&)'
 4025 |     count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
      |     ^~~~~
a.cc:7:5: note:                 'int count'
    7 | int count=0;
      |     ^~~~~
a.cc: In function 'int main()':
a.cc:36:13: error: reference to 'count' is ambiguous
   36 |     cout << count << endl;
      |             ^~~~~
/usr/include/c++/14/pstl/glue_algorithm_defs.h:101:1: note: candidates are: 'template<class _ExecutionPolicy, class _ForwardIterator, class _Tp> __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, typename std::iterator_traits<_II>::difference_type> std::count(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&)'
  101 | count(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value);
      | ^~~~~
/usr/include/c++/14/bits/stl_algo.h:4025:5: note:                 'template<class _IIter, class _Tp> typename std::iterator_traits< <template-parameter-1-1> >::difference_type std::count(_IIter, _IIter, const _Tp&)'
 4025 |     count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
      |     ^~~~~
a.cc:7:5: note:                 'int count'
    7 | int count=0;
      |     ^~~~~
Language: C++

#include <iostream>

using namespace std;

bool graph[8][8] = {false};

int dfs(int iterate, bool * visited, int n, int m)	{
  bool all_visited = true;
  for (int i = 0; i < n; i++)	{
    if (visited[i] == false)	
      all_visited = false;
  }
  if (all_visited)
    return 1;
  int rval = 0;
  for (int i = 0; i < n; i++)	{
    if (graph[v][i] == false)	{
      continue;
    }
    if (visited[i] == true)	{
      continue;
    }
    visited[i] = true;
    ret += dfs(i, visited, n, m);
  }
  return ret;
}

int main()	{
  int n, m;
  cin >> n >> m;
  int a, b;
  for (int i = 0; i < m; i++)	{
    cin >> a >> b;
    graph[a - 1][b - 1] = graph[b - 1][a - 1] = true;
  }
  bool visited[n] = {false};
  visited[0] = true;
  cout << dfs(0, visited, n, m) << endl;
  return 0;
}

Compiler output:
a.cc: In function 'int dfs(int, bool*, int, int)':
a.cc:17:15: error: 'v' was not declared in this scope
   17 |     if (graph[v][i] == false)   {
      |               ^
a.cc:24:5: error: 'ret' was not declared in this scope
   24 |     ret += dfs(i, visited, n, m);
      |     ^~~
a.cc:26:10: error: 'ret' was not declared in this scope
   26 |   return ret;
      |          ^~~
Language: Java

import java.util.*;
public class Main {
  
	public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
      
      	List<Integer> list = new ArrayList<>(); 
      	// 全部1つのListに入れちゃう
      	for(int i = 0 ; i < 2 * M - 1; i++) {
            list.add(sc.nextInt());
        }
 
      	// 「自分と繋がってる点」リストを点の種類分つくって1つのリストにまとめるよ
      　List<connectingNumsList> connectingNumsListList = new ArrayList<>();
      	for(int i = 0; i < N ; i++) {
          	String currentNumString = String.valueOf(i);
          	String connectingNumsList = currentNumString.concat("List");
          	List<Integer> connectingNumsList = 
            
        }
		
    	  
    }
}

Compiler output:
Main.java:17: error: illegal character: '\u3000'
      ?List<connectingNumsList> connectingNumsListList = new ArrayList<>();
      ^
Main.java:23: error: illegal start of expression
        }
        ^
2 errors
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }    //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }     //最小公倍数
using Graph = vector<vector<ll>>;
ll inf=300000000000000000;
const double PI = 3.14159265358979323846;
int main(){
  int n,m;
  cin >> n >> m;
  vectro<vector<int>> k(n,vector<int>(n,-1));
  rep(i,m){
    int a,b;
    cin >> a >> b;
    a--;
    b--;
    k[a][b]=1;
    k[b][a]=1;
  }
  int u[n-1];
  int ans=0;
  rep(i,n-1)u[i]=1+i;
  do{
    if(k[0][u[0]]==-1)continue;
    int y=0;
    rep(i,n-2)if(k[u[i]][u[i+1]]==-1)y++;
    if(y==0)ans++;
  }while(next_permutation(u,u+n-1));
  cout << ans << endl;
}   


Compiler output:
a.cc: In function 'int main()':
a.cc:13:3: error: 'vectro' was not declared in this scope
   13 |   vectro<vector<int>> k(n,vector<int>(n,-1));
      |   ^~~~~~
a.cc:13:20: error: expected primary-expression before '>' token
   13 |   vectro<vector<int>> k(n,vector<int>(n,-1));
      |                    ^~
a.cc:13:23: error: 'k' was not declared in this scope
   13 |   vectro<vector<int>> k(n,vector<int>(n,-1));
      |                       ^
Language: C++

#include <iostream>
#include <vector>
#include <algorithm>  // next_permutation(順列)
#include <numeric>
using namespace std;

bool G[10][10];   // グラフを隣接行列で管理

int main() {
  int N, M;
  cin >> N >> M;
  for ( int i = 0; i < M; i++ ) {
    int a, b;
    cint >> a >> b;
    G[a-1][b-1] == G[b-1][a-1] = true;
  }
  
  // 順列
  vector<int> ord(N);
  for ( int i = 0; i < N; i++ ) ord[i] = i;
  
  int ans = 0;
  do {
    if ( ord[0] != 0 ) break;   //始点は1である必要あり
    
    bool ok = true;
    for ( int i = 0; i + 1 < N; i++ ) {
      int from = ord[i];
      int to = ord[i+1];
      if ( !G[from][to] ) ok = false;
    }
    if ( ok ) ans++;
  } while ( next_permutation(ord.begin(), ord.end()) );   //next_permutationを利用するには昇順に並び替えておく必要あり

  cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:14:5: error: 'cint' was not declared in this scope; did you mean 'uint'?
   14 |     cint >> a >> b;
      |     ^~~~
      |     uint
a.cc:15:17: error: lvalue required as left operand of assignment
   15 |     G[a-1][b-1] == G[b-1][a-1] = true;
      |     ~~~~~~~~~~~~^~~~~~~~~~~~~~
Language: C++

#include<bits/stdc++.h>
#define ll long long 
#define P pair<int,int>
#define PP pair<P,int>
using namespace std;


int n, m, sum;
vector<vector<int>> g(10);

int dfs(vector<int>v, int x, sum){
    if(v.size() == n)return sum;


    for(auto i:g[x]){
        bool had = false;
        for(auto j:v){
            if(i == j) had = true;
        }
        if(had) continue;
        vector<int>u = v;
        u.push_back(i);
        return dfs(u ,i, );
    }
    return 0;
}

int main(){

}

Compiler output:
a.cc:11:30: error: 'sum' is not a type
   11 | int dfs(vector<int>v, int x, sum){
      |                              ^~~
a.cc: In function 'int dfs(std::vector<int>, int, int)':
a.cc:23:26: error: expected primary-expression before ')' token
   23 |         return dfs(u ,i, );
      |                          ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
void OnestrokePath(int n,vector<vector<int>> &ABC,vector<bool> &ok,int &ans) {
    bool ok2 = true;
    for(int i = 0; i < ok.size(); i++) {
        if(ok[i] == false && i != n) {
            ok2 = false;
        }
    }
    if(ok2) {
        ans++;
        return;
    }
    ok[n] = true;
    for(int i = 0; i < ABC[n].size(); i++) {
        if(ABC[n][i] == true) {
            continue;
        }
        OnestrokePath(ABC[n][i],ABC,ok);
    }
    ok[n] = false;
    return;
}
int main() {
    int N,M;
    cin >> N >> M;
    vector<vector<int>>ABC(N);
    vector<bool>ok(N,false);
    for(int i = 0; i < M; i++) {
        int a,b;
        cin >> a >> b;
        a--;
        b--;
        ABC[a].push_back(b);
        ABC[b].push_back(a);
    }
    int ans = 0;
    OnestrokePath(0,ABC,ok,ans);
    cout << ans << endl;
}


Compiler output:
a.cc: In function 'void OnestrokePath(int, std::vector<std::vector<int> >&, std::vector<bool>&, int&)':
a.cc:19:22: error: too few arguments to function 'void OnestrokePath(int, std::vector<std::vector<int> >&, std::vector<bool>&, int&)'
   19 |         OnestrokePath(ABC[n][i],ABC,ok);
      |         ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
a.cc:3:6: note: declared here
    3 | void OnestrokePath(int n,vector<vector<int>> &ABC,vector<bool> &ok,int &ans) {
      |      ^~~~~~~~~~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
int ans = 0;
void OnestrokePath(int n,vector<vector<int>> &ABC,vector<bool> &ok) {
    bool ok2 = true;
    for(int i = 0; i < ok.size(); i++) {
        if(ok[i] == false && i != n) {
            ok2 = false;
        }
    }
    if(ok2) {
        ans+;
        return;
    }
    ok[n] = true;
    for(int i = 0; i < ABC[n].size(); i++) {
        if(ABC[n][i] == true) {
            continue;
        }
        OnestrokePath(ABC[n][i],ABC,ok);
    }
    return;
}
int main() {
    int N,M;
    cin >> N >> M;
    vector<vector<int>>AB(N);
    vector<bool>flag(N,false);
    for(int i = 0; i < N; i++) {
        int a,b;
        cin >> a >> b;
        a--;
        b--;
        AB[a].push_back(b);
        AB[b].push_back(a);
    }
    OnestrokePath(0,AB,flag);
    cout << ans << endl;
}


Compiler output:
a.cc: In function 'void OnestrokePath(int, std::vector<std::vector<int> >&, std::vector<bool>&)':
a.cc:12:13: error: expected primary-expression before ';' token
   12 |         ans+;
      |             ^
Language: C++

#include<bits/ctdc++.h>
using namespace std;
int main(){
  int n,m;
  cin >> n >> m;
  vector<vector<bool>> graph(n,vector<bool> (n,false));
  for(int i = 0; i < m ; ++i){
    int a,b;
    cin >> a>>b;
    graph[a-1][b-1] = graph[b-1][a-1] = true;
  }
  vector<int> v(n);
  for( int i = 0; i<n; ++i) v[i] = i;
  int ans = 0;
  do{
    bool ok = true;
    for( int i = 1;i < n;++i) if(graph[v[i-1]][v[i]] == false) ok = false;
    if(ok) ans++;
    } while ( next_permutation(++v.begin(),v.end()));
  cout << ans << endl;
}

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

#include<bits/stdc++.h>
using namespace std;
const int nmax = 8;
bool graph[nmax][nmax];
 
int dfs(int v; int N; bool visited[nmax]){
  bool all_visited = true;
  for(int i = 0; i < N;++i) if(!visited[i]) all_visited=false;
  if(all_visited) return 1;  
  int ret = 0;
  for(int i=0;i<N;++i){
    if(!graph[v][i] || visited[i]) continue;
    visited[i] = true;
    ret+= dfs(i,N,visited);
    visited[i] = false;
  }
  return ret;
}
 
int main(){
  int N, M;
  cin >> N >> M;
  for(int i = 0; i < M ; ++i){
    int a,b;
    cin >> a >> b;
    graph[a-1][b-1] = graph[b-1][a-1] = true;
  }
  bool visited[nmax];
  for(int i = 0; i < N ; ++i) visited[i] = false;
  visited[0] = true;
  cout << dfs(0,N,visited) << endl;
}

Compiler output:
a.cc:6:14: error: expected ')' before ';' token
    6 | int dfs(int v; int N; bool visited[nmax]){
      |        ~     ^
      |              )
a.cc:6:41: error: expected initializer before ')' token
    6 | int dfs(int v; int N; bool visited[nmax]){
      |                                         ^
a.cc: In function 'int main()':
a.cc:31:14: error: too many arguments to function 'int dfs(int)'
   31 |   cout << dfs(0,N,visited) << endl;
      |           ~~~^~~~~~~~~~~~~
a.cc:6:5: note: declared here
    6 | int dfs(int v; int N; bool visited[nmax]){
      |     ^~~