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

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int map[10][10];
int que[100],num;
int main()
{
    int i,j,n,sum,maxx,step,astep,asum;
    while(scanf("%d",&n))
    {
        if(n==0) break;
        for(i=0;i<n;i++)
        {
            for(j=0;j<n;j++)
            {
                scanf("%d",&map[i][j]);
            }
        }
        asum=0; astep=0;
        if(3<=n){
             num=0; sum=0; maxx=-1;
            for(j=0;j<=i;j++)
            {
                que[num++]=map[0][j];
            }
            for(j=1;j<=i;j++)
            {
                que[num++]=map[j][i];
            }
            for(j=i-1;j>=0;j--)
            {
                que[num++]=map[i][j];
            }
            for(j=i-1;j>=0;j--)
            {
                que[num++]=map[j][0];
            }
            for(j=0;j<3*4;j++)
            printf("%d ",que[j]);
            puts("");
            for(j=0;j<i;j++)
            {
                sum=que[j]+que[j+i]+que[j+i*2]+que[j+i*3];
                if(maxx<sum){
                maxx=sum;
                step=j;
                }
            }
            asum+=maxx;
            astep+=step;
        }
        else if(5<=n)
        {

        }
        
        asum+=map[n/2][n/2];
        printf("%d %d\n",asum,astep);
    }

    return 0;
}

Compiler output:
main.c:1:9: fatal error: cstdio: No such file or directory
    1 | #include<cstdio>
      |         ^~~~~~~~
compilation terminated.
Language: C

//#include<iostream>
#include<stdio.>
//using namespace std;
int main()
{
    int i,j;
    for(i=1;i<10;i++)
    {
        for(j=1;j<10;j++)
            printf("%dx%d=%d\n",i,j,i*j);
    }
    return 0;
}

Compiler output:
main.c:2:9: fatal error: stdio.: No such file or directory
    2 | #include<stdio.>
      |         ^~~~~~~~
compilation terminated.
Language: C

#include<stdio.h>

int main(){
     int i, j;
    for(i =; i < 10; j++){
        printf("%2dl",i*j);
}
    return 0;
}

