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

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 70000

using namespace std;
static const int INFTY = 1000;

int n, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/cc6590ff.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
a.cc:(.text+0xbb): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
a.cc:(.text+0x163): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
a.cc:(.text+0x22f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
a.cc:(.text+0x24d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc6590ff.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 80000

using namespace std;
static const int INFTY = 1000;

int n, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/cc4CTopm.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
a.cc:(.text+0xbb): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
a.cc:(.text+0x163): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
a.cc:(.text+0x22f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
a.cc:(.text+0x24d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc4CTopm.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 90000

using namespace std;
static const int INFTY = 1000;

int n, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/cc5CHQfy.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
a.cc:(.text+0xbb): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
a.cc:(.text+0x163): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
a.cc:(.text+0x22f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
a.cc:(.text+0x24d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc5CHQfy.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <vector>
#include <queue>
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000
using namespace std;

int n;
int M[N][N];
int color[N];

void bfs(int s1, int s2){
    queue<int> q1,q2;
    q1.push(s1);
    q2.push(s2);
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        u1=q1.front(); q1.pop();
        for(int v = 0; v < n; v++){
            if(M[u1][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = BLACK;
            q1.push(v);
        }
        u2=q2.front(); q2.pop();
        for(int v = 0; v < n; v++){
            if(M[u2][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = WHITE;
            q2.push(v);
        }
    }
    if(!q1.empty()) cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
}
int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }
    bfs(0,n-1);
    return 0;
}

Compiler output:
/tmp/ccZMScZF.o: in function `bfs(int, int)':
a.cc:(.text+0x7b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
a.cc:(.text+0x97): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
a.cc:(.text+0xb5): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
a.cc:(.text+0x132): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
a.cc:(.text+0x150): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
a.cc:(.text+0x20d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
a.cc:(.text+0x22b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZMScZF.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <vector>
#include <queue>
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000
using namespace std;

int n;
int M[N][N];
int color[N];

void bfs(int s1, int s2){
    queue<int> q1,q2;
    q1.push(s1);
    q2.push(s2);
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        u1=q1.front(); q1.pop();
        for(int v = 0; v < n; v++){
            if(M[u1][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = BLACK;
            q1.push(v);
        }
        u2=q2.front(); q2.pop();
        for(int v = 0; v < n; v++){
            if(M[u2][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = WHITE;
            q2.push(v);
        }
    }
    if(!q1.empty()) cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
}
int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }
    bfs(0,n-1);
    return 0;
}

Compiler output:
/tmp/ccjxOhm6.o: in function `bfs(int, int)':
a.cc:(.text+0x7b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
a.cc:(.text+0x97): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
a.cc:(.text+0xb5): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
a.cc:(.text+0x132): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
a.cc:(.text+0x150): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
a.cc:(.text+0x20d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
a.cc:(.text+0x22b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjxOhm6.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <vector>
#include <queue>
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000
using namespace std;

int n;
int M[N][N];
int color[N];

void bfs(int s1, int s2){
    queue<int> q1,q2;q1.push(s1);q2.push(s2);for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        u1=q1.front(); q1.pop();
        for(int v = 0; v < n; v++){
            if(M[u1][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = BLACK;
            q1.push(v);
        }
        u2=q2.front(); q2.pop();
        for(int v = 0; v < n; v++){
            if(M[u2][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = WHITE;
            q2.push(v);
        }
    }
    if(!q1.empty()) cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
}
int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }
    bfs(0,n-1);
    return 0;
}

Compiler output:
/tmp/ccjzx3sl.o: in function `bfs(int, int)':
a.cc:(.text+0x7b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
a.cc:(.text+0x97): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
a.cc:(.text+0xb5): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
a.cc:(.text+0x132): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
a.cc:(.text+0x150): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
a.cc:(.text+0x20d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
a.cc:(.text+0x22b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccjzx3sl.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <vector>
#include <queue>
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000
using namespace std;

int n;
int M[N][N];
int color[N];

void bfs(int s1, int s2){
    queue<int> q1,q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        // cout<<"Fennec's Turn"<<endl;
        u1=q1.front(); q1.pop();
        for(int v = 0; v < n; v++){
            if(M[u1][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = BLACK;
            // cout<<"proceed"<<v<<endl;
            q1.push(v);
        }
        u2=q2.front(); q2.pop();
        // cout<<"Snuke's Turn"<<endl;
        for(int v = 0; v < n; v++){
            if(M[u2][v]==0) continue;
            if(color[v]!=NOCOLOR) continue;
            color[v] = WHITE;
            // cout<<"proceed"<<v<<endl;
            q2.push(v);
        }
    }
    if(!q1.empty()) cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
}
int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }
    bfs(0,n-1);
    return 0;
}

Compiler output:
/tmp/ccNgF4MF.o: in function `bfs(int, int)':
a.cc:(.text+0x7b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
a.cc:(.text+0x97): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
a.cc:(.text+0xb5): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
a.cc:(.text+0x132): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
a.cc:(.text+0x150): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
a.cc:(.text+0x20d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
a.cc:(.text+0x22b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccNgF4MF.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int M[N][N] = {};
int color[N] = {};

void bfs(int n, int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(n,0,n-1,0);
    return 0;
}

Compiler output:
/tmp/ccx5ay0n.o: in function `bfs(int, int, int, int)':
a.cc:(.text+0x87): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
a.cc:(.text+0xa3): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
a.cc:(.text+0xc1): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
a.cc:(.text+0x14b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
a.cc:(.text+0x169): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
a.cc:(.text+0x233): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
a.cc:(.text+0x251): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccx5ay0n.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int n=0;
int M[N][N]={};
int color[N]={};

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/ccQqsmcz.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
a.cc:(.text+0xbb): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
a.cc:(.text+0x163): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
a.cc:(.text+0x22f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
a.cc:(.text+0x24d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQqsmcz.o
collect2: error: ld returned 1 exit status
Language: C++

//前向星+SPFA
/*
edeg[]: 邻接表
dis[]: 最短路数组
vis[]: 出入队标记数组
cnt[]: 入队次数统计
head[u]:表示起点为u的最后一条边的标号，如果是-1表示没有以u为起点的边
init::初始化边
add::(u起点, v终点, w权值)
spfa::(s起点，n点数)[-1存在负环，反之为到点n最短路权值]

*/
#include<iostream>
#include<queue>
#include<algorithm>
#define N 100005
#define INF 0x3f3f3f3f
using namespace std;
struct Edge
{
	int to;
	int next;//表示和该边有共同起点的上一条边的标号
	int val;
}edge[300000];
int tot;
int head[N];
int dis1[N];
int dis2[N];
int vis[N];
int cnt[N];
void init()
{
	tot=0;
	for(int i=0;i<N;i++)
	head[i]=-1;
	memset(vis,0,sizeof(vis));
	memset(cnt,0,sizeof(cnt));
	
}
void add(int u,int v,int w)
{
	edge[tot].to=v;
	edge[tot].val=w;
	edge[tot].next=head[u];
	head[u]=tot++;
}
int spfa1(int s,int n)
{
	queue<int> q;
	for(int i=1;i<=n;i++)
	{
		vis[i]=0;
		cnt[i]=0;
		dis1[i]=INF;
	}
	cnt[s]=1;
	vis[s]=1;
	dis1[s]=0;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=head[u];i!=-1;i=edge[i].next)
		{
			int v=edge[i].to;
			int w=edge[i].val=w;
			if(dis1[u]+w<dis1[v])
			{
				dis1[v]=dis1[u]+w;
				if(!vis[v])
				{
					vis[v]=1;
					if(++cnt[v]>n) return -1;
					q.push(v);
				}
			}
		}
	}
	return dis1[n];//默认返回最后一个点最短距离，可更改
}
int spfa2(int s,int n)
{
	queue<int> q;
	for(int i=1;i<=n;i++)
	{
		vis[i]=0;
		cnt[i]=0;
		dis2[i]=INF;
	}
	cnt[s]=1;
	vis[s]=1;
	dis2[s]=0;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=head[u];i!=-1;i=edge[i].next)
		{
			int v=edge[i].to;
			int w=edge[i].val=w;
			if(dis2[u]+w<dis2[v])
			{
				dis2[v]=dis2[u]+w;
				if(!vis[v])
				{
					vis[v]=1;
					if(++cnt[v]>n) return -1;
					q.push(v);
				}
			}
		}
	}
	return dis2[n];//默认返回最后一个点最短距离，可更改
}
int n;
int main()
{
	init();
	cin>>n;
	for(int i=1;i<n;i++)
	{
		int a,b;
		cin>>a>>b;
		add(a,b,1);
		add(b,a,1);
	}

	spfa1(1,n);
	memset(vis,0,sizeof(vis));
	memset(cnt,0,sizeof(cnt));
	spfa2(n,n);
	int s=0;
	for(int i=1;i<=n;i++)
	if(dis1[i]<=dis2[i])
	s++;
	if((s-1)>(n-s))
	cout<<"Fennec"<<endl;
	else
	cout<<"Snuke"<<endl;
	return 0;
	
}




Compiler output:
a.cc: In function 'void init()':
a.cc:36:9: error: 'memset' was not declared in this scope
   36 |         memset(vis,0,sizeof(vis));
      |         ^~~~~~
a.cc:16:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   15 | #include<algorithm>
  +++ |+#include <cstring>
   16 | #define N 100005
a.cc: In function 'int main()':
a.cc:133:9: error: 'memset' was not declared in this scope
  133 |         memset(vis,0,sizeof(vis));
      |         ^~~~~~
a.cc:133:9: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int M[N][N];
int color[N];

void bfs(int n, int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b,n;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(n,0,n-1,0);
    return 0;
}

Compiler output:
/tmp/cczyPtE5.o: in function `bfs(int, int, int, int)':
a.cc:(.text+0x87): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
a.cc:(.text+0xa3): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
a.cc:(.text+0xc1): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
a.cc:(.text+0x14b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
a.cc:(.text+0x169): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
a.cc:(.text+0x233): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
a.cc:(.text+0x251): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cczyPtE5.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int n, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[n-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/ccUNn4SX.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
a.cc:(.text+0xbb): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
a.cc:(.text+0x163): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
a.cc:(.text+0x22f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
a.cc:(.text+0x24d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccUNn4SX.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int main(void){
    cin.sync_with_stdio(false);
    int a,b;
    int n=0, M[N][N];
    int color[N];
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        cin>>a>>b;
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }
    int s1=0,s2=n-1;
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[N-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }

    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:45:12: error: 'turn' was not declared in this scope
   45 |         if(turn==0){
      |            ^~~~
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int n=0, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[N-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    int a,b;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        scanf("%d %d", &a,&b);
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/ccP07S0Q.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
a.cc:(.text+0xa7): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
a.cc:(.text+0x12e): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
a.cc:(.text+0x14c): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
a.cc:(.text+0x218): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
a.cc:(.text+0x236): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccP07S0Q.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int n, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[N-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            // cout<<"Fennec's Turn"<<endl;
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                // cout<<"proceed"<<v<<endl;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            // cout<<"Snuke's Turn"<<endl;
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                // cout<<"proceed"<<v<<endl;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    int a,b;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }
    for(int i = 0; i < n-1; i++){
        int a,b;
        scanf("%d %d", &a,&b);
        a--; b--;
        M[a][b]=1;
        M[b][a]=1;
    }

    bfs(0,n-1,0);
    return 0;
}

Compiler output:
/tmp/ccpGigl4.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
a.cc:(.text+0xa7): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
a.cc:(.text+0x12e): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
a.cc:(.text+0x14c): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
a.cc:(.text+0x218): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
a.cc:(.text+0x236): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccpGigl4.o
collect2: error: ld returned 1 exit status
Language: C++

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>

//color
#define NOCOLOR 0
#define BLACK 1 //Fennec
#define WHITE 2 //Snuke
#define N 100000

using namespace std;
static const int INFTY = 1000;

int n, M[N][N];
int color[N];

void bfs(int s1, int s2, int turn){
    queue<int> q1;
    queue<int> q2;
    q1.push(s1); //init state(fennec)
    q2.push(s2); //init state(snuke)
    for(int i = 0; i < n; i++) color[i]=NOCOLOR;
    color[0]=BLACK;
    color[N-1]=WHITE;
    int u1,u2;
    while(!q1.empty() && !q2.empty()){
        if(turn==0){
            u1=q1.front(); q1.pop();
            for(int v = 0; v < n; v++){
                if(M[u1][v]==0) continue;
                if(color[v]==WHITE) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = BLACK;
                q1.push(v);
            }
            turn=1;//next snuke
        }else{
            u2=q2.front(); q2.pop();
            for(int v = 0; v < n; v++){
                if(M[u2][v]==0) continue;
                if(color[v]==BLACK) continue;
                if(color[v]!=NOCOLOR) continue;
                color[v] = WHITE;
                q2.push(v);
            }
            turn=0;//next fennec
        }
    }
    if(!q1.empty()){
        cout<<"Fennec"<<endl;
    }else{
        cout<<"Snuke"<<endl;
    }
}

int main(void){
    int a,b;
    cin>>n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            M[i][j] = 0;
        }
    }

    for(int i = 0; i < n; i++){
        cin>>a>>b;
        a--; b--;
        M[a][b] = 1;
    }

    bfs(0,N-1,0);
    return 0;
}

Compiler output:
/tmp/ccZcEfc1.o: in function `bfs(int, int, int)':
a.cc:(.text+0x81): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0xa7): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x12e): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x14d): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x16b): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x23a): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x259): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
a.cc:(.text+0x277): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccZcEfc1.o
collect2: error: ld returned 1 exit status
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define nmax 100000
#define ll long long
int n;
int a,b;
int s[nmax][nmax];
int d[nmax]={0};
ll Calc(int depth,int pl,int *f){
    ll re;
    int fs[nmax];
    for(int i=0;i<n;i++)
        fs[i]=f[i];
    if(fs[pl]!=0)
        return depth%2?1:-1;

    if(depth%2){ //maxCalc
        re=0;
        for(int i=0;i<d[pl];i++)
            re=max(re,Calc(depth+1,s[pl][i],fs));
    }
    else{ //minCalc
        re=LLONG_MAX;
        for(int i=0;i<d[pl];i++)
            re=min(re,Calc(depth+1,s[pl][i],fs));
    }
}


int main(){
cin>>n;
int f[nmax]={0};
f[n-1]=1;
for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
        s[i][j]=0;
for(int i=0;i<n;i++){
    cin>>a>>b;
    a--;b--;
    s[a][d[a]++]=b;
    s[b][d[b]++]=a;
}
cout<<(Calc(0,0,f)==1?"Fennec":"Snuke")<<endl;;
return 0;
}

Compiler output:
a.cc: In function 'long long int Calc(int, int, int*)':
a.cc:27:1: warning: control reaches end of non-void function [-Wreturn-type]
   27 | }
      | ^
/tmp/ccCCuWUq.o: in function `Calc(int, int, int*)':
a.cc:(.text+0x12b): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/ccCCuWUq.o
a.cc:(.text+0x1cf): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/ccCCuWUq.o
/tmp/ccCCuWUq.o: in function `main':
a.cc:(.text+0x309): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/ccCCuWUq.o
a.cc:(.text+0x321): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/ccCCuWUq.o
a.cc:(.text+0x36a): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/ccCCuWUq.o
a.cc:(.text+0x382): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/ccCCuWUq.o
collect2: error: ld returned 1 exit status
Language: C

#include<stdio.h>
int main()
{
 int N;
 scanf("%d",&N);
 int st[N][N];
 int leng[N];//STの配列の長さcount
 for(int i=0;i<=N;i++){
  leng[i]=1;//初期化
}
 for(int i=0;i<=N;i++){
 int a,b;
 scanf("%d %d",&a,&b);
 st[a][leng[a]]=b;
 st[b][leng[b]]=a;
 leng[a]++;
 leng[b]++;
 }
 st[0][0]=1;//1=black
 st[N][0]=2;//2=white
 for(int i=0;i<=N-2;i++){
 int ch=check(1,N,st);
 if(ch==2){
 printf("Snuke");
 ch=check(2,N,st);
 }
 if(ch==2){
 printf("Fenneck");
 
 }

 }
}
int check(int x,int N,int st[][]){
 int flg;
 int now=-1;
 for(int i=0;i<=N;i++){
 if(st[i][0]==x){
 flg=1;
 now=i;
 
 for(int i=0;i<=N;i++){
 if(st[st[now][i+1]][0]==0){
 st[now][0]=1;
 return 1;//1=ok
 }
 st[now][0]=3;//3=dame
 }
 }
return 2;//2=no
}
 




Compiler output:
main.c: In function 'main':
main.c:22:9: error: implicit declaration of function 'check' [-Wimplicit-function-declaration]
   22 |  int ch=check(1,N,st);
      |         ^~~~~
main.c: At top level:
main.c:34:27: error: array type has incomplete element type 'int[]'
   34 | int check(int x,int N,int st[][]){
      |                           ^~
main.c:34:27: note: declaration of 'st' as multidimensional array must have bounds for all dimensions except the first
main.c: In function 'check':
main.c:51:1: error: expected declaration or statement at end of input
   51 | }
      | ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define nmax 100000
#define ll long long
int n;
int a,b;
int s[nmax][nmax];
int d[nmax]={0};
ll Calc(int depth,int pl,int *f){
    ll re;
    int fs[nmax];
    for(int i=0;i<n;i++)
        fs[i]=f[i]
    if(fs[pl]!=0)
        return depth%2?1:-1;

    if(depth%2){ //maxCalc
        re=0;
        for(int i=0;i<d[pl];i++)
            re=max(re,Calc(depth+1,s[pl][i],fs));
    }
    else{ //minCalc
        re=LLONG_MAX;
        for(int i=0;i<d[pl];i++)
            re=min(re,Calc(depth+1,s[pl][i],fs));
    }
}


int main(){
cin>>n;
int f[nmax]={0};
f[n-1]=1;
for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
        s[i][j]=0;
for(int i=0;i<n;i++){
    cin>>a>>b;
    a--;b--;
    s[a][d[a]++]=b;
    s[b][d[b]++]=a;
}
cout<<(Calc(0,0,f)==1?"Fennec":"Snuke")<<endl;;
return 0;
}

Compiler output:
a.cc: In function 'long long int Calc(int, int, int*)':
a.cc:13:19: error: expected ';' before 'if'
   13 |         fs[i]=f[i]
      |                   ^
      |                   ;
   14 |     if(fs[pl]!=0)
      |     ~~             
a.cc:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^
Language: C++

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

#define pb push_back

const int N = 1e5 + 5;

int n;
vector <int> G[N];
bool visited[N];
int dist1[N], dist2[N];
char color[N];

void dfs1(int x, int d) {
    if(x == n)
        return;

    visited[x] = 1;
    color[x] = 'B';
    dist1[x] = d;

    for(int y: G[x]) {
        if(!visited[y])
            dfs1(y, d + 1);
    }
}

void dfs2(int x, int d) {
    if(x == 1)
        return;

    if(dist1[x] <= dist2[x])
        return;

    visited[x] = 1;
    color[x] = 'W';
    dist2[x] = d;

    for(int y: G[x]) {
        if(!visited[y])
            dfs(y, d + 1);
    }
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n;

    for(int i = 1 ; i < n; i++)
    {
        int x, y;
        cin>>x>>y;
        G[x].pb(y);
        G[y].pb(x);
    }

    dfs1(1, 0);
    memset(visited, 0, sizeof(visited));
    dfs2(n, 0);

    int b = 0, w = 0;
    for(int i = 1; i <= n; i++)
    {
        if(color[i] == 'B')
            b++;
        else
            w++;
    }

    cout<<( b >= w ? "Fennec\n" : "Snuke\n");

    return 0;
}

Compiler output:
a.cc: In function 'void dfs2(int, int)':
a.cc:41:13: error: 'dfs' was not declared in this scope; did you mean 'ffs'?
   41 |             dfs(y, d + 1);
      |             ^~~
      |             ffs