Compiler output:
main.c: In function 'main':
main.c:5:12: error: expected expression before ';' token
    5 |     for(i =; i < 10; j++){
      |            ^
Language: C

#include<stdio.h>
int main(void)
{
     int i, j;
    for(j =1; j< 10 j++){
         printf("%2d",i*j);
       }

    return 0;
}

Compiler output:
main.c: In function 'main':
main.c:5:20: error: expected ';' before 'j'
    5 |     for(j =1; j< 10 j++){
      |                    ^~
      |                    ;
Language: C

#include<stdio.h>
int main(void)
{
     int i, j;
    for(j =1; j< 10 j++){
         printf("%2dl",i*j);
       }

    return 0;
}

Compiler output:
main.c: In function 'main':
main.c:5:20: error: expected ';' before 'j'
    5 |     for(j =1; j< 10 j++){
      |                    ^~
      |                    ;
Language: C

#include<stdio.h>
int main(void)
{
     int i, j;
    for(j =1; j< 10 j++){
         printf("%2dl",i*j);
       }
printf("\n");
}
    return 0;
}

Compiler output:
main.c: In function 'main':
main.c:5:20: error: expected ';' before 'j'
    5 |     for(j =1; j< 10 j++){
      |                    ^~
      |                    ;
main.c: At top level:
main.c:10:5: error: expected identifier or '(' before 'return'
   10 |     return 0;
      |     ^~~~~~
main.c:11:1: error: expected identifier or '(' before '}' token
   11 | }
      | ^
Language: C

#include "StdAfx.h"
#include<iostream>
using namespace std;

int main()
{
	for(int m=1;m<=9;m++)
	{
		cout<<m<<"x"<<m<<"="<<m*m<<endl;
	}
	system("pause");
    return 0;
}

Compiler output:
main.c:1:10: fatal error: StdAfx.h: No such file or directory
    1 | #include "StdAfx.h"
      |          ^~~~~~~~~~
compilation terminated.
Language: C

include<stdio.h>
int main(){
int i,j;
for(i=1;i<=9;i++)
   for(i=1;i<=9;i++)
   printf("%dd=%d\n",i,j,i*j);
return 0;}

Compiler output:
main.c:1:8: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
    1 | include<stdio.h>
      |        ^
Language: C

#include"stdio.h"
int main(){
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
 printf("%dd=%d\n",i,j,i*j);
return 0;}

Compiler output:
main.c: In function 'main':
main.c:3:5: error: 'i' undeclared (first use in this function)
    3 | for(i=1;i<=9;i++)
      |     ^
main.c:3:5: note: each undeclared identifier is reported only once for each function it appears in
main.c:4:5: error: 'j' undeclared (first use in this function)
    4 | for(j=1;j<=9;j++)
      |     ^
Language: C

include"stdio.h"
int main(){
int i,j;
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
printf("%dd=%d\n",i,j,i*j);
return 0;
}

Compiler output:
main.c:1:8: error: expected '=', ',', ';', 'asm' or '__attribute__' before string constant
    1 | include"stdio.h"
      |        ^~~~~~~~~
Language: C

include"stdio.h"
int main(){
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
printf("%dd=%d\n"i,j,i*j);
return 0;

}

Compiler output:
main.c:1:8: error: expected '=', ',', ';', 'asm' or '__attribute__' before string constant
    1 | include"stdio.h"
      |        ^~~~~~~~~
Language: C

i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}

Compiler output:
main.c:1:1: warning: data definition has no type or storage class
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
      | ^
main.c:1:1: error: type defaults to 'int' in declaration of 'i' [-Wimplicit-int]
main.c:1:5: error: type defaults to 'int' in declaration of 't' [-Wimplicit-int]
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
      |     ^
main.c:1:7: error: return type defaults to 'int' [-Wimplicit-int]
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
      |       ^~~~
main.c: In function 'main':
main.c:1:25: error: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
      |                         ^~~~~~
main.c:1:1: note: include '<stdio.h>' or provide a declaration of 'printf'
  +++ |+#include <stdio.h>
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
main.c:1:25: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
      |                         ^~~~~~
main.c:1:25: note: include '<stdio.h>' or provide a declaration of 'printf'
main.c:1:60: error: expected ';' before 't'
    1 | i=9,t;main(){i<90&&main(printf("%dx%d=%d\n",i++/9,t,i/9*t))t=i%9+1;}
      |                                                            ^
      |                                                            ;
Language: C

#include<stdio.h>
#include<conio.h>
void main()
{int i,j;
{for(i=1;i<=9;i++)
 {for(j=1;j<=9;j++)
  {printf("%d * %d =%d ",i,j,i*j);
   printf("\n");
   }
   }
   getch();
   }}

Compiler output:
main.c:2:9: fatal error: conio.h: No such file or directory
    2 | #include<conio.h>
      |         ^~~~~~~~~
compilation terminated.
Language: C

#include<string.h>
#include<stdio.h>
char str[1200];
bool check(char *str) {
	int len = strlen(str);
	if (len < 4)
		return true;
	if (strcmp(str + len - 4, "desu") == 0)
		return false;
	return true;
}
int main() {
	int t, cas = 1;
	scanf(" %d", &t);
	while (t--) {
		scanf(" %s", str);
		int len = strlen(str);
		if (check(str)) {
			printf("Case #%d: %s%s\n", cas++, str, "nanodesu");
		} else {
			str[len - 3] = 0;
			printf("Case #%d: %s%s\n", cas++, str, "nanodesu");
		}
	}
	return 0;
}

Compiler output:
main.c:4:1: error: unknown type name 'bool'
    4 | bool check(char *str) {
      | ^~~~
main.c:3:1: note: 'bool' is defined in header '<stdbool.h>'; this is probably fixable by adding '#include <stdbool.h>'
    2 | #include<stdio.h>
  +++ |+#include <stdbool.h>
    3 | char str[1200];
main.c: In function 'check':
main.c:7:24: error: 'true' undeclared (first use in this function)
    7 |                 return true;
      |                        ^~~~
main.c:7:24: note: 'true' is defined in header '<stdbool.h>'; this is probably fixable by adding '#include <stdbool.h>'
main.c:7:24: note: each undeclared identifier is reported only once for each function it appears in
main.c:9:24: error: 'false' undeclared (first use in this function)
    9 |                 return false;
      |                        ^~~~~
main.c:9:24: note: 'false' is defined in header '<stdbool.h>'; this is probably fixable by adding '#include <stdbool.h>'
Language: C

1,1:
0
2,1:
01
3,2:
001
4,2:
0011
5,3:
00010
6,3:
000101
7,3:
0001011
8,3:
00010111
9,4:
000010110
10,4:
0000101100
11,4:
00001011000
12,4:
000010110000
13,4:
0000101100101
14,4:
00001011001011
15,4:
000010110010110
16,4:
0000101100101100
17,4:
00001011001011000
18,4:
000010110010110000
19,4:
0000101100101100101
20,4:
00001011001011001011

Compiler output:
main.c:1:1: error: expected identifier or '(' before numeric constant
    1 | 1,1:
      | ^
Language: C

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int pow[15],num[15];
int f[11][11][5100];
int g[11][11][5100];
int pre(int l,int k,int sum)
{
    if(l==-1)return k==0;
    if(f[l][k][sum]!=-1)return f[l][k][sum];
    int u=9,res=0;
    for(int i=0;i<=u;i++)
    if(sum-pow[l]*i>=0)
     res+=pre(l-1,i,sum-pow[l]*i);

    return f[l][k][sum]=res;
}

int dfs(int l,int k,int sum,int e)
{
    if(l==-1)return 1;
    if(!e) return g[l][k][sum];

    int u=num[l],res=0;
    for(int i=0;i<=u;i++)
    if(sum-pow[l]*i>=0)
     res+=dfs(l-1,i,sum-pow[l]*i,e && i==u);

    return res;
}
int solve(int x,int lim)
{
    int l=0;
    while(x!=0)
    {
        num[l++]=x%10;
        x=x/10;
    }
    return dfs(l-1,0,lim,1);
}

int cal(int x)
{
    int p=1;
    int ans=0;
    while(x!=0)
    {
        ans=ans+(x%10)*p;
        p*=2;
        x/=10;
    }
    return ans;
}
int main()
{
    int sec;
    for(int i=0;i<=10;i++)
        pow[i]=1<<i;
    scanf("%d",&sec);
    memset(f,-1,sizeof(f));
    memset(g,0,sizeof(g));
    //pre
    for(int l=10;l>=0;l--)
     for(int k=10;k>=0;k--)
      for(int sum=5000;sum>=0;sum--)
    if(f[l][k][sum]==-1)
    pre(l,k,sum);

    for(int l=0;l<=10;l++)
     for(int k=0;k<=10;k++)
      for(int sum=0;sum<=5000;sum++)
    {
        if(sum==0)g[l][k][sum]=f[l][k][sum];
        else
        g[l][k][sum]=g[l][k][sum-1]+f[l][k][sum];
    }


    for(int z=1;z<=sec;z++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        int lim=cal(a);
        int ans=solve(b,lim);
        printf("Case #%d: %d\n",z,ans);
    }
    return 0;
}

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

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;

const int maxn=100010;

int num_cnt[40];
long long num[maxn];
int n, m;
long long sum;
int l[5*maxn], r[5*maxn], nn;
long long cnt;

long long CC (long long x)
{
    if(x<=0) return 0;
    return x*(x-1)/2+x;
}

void addcnt (int x)
{
    sum|=x;
    for(int i=0; i<=31; i++){
        if(x&(1<<i)) num_cnt[i]++;
    }
}

void subcnt (int x)
{
    sum=0;
    for(int i=0; i<=31; i++){
        if(x&(1<<i)) num_cnt[i]--;
        if(num_cnt[i]) sum|=(1<<i);
    }
    //printf("sum %d\n", sum);
}

void addint (int b, int f)
{
    l[nn]=b;
    r[nn]=f;
    //printf("l %d r %d\n", b, f);
    nn++;
}

int main()
{
    //freopen("dout.txt", "r+", stdin);

    int T;
    scanf("%d", &T);
    for(int kase=1; kase<=T; kase++){
        scanf("%d %d", &n, &m);
        memset(num_cnt, 0, sizeof(num_cnt));

        for(int i=1; i<=n; i++){
            scanf("%I64d", &num[i]);
            //printf("%lld\n", num[i]);
        }

        int b, f;
        b=-1;
        for(int i=1; i<=n; i++){
            if(num[i]<m){ b=i; f=b+1; break;}
        }

        if(b==-1){ printf("Case #%d: 0\n", kase); continue;}

        addcnt(num[b]); nn=0;
        while(f<=n){
            //printf("f %d sum %d\n", f, sum);

            if((sum|num[f])<m){
                addcnt(num[f]);
                f++;
            }
            else{
                //cnt+=CC(f-b)+f-b;
                addint(b, f-1);

                if(num[f]<m){
                    addcnt(num[f]);
                    while(sum>=m){
                        subcnt(num[b]);
                        b++;
                    }
                    f++;
                }
                else{
                    memset(num_cnt, 0, sizeof(num_cnt));
                    b=f+1;
                    while(b<=n && num[b]>=m) b++;
                    if(b>n) break;
                    addcnt(num[b]);
                    f=b+1;
                }
            }
        }
        if(b<=n && b<f && f==n+1) addint(b, f-1);

        cnt=CC(r[0]-l[0]+1);
        //printf("cnt %lld\n", cnt);
        for(int i=1; i<nn; i++){
            if(r[i]<=r[i-1]){ r[i]=r[i-1]; continue;}

            if(r[i-1]<l[i]) cnt+=CC(r[i]-l[i]+1);
            else{
                cnt+=CC(r[i]-l[i]+1);
                cnt-=CC(r[i-1]-l[i]+1);
            }
        }

        printf("Case #%d: %I64d\n", kase, cnt);
    }

    return 0;
}

Compiler output:
main.c:1:10: fatal error: cstdio: No such file or directory
    1 | #include <cstdio>
      |          ^~~~~~~~
compilation terminated.
Language: C

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<assert.h>
using namespace std;
const int N = 20;
int M;
char s1[100],s2[100];
int opt[10][N],a,b,num[20];
inline int dfs(int h,int g,bool bound)
{
//    cout<<h<<" "<<g<<" "<<bound<<endl;
    if(g<=1) return 0;
    if(g>=19){
        return num[h]+1;
//        if(h==9) return 1;
//        int t;
////        cout<<"h="<<h<<endl;
//        sscanf(s2+h,"%d",&t);
//        return t+1;
    }
    if(!bound&&opt[h][g]!=-1) return opt[h][g];
    if(h==9&&g>=10) return 1;
    int digit=(bound?(s2[h]-'0'):9);
    int &ret=opt[h][g];
    ret=0;
    for(int i=0;i<=digit;++i)
    {
        int t=(g-10)*2;
        t+=(s1[h]-'0'-i);
        ret+=dfs(h+1,t+10,bound&&(i==digit));
    }
    return ret;
}
inline void read(int &x)
{
    char c;
    while(c=getchar(),c<'0'||c>'9') ;
    x=c-'0';
    while(c=getchar(),c>='0'&&c<='9') x=x*10+c-'0';
}
inline int maxx(int x,int y){
    return x>y?x:y;
}
int main()
{
//    freopen("1.in","r",stdin);
    int T;
    scanf("%d",&T);
    for(int cas=1;cas<=T;++cas)
    {
//        scanf("%d%d",&a,&b);
        read(a); read(b);
        if(a>=(int)1e9) assert(0);
//        sprintf(s1,"%d",a);
//        sprintf(s2,"%d",b);
//        M=maxx(strlen(s1),strlen(s2));
        sprintf(s1,"%09d",a);
        sprintf(s2,"%09d",b);
//        int base=1;
//        num[9]=0;
//        for(int i=8;i>=0;--i,base*=10)
//            num[i]=num[i+1]+(s2[i]-'0')*base;
        memset(opt,-1,sizeof opt);
        int ans=dfs(0,10,1);
        printf("Case #%d: %d\n",cas,ans);
    }
    return 0;
}

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

/*
 * Author:  chlxyd
 * Created Time:  2013-9-14 12:44:02
 * File Name: 1007.cpp
 */
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
using namespace std;
const double eps(1e-8);
typedef long long lint;
#define clr(x) memset( x , 0 , sizeof(x) )
#define sz(v) ((int)(v).size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repf(i, a, b) for (int i = (a); i <= (b); ++i)
#define repd(i, a, b) for (int i = (a); i >= (b); --i)
#define clrs( x , y ) memset( x , y , sizeof(x) )

const int maxMark = 1000 + 10;
const int maxlim = 5120 + 10;

//struct node {
    //int num, res, ty;
    //node (int num = 0, int res = 0, int ty = 0) : num(num), res(res), ty(ty) {
    //}
//};

int n, m, a, b;
int f[20][maxlim], g[20][maxlim + 20];

int two(int x) {
    return 1 << x;
}

int F(int w, int len) {
    int res = 0;
    repd (i, len - 1, 0) {
        res = res * 2 + w / ten[i];
        w %= ten[i];
    }
    return res;
}

void init() { //int64
    lenA = 0;
    lenB = 0;
    int na = a, nb = b; 
    clr(aa);
    clr(bb);
    while (na != 0) {
        aa[lenA++] = na % 10;
        na /= 10;
    }
    if (lenA == 0)
        aa[lenA++] = 0;
    while (nb != 0) {
        bb[lenB++] = nb % 10;
        nb /= 10;
    }
    if (lenB == 0)
        bb[lenB++] = 0;
    
    ten[0] = 1;
    repf (i, 1, 13)
        ten[i] = ten[i - 1] * 10;
    
    dit[0] = bb[0];
    repf (i, 1, 13)
        dit[i] = dit[i - 1] * 10 + bb[i];
}

void init2() {
    clr(f);
    clr(g);
    rep (k, 10)
        f[0][k] = 1;
    rep (k, 10) {
        g[0][k] = f[0][k];
        if (k != 0)
            g[0][k] += g[0][k - 1];
    }
    
    repf (i, 1, 10) {
        repd (j, 5120 - k * two(i), 0) {
            rep (k, 10) {
                f[i][j + k * two(i)] += f[i - 1][j]; 
            }
        } 
        repd (j, maxlim, 0) {
            f[i][j] += f[i - 1][j]; 
            g[i][j] = f[i][j];
            if (j != 0)         
                g[i][j] += g[i][j - 1];
        }
    }
}

void gao(int a, int b) {
    int lenb = 0, lena;
    int bb[20];
    while (b != 0) {
        bb[lenb] = b % 10;
        b /= 10;
        lenb++;
    }
    int ans = 0;
    if (lenb == 1) {
        rep (i, b)
            if (b <= a)
                ans++;
        return ans;
    }
     
    int head = bb[lenb - 1];
    rep (i, head - 1)
        rep (j, len - 1) {

        }
}

int main(){
    int T, ca = 1;
    scanf("%d", &T);
    init2();
    while (T--) {
        scanf("%d%d", &n, &m);
        a = n, b = m;
        init();        
        gao(n, m);
         
    }
    return 0;
}

Compiler output:
main.c:6:9: fatal error: iostream: No such file or directory
    6 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.
Language: C

#pragma comment(linker,"/STACK:102400000,102400000")
#include<stdio.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<math.h>
#include<string.h>
using namespace std;
struct Edge {
	int to, v;
	Edge() {
	}
	Edge(int to, int v) :
			to(to), v(v) {
	}
};
#define M 2000100
#define N 2001
struct Tarjan {
	vector<Edge> g[N];
	int index, map_p;
	stack<int> stk;
	static const int INF = 0x3f3f3f3f;
	int firv[N], min_index[N], tp[N];
	bool in[N];
	bool cmp(const Edge &a, const Edge &b) {
		return a.to < b.to;
	}
	void init() {
		memset(in, 0, sizeof(in));
		memset(firv, -1, sizeof(firv));
		for (int i = 0; i < N; i++)
			g[i].clear();
		memset(tp, -1, sizeof(tp));
		memset(min_index, -1, sizeof(min_index));
		while (!stk.empty()) {
			stk.pop();
		}
		index = map_p = 0;
	}
	void add_edge(int st, int ed, int v) {
		g[st].push_back(Edge(ed, v));
	}
	void tarjan(int st, int f) {
		stk.push(st);
		firv[st] = min_index[st] = index++;
		in[st] = true;
		for (int i = 0; i < (int) g[st].size(); i++) {
			int to = g[st][i].to;
			int c = 1;
			while (i + 1 < (int) g[st].size() && g[st][i].to == g[st][i + 1].to) {
				c++;
				i++;
			}
			if (f == to && c == 1)
				continue;
			if (to == st)
				continue;
			if (firv[to] == -1) {
				tarjan(to, st);
				min_index[st] = min(min_index[to], min_index[st]);
			} else if (in[to]) {
				min_index[st] = min(min_index[to], min_index[st]);
			}
		}
		if (min_index[st] == firv[st]) {
			int k;
			do {
				k = stk.top();
				stk.pop();
				tp[k] = map_p;
				in[k] = false;
			} while (k != st);
			map_p++;
		}
	}
	void dfs(int st) {
		in[st] = true;
		for (int i = 0; i < (int) g[st].size(); i++) {
			int to = g[st][i].to;
			if (!in[to])
				dfs(to);
		}
	}
	bool con(int n) {
		memset(in, 0, sizeof(in));
		dfs(1);
		for (int i = 1; i <= n; i++) {
			if (!in[i]) {
				memset(in, 0, sizeof(in));
				return false;
			}
		}
		memset(in, 0, sizeof(in));
		return true;
	}
	int solve(int n) {
		int ans = INF;
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j < (int) g[i].size(); j++) {
				int to = g[i][j].to, v = g[i][j].v;
				if (tp[i] != tp[to]) {
					ans = min(ans, v);
				}
			}
		}
		return ans;
	}
};
bool cmp(const Edge &a, const Edge &b) {
	return a.to < b.to;
}
Tarjan tar;
int main() {
	int n, m;
	while (scanf(" %d %d", &n, &m) == 2 && n | m) {
		tar.init();
		for (int i = 0; i < m; i++) {
			int x, y, v;
			scanf(" %d %d %d", &x, &y, &v);
			tar.add_edge(x, y, v);
			tar.add_edge(y, x, v);
		}
		for (int i = 1; i <= n; i++) {
			sort(tar.g[i].begin(), tar.g[i].end(), cmp);
		}
		tar.tarjan(1, -1);
		if (!tar.con(n)) {
			puts("0");
			continue;
		}
		int ans = tar.solve(n);
		if (ans == tar.INF)
			ans = -1;
		printf("%d\n", ans);
	}
	return 0;
}

Compiler output:
main.c:3:9: fatal error: algorithm: No such file or directory
    3 | #include<algorithm>
      |         ^~~~~~~~~~~
compilation terminated.
Language: C

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

struct point {
	double x, y, z;
	point(){}
	point(double x, double y, double z):x(x),y(y),z(z){}
	point operator + (const point &b) const {
		return point(x + b.x, y + b.y, z + b.z);
	}
	point operator - (const point &b) const {
		return point(x - b.x, y - b.y, z - b.z);
	}
	point operator * (const double &b) const {
		return point(x * b, y * b, z * b);
	}
	point operator / (const double &b) const {
		return point(x / b, y / b, z / b);
	}
	double len() {
		return sqrt(x * x + y * y + z * z);
	}
	void input() {
		scanf("%lf%lf%lf", &x, &y, &z);
	}
	void out() {
		printf( "%.6lf %.6lf %.6lf\n", x, y, z );
	}
};

double dot(point a, point b) {
	return a.x * b.x + a.y * b.y + a.z * b.z;
}

point cross( point a, point b ) {
    point res;
    res.x = a.y * b.z - b.y * a.z;
    res.y = a.z * b.x - b.z * a.x;
   	res.z = a.x * b.y - b.x * a.y;
    return res;
}

double dis( point a, point b, point c, point d ) {
	point n = cross(a - b, c - d);
	return fabs(dot(a - c, n)) / n.len();
}

point pto( point p, point p0, point n ) {
	return p - n * dot(p - p0, n);
}

point LineCross( point u1, point u2, point v1, point v2 ) {
	point res = u1;
	double t = ((u1.x - v1.x) * (v1.y - v2.y) - (u1.y - v1.y) * (v1.x - v2.x)) /
				((u1.x - u2.x) * (v1.y - v2.y) - (u1.y - u2.y) * (v1.x - v2.x));
	cout << "fuck " << ((u1.x - u2.x) * (v1.y - v2.y) - (u1.y - u2.y) * (v1.x - v2.x)) << endl;
	u1.out(); u2.out(); v1.out(); v2.out();
	res.x += (u2.x - u1.x) * t;
	res.y += (u2.y - u1.y) * t;
	res.z += (u2.z - u1.z) * t;
	return res;
}

void solve( point a, point b, point c, point d, point &res1, point &res2 ) {
	point n = cross(a - b, c - d);
	n = n / n.len();
	point aa = pto(a, a, n);
	point bb = pto(b, a, n);
	point cc = pto(c, a, n);
	point dd = pto(d, a, n);
	point k = LineCross(aa, bb, cc, dd);
	k.out();
	aa.out(); bb.out(); cc.out(); dd.out();
	n.out();
	cout << "hehe " << (cross(n, c - d)).len() << endl;
	res1 = LineCross(k, k + n, a, b);
	res2 = LineCross(k, k + n, c, d);
}

int main()
{
	int t;
	point a, b, c, d, res1, res2;
	scanf( "%d", &t );
	while( t-- ) {
		a.input(); b.input(); c.input(); d.input();
		double ans = dis(a, b, c, d);
		printf( "%.6lf\n", ans );
		solve(a, b, c, d, res1, res2);
		printf( "%.6lf %.6lf %.6lf %.6lf %.6lf %.6lf\n", res1.x, res1.y, res1.z, res2.x, res2.y, res2.z );
	}
	return 0;
}

Compiler output:
main.c:1:10: fatal error: iostream: No such file or directory
    1 | #include <iostream>
      |          ^~~~~~~~~~
compilation terminated.
Language: C

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int N=1010;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0},n;
bool flag1[N][N],flag2[N][N];
bool judge(int x,int y,int t)
{
    int x1=x+dx[t],y1=y+dy[t];
    if(x1>=0&&x1<n&&y1>=0&&y1<n)
        return 1;
    return 0;
}
int main()
{
    while(scanf("%d",&n)&&n)
    {
        int x1,y1,x2,y2,t1,t2,ans1=-1,ans2=-1;
        memset(flag1,0,sizeof(flag1));
        memset(flag2,0,sizeof(flag2));
        bool f1=1,f2=1;
        scanf("%d%d%d",&x1,&y1,&t1);
        scanf("%d%d%d",&x2,&y2,&t2);
        if(x1==x2&&y1==y2)
        {
            printf("%d %d\n",x1,y1);
            continue;
        }
        flag1[x1][y1]=1; flag2[x2][y2]=1;
        while(f1||f2)
        {
            if(f1)
            {
                if(judge(x1,y1,t1)&&!flag1[x1+dx[t1]][y1+dy[t1]])
                {
                    x1+=dx[t1]; y1+=dy[t1]; flag1[x1][y1]=1;
                }
                else
                {
                    t1=(t1+1)%4;
                    if(!judge(x1,y1,t1))
                        f1=0;
                    else if(flag1[x1+dx[t1]][y1+dy[t1]])
                        f1=0;
                }
            }
            if(f2)
            {
                if(judge(x2,y2,t2)&&!flag2[x2+dx[t2]][y2+dy[t2]])
                {
                    x2+=dx[t2]; y2+=dy[t2]; flag2[x2][y2]=1;
                }
                else
                {
                    t2=(t2+3)%4;
                    if(!judge(x2,y2,t2))
                        f2=0;
                    else if(flag2[x2+dx[t2]][y2+dy[t2]])
                        f2=0;
                }
            }
            if(x1==x2&&y1==y2)
            {
                ans1=x1; ans2=y1; break;
            }
        }
        if(ans1!=-1)
            printf("%d %d\n",ans1,ans2);
        else
            printf("-1\n");
    }
    return 0;
}

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

#include<cstdio>
#include<algorithm>

const int N = (int) (1e3);
int n, ax, ay, ad, bx, by, bd;
bool flag[2][N][N];

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

const int dx[4] = { 0, 1, 0, -1 };
const int dy[4] = { 1, 0, -1, 0 };

bool go(int &x, int &y, int &d, int f) {
	if (in(x + dx[d], y + dy[d]) && !flag[f][x + dx[d]][y + dy[d]]) {
		x += dx[d];
		y += dy[d];
		return true;
	}
	return false;
}

void turnright(int &d) {
	d = (d + 1) % 4;
}

void turnleft(int &d) {
	d = (d + 3) % 4;
}

bool move(int &x, int &y, int &d, int f) {
	if (go(x, y, d, f)) {
		return true;
	}
	for (int i = 0; i < 3; ++i) {
		if (f == 0) {
			turnright(d);
		} else {
			turnleft(d);
		}
		if (go(x, y, d, f)) {
			return true;
		}
	}
	return false;
}

int main() {
	while (scanf("%d", &n) == 1 && n) {
		scanf("%d%d%d%d%d%d", &ax, &ay, &ad, &bx, &by, &bd);
		for (int i = 0; i < 2; ++i) {
			for (int j = 0; j < n; ++j) {
				std::fill(flag[i][j], flag[i][j] + n, false);
			}
		}
		while (true) {
			if (ax == bx && ay == by) {
				break;
			}
			flag[0][ax][ay] = flag[1][bx][by] = true;
			bool go1 = move(ax, ay, ad, 0);
			bool go2 = move(bx, by, bd, 1);
			if (!go1 && !go2) {
				break;
			}
		}
		if (ax == bx && ay == by) {
			printf("%d %d\n", ax, ay);
		} else {
			puts("-1");
		}
	}
	return 0;
}

Compiler output:
main.c:1:9: fatal error: cstdio: No such file or directory
    1 | #include<cstdio>
      |         ^~~~~~~~
compilation terminated.
Language: C

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std ;

const int MAXN = 5010 ;
const int MAXM = 20010 ;

int id[MAXN] , end[MAXM] , cnt , g[MAXN] , next[MAXM] ;
bool deleted[MAXM] ;
int visit[MAXN];
int n , m , low[MAXN] , dfn[MAXN] , root;
int Belong[MAXN] ;
int step ;
int Cnt ;
int fu[MAXM] , fv[MAXM] , sz , ind[MAXN];

void AddEdge(int u , int v)
{
      cnt++ ; next[cnt]=g[u];g[u]=cnt;end[cnt]=v;
}

void tarjan(int u,int fa)
{
	low[u]=dfn[u]=++step;
	bool flag=true; visit[u]=1;
	for (int mark = g[u] ; mark > 0 ; mark = next[mark]){
		int v = end[mark];
		if (v==fa&&flag){
			flag=false;
			continue ;
		}
		if (!visit[v]){
			tarjan(v,u);
			low[u]=min(low[u],low[v]);
			if (dfn[u]<low[v])
			{
				deleted[mark]=true;
				if (mark&1)
					deleted[mark+1]=true;
				else
					deleted[mark-1]=true;
			}
		}else if (visit[v]==1)
			low[u]=min(low[u],dfn[v]);
	}
	visit[u]=2;
}

Compiler output:
main.c:1:10: fatal error: cstdio: No such file or directory
    1 | #include <cstdio>
      |          ^~~~~~~~
compilation terminated.
Language: C

#include<iostream>
using namespace std;

int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};

void t_right(int &di){
	di++;
	di%=4;
}
void t_left(int &di){
	di--;
	di=(di+4)%4;
}

const int N = 1001;
bool acc0[N][N], acc1[N][N];
int n;

#define x	first
#define y	second
typedef pair<int,int> pii;
#define mp	make_pair
bool sc;
bool st[2];
pii d,t;
int dd, dt;

pii _go(pii loc, int di){
	return mp(loc.x+dx[di], loc.y+dy[di]);
}
bool test(pii a, bool acc[][N]){
	if(a.x<0 || a.x>n-1 || a.y<0 || a.y>n-1)return false;
	if(acc[a.x][a.y]) return false;
	return true;
}
int gao(){
//	cout<<d.x<<' '<<d.y<<' '<<t.x<<' '<<t.y<<endl;
//	cout<<dd<<' '<<dt<<endl;
	if(d.x == t.x && d.y == t.y){sc = true;
		return 0;
	}
	pii next;
	if(!st[0]){
		next = _go(d, dd);
		if(test(next, acc0)){
			d = next;acc0[d.x][d.y]=true;
		}
		else{
			t_right(dd);
			next = _go(d,dd);
			if(test(next,acc0)){
				d = next;acc0[d.x][d.y]=true;
			}else{
				st[0]=true;
			}
		}
	}
	if(!st[1]){
		next = _go(t, dt);
		if(test(next,acc1)){
			t = next;
		}
		else{
			t_left(dt);
			next = _go(t, dt);
			if(test(next, acc1)){
				t = next;
			}
			else st[1]=true;
		}
		acc1[t.x][t.y]=true;
	}	
	if(st[0] && st[1]) return 0;
	return 1;
}
int main()
{
	while(cin>>n){
		if(n==0)break;
		sc = false;
		st[0]=st[1]=false;
		for(int i=0;i<n;i++)for(int j=0;j<n;j++){
			acc0[i][j]=acc1[i][j]=false;
		}
//		pii d, t;
//		int dd, dt;
		cin>>d.x>>d.y>>dd;
		cin>>t.x>>t.y>>dt;
		
		while(gao());
		if(sc){
			cout<<d.x<<' '<<d.y<<endl;
		}else{
			cout<<-1<<endl;
		}		
	}	
}

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

const int MAXN=10000000;
int cprime[MAXN],used=0;
int p[MAXN]; 
void prime_(){
   memset(p,0,sizeof p);
   for(int i=2;i<MAXN;i++){
     if(!p[i]) {
       cprime[used]=i,used++;
       p[i] = i;
     }
     for(int j=0;j<used;j++){
       if(cprime[j]>= MAXN/i) break;
       p[i*cprime[j]]=cprime[j];
       if(i%cprime[j]==0)break;   
     }    
  }
  miu[1] = 1;
  for (int i = 2; i < MAXN; ++i){
    if (i % (((long long)p[i]) * p[i]) == 0) miu[i] = 0;
    else miu[i] = - miu[i / p[i]];
  }    
}

Compiler output:
main.c:2:5: error: variably modified 'cprime' at file scope
    2 | int cprime[MAXN],used=0;
      |     ^~~~~~
main.c:3:5: error: variably modified 'p' at file scope
    3 | int p[MAXN];
      |     ^
main.c: In function 'prime_':
main.c:5:4: error: implicit declaration of function 'memset' [-Wimplicit-function-declaration]
    5 |    memset(p,0,sizeof p);
      |    ^~~~~~
main.c:1:1: note: include '<string.h>' or provide a declaration of 'memset'
  +++ |+#include <string.h>
    1 | const int MAXN=10000000;
main.c:5:4: warning: incompatible implicit declaration of built-in function 'memset' [-Wbuiltin-declaration-mismatch]
    5 |    memset(p,0,sizeof p);
      |    ^~~~~~
main.c:5:4: note: include '<string.h>' or provide a declaration of 'memset'
main.c:17:3: error: 'miu' undeclared (first use in this function)
   17 |   miu[1] = 1;
      |   ^~~
main.c:17:3: note: each undeclared identifier is reported only once for each function it appears in
Language: C

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define MAXN 1010
#define MAXM 1000010
using namespace std;
struct node {
	int x, y;
	double val;
};
node g[MAXM];
node p[MAXN];
int first[MAXN], next[MAXN << 2], v[MAXN << 2];
double cost[MAXN << 2];
int e;
double dp[MAXN];
bool vis[MAXN];
inline void addEdge(int x, int y, double val) {
	v[e] = y;
	next[e] = first[x];
	cost[e] = val;
	first[x] = e++;
}
double dist(node a, node b) {
	double x = a.x - b.x;
	double y = a.y - b.y;
	return sqrt(x * x + y * y);
}
int father[MAXN];
void makeSet(int n) {
	for (int i = 0; i <= n; i++) {
		father[i] = i;
	}
}
int findSet(int x) {
	if (x != father[x]) {
		father[x] = findSet(father[x]);
	}
	return father[x];
}
bool myUnion(int x, int y) {
	x = findSet(x);
	y = findSet(y);
	if (x != y) {
		father[x] = y;
		return true;
	} else {
		return false;
	}
}
bool cmp(node a, node b) {
	return a.val < b.val;
}
double ans;
int root;
void dfs(int x, int pre) {
	vis[x] = true;
	if (pre != -1) {
		ans = max(ans, (p[x].val + p[root].val) / dp[x]);
	}
	for (int i = first[x]; i != -1; i = next[i]) {
		int y = v[i];
		if (!vis[y]) {
			dp[y] = max(dp[x], cost[i]);
			dfs(y, x);
		}
	}
}
int main() {
	int T;
	int n;
	int cnt;
	int i, j;
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		for (i = 0; i < n; i++) {
			scanf("%d%d%lf", &p[i].x, &p[i].y, &p[i].val);
		}
		cnt = 0;
		for (i = 0; i < n; i++) {
			for (j = i + 1; j < n; j++) {
				g[cnt].x = i;
				g[cnt].y = j;
				g[cnt++].val = dist(p[i], p[j]);
			}
		}
		sort(g, g + cnt, cmp);
		makeSet(n);
		e = 0;
		memset(first, -1, sizeof(first));
		for (i = 0; i < cnt; i++) {
			if (myUnion(g[i].x, g[i].y)) {
				addEdge(g[i].x, g[i].y, g[i].val);
			}
		}
		ans = 0;
		for (i = 0; i < n; i++) {
			memset(dp, 0, sizeof(dp));
			memset(vis, false, sizeof(vis));
			root = i;
			dfs(i, -1);
		}
		printf("%.2lf\n", ans);
	}
	return 0;
}

Compiler output:
main.c:1:9: fatal error: cstdio: No such file or directory
    1 | #include<cstdio>
      |         ^~~~~~~~
compilation terminated.
Language: C

#include<cstdio>
#include<algorithm>

int testCount;
struct P {
	int x, y;
} a[3], b[3], c[4];
struct T {
	int e[3];
} aa, bb;

#define SQR(X) ((X)*(X))
int D(P a, P b) {
	return SQR(a.x-b.x) + SQR(a.y-b.y);
}

void change(P *a, T &aa) {
	for (int i = 0; i < 3; ++i) {
		aa.e[i] = D(a[i], a[(i + 1) % 3]);
	}
	std::sort(aa.e, aa.e + 3);
}

void read(P *a, T &aa) {
	for (int i = 0; i < 3; ++i) {
		scanf("%d%d", &a[i].x, &a[i].y);
	}
	change(a, aa);
}

bool equal_2(T &a, T &b) {
	for (int i = 0; i < 3; ++i) {
		if (a.e[i] != b.e[i]) {
			return false;
		}
	}
	return true;
}

bool equal_1(T &a1, T &a2, T &b1, T &b2) {
	return (equal_2(a1, b1) && equal_2(a2, b2))
			|| (equal_2(a1, b2) && equal_2(a1, b2));
}

bool check() {
	P c1[3], c2[3];
	T c11, c22;
	/*case 1*/
	c1[0] = c[0];
	c1[1] = c[2];
	c1[2] = c[1];
	change(c1, c11);
	c2[0] = c[0];
	c2[1] = c[2];
	c2[2] = c[3];
	change(c2, c22);
	if (equal_1(c11, c22, aa, bb)) {
		return true;
	}
	/*case 2*/
	c1[0] = c[1];
	c1[1] = c[3];
	c1[2] = c[0];
	change(c1, c11);
	c2[0] = c[1];
	c2[1] = c[3];
	c2[2] = c[2];
	change(c2, c22);
	if (equal_1(c11, c22, aa, bb)) {
		return true;
	}
	return false;
}

int main() {
	scanf("%d", &testCount);
	for (int test = 1; test <= testCount; ++test) {
		read(a, aa), read(b, bb);
		for (int i = 0; i < 4; ++i) {
			scanf("%d%d", &c[i].x, &c[i].y);
		}
		printf("Case #%d: %s\n", test, check() ? "Yes" : "No");
	}
	return 0;
}

Compiler output:
main.c:1:9: fatal error: cstdio: No such file or directory
    1 | #include<cstdio>
      |         ^~~~~~~~
compilation terminated.
Language: C

#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#include<cstring>
#include<string>
using namespace std;

//extended kmp
//nxt[] & ext[] should be clarify out of the function
void ExtendKmp(char s[],int ls,char t[],int lt)
{
  int i,j,k;
  int Len,L;

  j=0;
  while(t[j+1]==t[j]&&j+1<lt) j++;
  nxt[1]=j,k=1;

  for(i=2;i<lt;i++){
    Len=k+nxt[k],L=nxt[i-k];
    if(Len>L+i) nxt[i]=L;
    else{
      j=Len-i>0?Len-i:0;
      while(t[i+j]==t[j]&&i+j<lt) j++;
      nxt[i]=j,k=i;
    }
  }
  j=0;
  while(s[j]==t[j]&&j<lt&&j<ls) j++;
  ext[0]=j,k=0;

  for(i=1;i<ls;i++){
    Len=k+ext[k],L=nxt[i-k];
    if(Len>L+i) ext[i]=L;
    else{
       j=Len-i>0?Len-i:0;
       while(s[i+j]==t[j]&&i+j<ls&&j<lt) j++;
       ext[i]=j,k=i;
    }
  }
}

//kmp

void get_ne(char* p,int *nex)
{
     int i=0;int j=-1;
     nex[0]=-1;
     int L=strlen(p);
     while(i<L)
     {
         if(j==-1||p[i]==p[j])
         {
           i++;j++;
           nex[i]=j;
         }
         else
           j=nex[j];
         
     }
}

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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int sigma=26;
const int maxn=200010;
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int ch[maxn][sigma];
int val[maxn];
int sz,n,m,k;
void init(){sz=1;memset(ch[0],0,sizeof(ch[0]));}
void insert(int* s)
{
    int u=0;
    for(int i=0;i<m;i++)
    {
        int c=s[i];
        if(!ch[u][c])
        {
            memset(ch[sz],0,sizeof(ch[sz]));
            val[sz]=0;
            ch[u][c]=sz++;
        }
        u=ch[u][c];
    }
    val[u]=1;
}
int f[maxn],vis[maxn];
void getfail()
{
    queue<int> q;
    f[0]=0;
    for(int c=0;c<sigma;c++)
    {
        int u=ch[0][c];
        if(u)
        {
            f[u]=0;q.push(u);
        }
    }
    while(!q.empty())
    {
        int r=q.front();q.pop();
        for(int c=0;c<sigma;c++)
        {
            int u=ch[r][c];
            if(!u) continue;
            q.push(u);
            int v=f[r];
            while(v && !ch[v][c]) v=f[v];
            f[u]=ch[v][c];
            //last[u]=val[f[u]]?f[u]:last[f[u]];
        }
    }
}
void find(int* T)
{
    int j=0;
    for(int i=0;i<n;i++)
    {
        int c=T[i];
        while(j && !ch[j][c]) j=f[j];
        j=ch[j][c];
        if(val[j]) vis[i-m+1]=1;
    }
}
int x[maxn],a[maxn],t[maxn];
int dp[maxn],v[maxn];
int dfs(int u)
{
    if(u==n) return 0;
    if(v[u]) return dp[u];
    v[u]=1;
    dp[u]=dfs(u+1);
    if(vis[u] && u+m<=n) dp[u]=max(dp[u],dfs(u+m)+1);
    return dp[u];
}
int main()
{
    freopen("data","r",stdin);
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        for(int i=0;i<n;i++) scanf("%d",&x[i]);
        int g=0;
        for(int i=0;i<m;i++)
        {
            scanf("%d",&a[i]);
            g=gcd(a[i],g);
        }
        for(int i=1;;i++)
        {
            int flag=1;
            for(int j=0;j<m;j++)
            {
                t[j]=i*a[j]/g;
                if(t[j]>k)
                {
                    flag=0;break;
                }
            }
            if(flag) insert(t);
            else break;
        }
        getfail();
        memset(vis,0,sizeof(vis));
        find(x);
        memset(v,0,sizeof(v));
        printf("%d\n",dfs(0));
    }
    return 0;
}

Compiler output:
main.c:1:10: fatal error: iostream: No such file or directory
    1 | #include <iostream>
      |          ^~~~~~~~~~
compilation terminated.
Language: C

//const int N=205,M=205*205+5;
//int n,gra[N][N],eid;
//int dfn[N],low[N],sta[N];
//int now,id,top,gid[N],ins[N];
//int head[N],ed[M],nxt[M];
//
//void addedge(int s,int e){
//    ed[eid]=e;nxt[eid]=head[s];head[s]=eid++;
//}
//
//void tarjan(int s){
//    dfn[s]=low[s]=++id;
//    ins[s]=1;sta[top++]=s;
//    for(int i=head[s];~i;i=nxt[i]){
//        int e=ed[i];
//        if(!dfn[e]){
//            tarjan(e);
//            low[s]=min(low[s],low[e]);
//        }else if(ins[e])
//            low[s]=min(low[s],dfn[e]);
//    }
//    if(low[s]==dfn[s]){
//        id++;
//        while(top){
//            int k=sta[--top];
//            ins[k]=0;
//            gid[k]=id;
//            if(k==s)return ;
//        }
//    }
//}
//
//int main(){
////    freopen("/home/axorb/in","r",stdin);
//    while(~scanf("%d",&n)){
//        clr(gra,0);clr(head,-1);eid=0;
//        for(int i=1;i<=n;i++){
//            while(1){
//                int a;scanf("%d",&a);
//                if(a==0)break;
//                gra[i][a]=1;
//            }
//        }
//        for(int i=1;i<=n;i++)
//            for(int j=1;j<=n;j++)
//                if(i!=j&&gra[i][j]==0){
//                    addedge(i*2-1,j*2);
//                    addedge(i*2,j*2-1);
//                }
//        clr(ins,0);clr(dfn,0);
//        now=id=top=0;
//        for(int i=1;i<=n*2;i++)
//            if(!dfn[i])
//                tarjan(i);
//        int f=0;
//        for(int i=1;i<=n*2;i+=2){
//            if(gid[i]==gid[i+1]){f=1;break;}
//        }
//        puts(f?"NO":"YES");
//    }
//}

Compiler output:
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
Language: C

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int v[20], f[20][20], N;
int dp[1<<13];

struct edge {
	int u, v;
}e[20];

void init() {
	N = 0;
	for( int i = 1; i <= 16; ++i ) {
		int u = i, v = i + 1;
		if( u % 4 && v <= 16 && !f[u][v] ) {
			e[N].u = u; e[N].v = v; N++;
			f[u][v] = f[v][u] = 1;
		}
		v = i + 4;
		if( v <= 16 && !f[u][v] ) {
			e[N].u = u; e[N].v = v; N++;
			f[u][v] = f[v][u] = 1;
		}
	}
	memset( dp, -1, sizeof(dp) );
}

int cal( int st, int tot ) {
	if( dp[st] != -1 ) return dp[st];
	int k = 0;
	for( int i = 0; i < N; ++i ) if(!(st>>i&1)) {
		int uu = e[i].u, vv = e[i].v, d = 0;
		if( v[uu] ) d += uu; if( v[vv] ) d += vv;
		++v[uu]; ++v[vv];
		k = max(k, tot - cal(st | (1 << i), tot - d));
		--v[uu]; --v[vv];
	}
	return dp[st] = k;
}

int main()
{
	int t, n, a, b, va, vb, cas = 0;
	cin >> t;
	while( t-- ) {
		cin >> n;
		memset( v, 0, sizeof(v) ); va = vb = 0;
		memset( f, 0, sizeof(f) );
		for( int i = 1; i <= n; ++i ) {
			cin >> a >> b;
			if( i & 1 ) {
				if(v[a]) va+=a;
				if(v[b]) va+=b;
			}
			else {
				if(v[a]) vb+=a;
				if(v[b]) vb+=b;
			}
			++v[a]; ++v[b]; f[a][b] = f[b][a] = 1;
		}
		cout << va << " " << vb << endl;
		init();
		cout << N << endl;
		for( int i = 0; i < N; ++i ) cout << e[i].u << " " << e[i].v << endl;
		if( n & 1 ) vb += cal(0,272 - va - vb), va = 272 - vb;
		else va += cal(0, 272 - va - vb), vb = 272 - va;
		cout << va << " " << vb << endl;
		printf("Case #%d: ", ++cas);
		if(va > vb) puts("Tom200");
		else puts("Jerry404");
	}
	return 0;
}

Compiler output:
main.c:1:10: fatal error: iostream: No such file or directory
    1 | #include <iostream>
      |          ^~~~~~~~~~
compilation terminated.
Language: C

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int maxn=110;

int F[maxn][maxn], G[maxn][maxn];

int p[maxn];
int n;
bool vis[maxn], ans;

void dfs (int x, int to)
{
    if(p[x]!=-1 && p[x]!=to){
        ans=false;
        return ;
    }

    if(vis[x]) return ;
    p[x]=to; vis[x]=true;

    for(int i=1; i<=n; i++){
        if(i!=x && G[x][i]==1){
            dfs(i, !to);
        }
    }
}

int main()
{
    while(scanf("%d", &n)==1 && n){
        for(int i=1; i<=n; i++){
            vis[i]=false;
            p[i]=-1;
            for(int j=1; j<=n; j++){
                F[i][j]=G[i][j]=1;
            }
        }

        for(int i=1; i<=n; i++){
            int x;
            while(scanf("%d", &x)==1 && x){
                F[i][x]=1;
            }
        }

        ans=false;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                if(F[i][j]==0 || F[j][i]==0){
                    G[i][j]=G[j][i]=1;
                    ans=true;
                }
            }
        }

        if(!ans){ printf("YES\n"); continue;}
        ans=true;

        for(int i=1; i<=n; i++){
            if(!vis[i]){
                dfs(vis[i], 0);
            }
        }

        if(ans){
            printf("YES\n");
        }
        else{
            printf("NO\n");
        }
    }

    return 0;
}

Compiler output:
main.c:1:10: fatal error: cstdio: No such file or directory
    1 | #include <cstdio>
      |          ^~~~~~~~
compilation terminated.
Language: C

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
const int mod=(int)1e9+7;
const int N = 101;
const int M = 41;
int n,m,opt[N][N][M][M],next1[N],next2[N],l1,l2;
char s1[N],s2[N];

struct state
{
    int a,b,c,d;
    state(){}
    state(int aa,int bb,int cc,int dd):a(aa),b(bb),c(cc),d(dd){}
    inline int &get(){ return opt[a][b][c][d]; }
//    inline void print(){
//        printf("state: %d %d %d %d\n",a,b,c,d);
//    }
};
inline void get_next(char *s,int *next)
{
    int i=0,j=-1;
    next[0]=-1;
    while(s[i])
    {
//        cout<<i<<" "<<j<<" "<<s[i]<<" "<<s[j]<<endl;
        if(j==-1||s[i]==s[j]) {
//                cout<<i+1<<" "<<j+1<<endl;
                next[++i]=++j;
//                cout<<next[i]<<" "<<j<<endl;
        }
        else j=next[j];
    }
//    cout<<s<<endl;
//    for(i=0;s[i];++i)
//    {
//        cout<<i<<" "<<next[i]<<endl;
//    }
//    cout<<i<<" "<<next[i]<<endl;
}
inline int get(char *s,int *next,int l,int j,char c)
{
//    cout<<j<<" "<<l<<endl;
    if(j==l) return j;
//    cout<<s[j]<<" "<<c<<endl;
    while(j!=-1&&s[j]!=c) j=next[j];
    return j+1;
}
int dfs(state s)
{
//    s.print();
    if(s.c<0||s.d<0) return 0;
    if(s.c+s.d==0)
    {
//        cout<<l1<<" "<<l2<<" "<<s.a<<" "<<s.b<<endl;
        return (s.a==l1&&s.b==l2)?1:0;
    }
    int &ret=opt[s.a][s.b][s.c][s.d];
    if(ret!=-1) return ret;
    ret=0;
    state ns=s;
    ns.a=get(s1,next1,l1,s.a,'R');
    ns.b=get(s2,next2,l2,s.b,'R');
    --ns.c;


    ret=dfs(ns);

    ns=s;
    ns.b=get(s2,next2,l2,s.b,'D');
    ns.a=get(s1,next1,l1,s.a,'D');
    --ns.d;
//    if(s.a==1&&s.b==0){
//        puts("-------");
//        s.print(); ns.print();
//        puts("-------");
//    }
    ret=(ret+dfs(ns))%mod;
    return ret;
}
int main()
{
    int T;
//    freopen("1.in","r",stdin);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        scanf("%s%s",s1,s2);
        l1=strlen(s1);
        l2=strlen(s2);
        get_next(s1,next1);
        get_next(s2,next2);
        memset(opt,-1,sizeof opt);
//        cout<<get(s1,next1,l1,1,'D')<<endl;
        printf("%d\n",dfs(state(0,0,n,m)));
    }
    return 0;
}

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

2????????1??3??7??9??3??9??1??7??1??3??7??3??9??1??7??1??3??9??3??9??7

Compiler output:
main.c:1:1: error: expected identifier or '(' before numeric constant
    1 | 2????????1??3??7??9??3??9??1??7??1??3??7??3??9??1??7??1??3??9??3??9??7
      | ^
Language: C

#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
    string t;
    string s;
    while(cin>>t)
    {
        cin>>s;
        if(s=="RGB")
        {
            int r,g,b;
            cin>>r>>g>>b;
            //get h
            double h=0;
            int maxx=max(max(r,g),b);
            int minx=min(min(r,g),b);

            if(maxx==minx)
            {
                h=0;
            }
            else if(maxx==r && g>=b)
            {
                h=60*(g-b)/(double)(maxx-minx);
            }
            else if(maxx==r && g<b)
            {
                h=360.0+60*(g-b)/(double)(maxx-minx);
            }
            else if(maxx==g)
            {
                h=120.0+60*(b-r)/(double)(maxx-minx);
            }
            else if(maxx==b)
            {
                h=240.0+60*(r-g)/(double)(maxx-minx);
            }
            //hsl
            if(t=="HSL")
            {
                int l2=maxx+minx;
                double s=0;
                if(l2==0 || maxx==minx)s=0;
                else if(0<l2<=1)s=(max-min)/(double)l2;
                else if(l2>1)s=(max-min)/(double)(2.0-l2);

                printf("HSL %.0f% %.0f% %.0f%",round(h),round(s*100),round(l2/0.5));
            }
            else
            if(t=="HSV")
            {
                double s=0;
                double v=maxx;
                if(maxx!=0)s=1.0-minx/(double)maxx;

                printf("HSV %.0f% %.0f% %.0f%",round(h),round(s*100),round(v));//?
            }
            else if(t=="RGB")
            {
                printf("RGB %d %d %d",r,g,b);
            }
        }
        else if(s=="HSV")
        {


        }
        else if(s=="HSL")
        {

        }
    }
    return 0;
}

Compiler output:
main.c:1:9: fatal error: iostream: No such file or directory
    1 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.