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

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

Compiler output:
main.c: In function 'main':
main.c:6:14: warning: missing terminating " character
    6 |       printf("%dx%d=%d
      |              ^
main.c:6:14: error: missing terminating " character
    6 |       printf("%dx%d=%d
      |              ^~~~~~~~~
main.c:7:1: warning: missing terminating " character
    7 | ",i+1,j+1,(i+1)*(j+1));
      | ^
main.c:7:1: error: missing terminating " character
    7 | ",i+1,j+1,(i+1)*(j+1));
      | ^~~~~~~~~~~~~~~~~~~~~~~
main.c:8:3: error: expected expression before 'return'
    8 |   return 0;
      |   ^~~~~~
main.c:8:12: error: expected ';' before '}' token
    8 |   return 0;
      |            ^
      |            ;
    9 | }
      | ~
Language: C

/*
 * by purple
 * at 12-03-06 7:13:04 PM
 */

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <map>
#include <iostream>

using namespace std;

#define sz(x) ((int)((x).size()))
#define out(x) printf(#x" %d\n", x)
#define rep(i,n) for(int i=0;i<(n);++i)
#define repf(i,a,b) for(int i=(a);i<=(b);++i)

template<class T>
struct arrayBase {
    vector<T> val;

    void clear() {
        val.clear();
    }
    void insert(T x) {
        val.push_back(x);
    }
    
    arrayBase operator+(const arrayBase& x) const {
        arrayBase res = *this;
        rep (i, sz(res.val)) {
            res.val[i] = res.val[i] + x.val[i];
        }
        return res;
    }
    arrayBase operator-(const arrayBase& x) const {
        arrayBase res = *this;
        rep (i, sz(res.val)) {
            res.val[i] = res.val[i] - x.val[i];
        }
        return res;
    }
    arrayBase operator*(const arrayBase& x) const {
        arrayBase res = *this;
        rep (i, sz(res.val)) {
            res.val[i] = res.val[i] * x.val[i];
        }
        return res;
    }
    
    arrayBase operator+(const int& x) const {
        arrayBase res = *this;
        rep (i, sz(res.val)) {
            res.val[i] = res.val[i] + x;
        }
        return res;
    }
    arrayBase operator-(const int& x) const {
        arrayBase res = *this;
        rep (i, sz(res.val)) {
            res.val[i] = res.val[i] - x;
        }
        return res;
    }
    arrayBase operator*(const int& x) const {
        arrayBase res = *this;
        rep (i, sz(res.val)) {
            res.val[i] = res.val[i] * x;
        }
        return res;
    }
    
    T self_add() {
        int res = val[sz(val) - 1];
        for (int k = sz(val) - 2; k >= 0; --k) {
            res = val[k] + res;
        }
        return res;
    }
    T self_sub() {
        int res = val[sz(val) - 1];
        for (int k = sz(val) - 2; k >= 0; --k) {
            res = val[k] - res;
        }
        return res;
    }
    T self_mul() {
        int res = val[sz(val) - 1];
        for (int k = sz(val) - 2; k >= 0; --k) {
            res = val[k] * res;
        }
        return res;
    }
};

typedef arrayBase<int> array1D;
typedef arrayBase<array1D> array2D;
typedef arrayBase<array2D> array3D;

char s[88];

void APLparser() {
}

int main() {
    int Case = 1;
    while (gets(s), s[0] != '#') {
        printf ("Case %d: %s\n", Case++, s);
        APLparser();
    }
    return 0;
}
array1D

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

#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#include<iostream>
using namespace std;
const int M = 10000;
int tonum(char* s)
{
	int i = 0,ans = 0;
	if(s[0] == '1') ans += 1;
	if(s[1] == '1') ans += 2;
	if(s[2] == '1') ans += 4;
	return ans;
}
int m[M],d[M],hh[M],mm[M],state[M];
char ss[100];
char who[M][10];
int dday[M],ttime[M];
int sum[100];
int tbg[100],ted[100];
void fun(int l,int r)
{
	memset(tbg,-1,sizeof(tbg));
	memset(ted,-1,sizeof(ted));
	for(int i = l;i <r;i++)
	{
		int p = tonum(who[i]);
		if(state[i] == 0) tbg[p] = ttime[i];
		else ted[p] = ttime[i];
	}
	if(tbg[0] == -1 || ted[0] == -1) return ;
	for(int i = 1 ;i < 8;i++)
	{
		if(tbg[i] >= tbg[0] && ted[i] <= ted[0] ) sum[i] += ted[i] - tbg[i];
		else if(tbg[i] >= tbg[0] && ted[i] > ted[0] && ted[0] > tbg[i]) sum[i] += ted[0] - tbg[i];
		else if(tbg[i] < tbg[0] && ted[i] > tbg[0] && ted[i] < ted[0]) sum[i] += ted[i] - tbg[0];
		else if(tbg[i] < tbg[0] && ted[i] > ted[0]) sum[i] += ted[0] - tbg[0];
		else ;
	}
}
int main()
{
	int n,i,j,k;


	while(cin>>n)
	{
		memset(sum,0,sizeof(sum));
		for(i=0;i<n;i++) {
			scanf("%d/%d %d:%d %s %s",m+i,d+i,hh+i,mm+i,ss,who[i]);
			printf("%d/%d %d:%d %s %s\n",m[i],d[i],hh[i],mm[i],ss,who[i]);
			if(ss[0] == 'I') state[i] = 0;
			else state[i] = 1;
			dday[i] = m[i] * 30 + d[i] ;
			ttime[i]  = hh[i] * 60 + mm[i];
		}
		for(i=0;i<n;)
		{
			int l = i;
			int r = i;
			for( j = l+1;j < n;j++)
			{
				if(dday[j] == dday [j -1]) r = j;
				else break;
			}
			printf("l = %d r = %d\n",l,r);
			fun(l,r);
			i = r+1;
		}
		int Max = 0;
		for(i = 0; i< 8;i++) Max = max(sum[i],Max);
		printf("%d\n",Max);
	}
}

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

#include<stdio.h>
main(){
     int a;
     for(a=1;a<100;a++){
     b=a*a
     printf("%d×%d=%d",a,a,b);
     }
}

Compiler output:
main.c:2:1: error: return type defaults to 'int' [-Wimplicit-int]
    2 | main(){
      | ^~~~
main.c: In function 'main':
main.c:5:6: error: 'b' undeclared (first use in this function)
    5 |      b=a*a
      |      ^
main.c:5:6: note: each undeclared identifier is reported only once for each function it appears in
main.c:5:11: error: expected ';' before 'printf'
    5 |      b=a*a
      |           ^
      |           ;
    6 |      printf("%d×%d=%d",a,a,b);
      |      ~~~~~~
Language: C

#include<stdio.h>
int main(){
     int a,b;
     for(a=1;a<10;a++){
     b=a*a;
     printf("%d×%d=%d",a,a,b);
     }
     return o;
}

Compiler output:
main.c: In function 'main':
main.c:8:13: error: 'o' undeclared (first use in this function)
    8 |      return o;
      |             ^
main.c:8:13: note: each undeclared identifier is reported only once for each function it appears in
Language: C

#include<stdio.h>

int main(){
    int i;
    int j;
    for (i=1; i<10; i++){
      for (j=1; j<10; j++){
        printf("%dx%d=%d\n", j,i, j*i);
      }
    }
    return 0;
}

~                                                                                                                                   
~                               

Compiler output:
main.c:14:1: error: expected identifier or '(' before '~' token
   14 | ~
      | ^
Language: C

あなたの、あたまを、あたらしく。

Compiler output:
main.c:1:9: error: stray '\343' in program
    1 | <U+3042><U+306A><U+305F><U+306E><U+3001><U+3042><U+305F><U+307E><U+3092><U+3001><U+3042><U+305F><U+3089><U+3057><U+304F><U+3002>
      |                                 ^~~~~~~~
main.c:1:1: error: unknown type name '\U00003042\U0000306a\U0000305f\U0000306e'
    1 | あなたの、あたまを、あたらしく。
      | ^~~~~~~~
main.c:1:19: error: stray '\343' in program
    1 | <U+3042><U+306A><U+305F><U+306E><U+3001><U+3042><U+305F><U+307E><U+3092><U+3001><U+3042><U+305F><U+3089><U+3057><U+304F><U+3002>
      |                                                                         ^~~~~~~~
main.c:1:21: error: expected '=', ',', ';', 'asm' or '__attribute__' before '\U00003042\U0000305f\U00003089\U00003057\U0000304f'
    1 | あなたの、あたまを、あたらしく。
      |                     ^~~~~~~~~~
main.c:1:31: error: stray '\343' in program
    1 | <U+3042><U+306A><U+305F><U+306E><U+3001><U+3042><U+305F><U+307E><U+3092><U+3001><U+3042><U+305F><U+3089><U+3057><U+304F><U+3002>
      |                                                                                                                         ^~~~~~~~
Language: C

public class Main {
	public static void main(String[] args) {
		for (int i = 1; i <= 9; i++) {
			for (int j = 1; j <= 9; j++) {
				System.out.println(i + "×" + j + "=" + i * j);
			}
		}
	}
}

Compiler output:
main.c:1:1: error: unknown type name 'public'
    1 | public class Main {
      | ^~~~~~
main.c:1:14: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Main'
    1 | public class Main {
      |              ^~~~
Language: C

class Main{
    public static void main(String[] a){
		for(int i = 1; i <= 9; i++){
			for(int j = 1; j <= 9; j++) System.out.printf("%dx%d=%d\n", i, j, i * j);
        }
    }
}

Compiler output:
main.c:1:1: error: unknown type name 'class'
    1 | class Main{
      | ^~~~~
main.c:1:11: error: expected '=', ',', ';', 'asm' or '__attribute__' before '{' token
    1 | class Main{
      |           ^
Language: C

#include<iostream>
using namespace std;
int main(){
	for(int i=1; i<10; i++){
		for(int j=1; j<10; j++){
			cout <<i<<"x"<<j<<"="<<i*j<<endl;
		}
	}
}

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

#include<iostream>
using namespace std;
int main(){
	for(int i=1; i<10; i++){
		for(int j=1; j<10; j++){
			cout <<i<<"x"<<j<<"="<<i*j<<endl;
		}
	}
	return 0;
}

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

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

Compiler output:
main.c: In function 'main':
main.c:4:9: error: 'inta' undeclared (first use in this function); did you mean 'int'?
    4 |         inta,i,j;
      |         ^~~~
      |         int
main.c:4:9: note: each undeclared identifier is reported only once for each function it appears in
main.c:4:14: error: 'i' undeclared (first use in this function)
    4 |         inta,i,j;
      |              ^
main.c:4:16: error: 'j' undeclared (first use in this function)
    4 |         inta,i,j;
      |                ^
main.c:8:49: error: 'a' undeclared (first use in this function)
    8 |                         printf("%dx%d=%d\n",i,j,a,a=i*j);
      |                                                 ^
Language: C

#include <iostream>
using namespace std;

int main() {

    int i, j;
    for (i = 1; i <= 9; i++) {
        for (j = 1; j <= 9; j++){
            cout << i << "x" << j << "=" << i*j <<"\n";
        }
            }
    
    return 0;
}

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

#include<stdio.h>
 
int main(){
    int a,b;
 
    for(a=1;a<10;a++){
        for(b=1;b<10;b++){
            puts("%d×%d=%d\n",a,b,a*b);
        }
    }
 
    return 0;
 
}

Compiler output:
main.c: In function 'main':
main.c:8:13: error: too many arguments to function 'puts'
    8 |             puts("%d×%d=%d\n",a,b,a*b);
      |             ^~~~
In file included from main.c:1:
/usr/include/stdio.h:714:12: note: declared here
  714 | extern int puts (const char *__s);
      |            ^~~~
Language: C

X;main(Y){for(;++X<10;for(Y=0;Y<9;printf("%dx%d=%d\n",X,Y,++Y*X)));}

Compiler output:
main.c:1:1: warning: data definition has no type or storage class
    1 | X;main(Y){for(;++X<10;for(Y=0;Y<9;printf("%dx%d=%d\n",X,Y,++Y*X)));}
      | ^
main.c:1:1: error: type defaults to 'int' in declaration of 'X' [-Wimplicit-int]
main.c:1:3: error: return type defaults to 'int' [-Wimplicit-int]
    1 | X;main(Y){for(;++X<10;for(Y=0;Y<9;printf("%dx%d=%d\n",X,Y,++Y*X)));}
      |   ^~~~
main.c: In function 'main':
main.c:1:3: error: type of 'Y' defaults to 'int' [-Wimplicit-int]
main.c:1:23: error: expected expression before 'for'
    1 | X;main(Y){for(;++X<10;for(Y=0;Y<9;printf("%dx%d=%d\n",X,Y,++Y*X)));}
      |                       ^~~
Language: C

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

Compiler output:
main.c: In function 'main':
main.c:9:53: error: expected ';' before '}' token
    9 |                         printf("%d%*d=%d\n",i,j,i*j)
      |                                                     ^
      |                                                     ;
   10 |                 }
      |                 ~
Language: C

main (0){for(;X++<90;)printf("%dx%d=%d",X/9,X%9,X/9*X%9)}

Compiler output:
main.c:1:7: error: expected declaration specifiers or '...' before numeric constant
    1 | main (0){for(;X++<90;)printf("%dx%d=%d",X/9,X%9,X/9*X%9)}
      |       ^
Language: C

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < n; ++i)
#define PB push_back

vector<int> group[36];
int n, cost[36], sz[36];
vector<vector<int> > cut[5];

long long sum[36];

long long best = 0, pos;

void dfs(int u, int a, int b, int c, int d, long long cos, long long plan)
{
    if (u == n)
    {
        if (cos > best)
        {
            if (a < c) return;
            a -= c;
            b %= 2;
            if (2*a < b) return;
            
            best = cos;
            pos = plan;
        }
        
        return;
    }
    
    if (sum[u] + cos < best) return;
    
    int s = sz[u];
    for (int i = 0; i < cut[s].size(); ++i)
    {
        int x[4] = {a, b, c, d};
        long long nxt = cos;
        REP(j, cut[s][i].size())
        {
            nxt += cost[u] * (cut[s][i][j])*(cut[s][i][j]-1);
            ++x[cut[s][i][j]-1];
        }
        
        dfs(u+1, x[0], x[1], x[2], x[3], nxt, (plan+i)*cut[s].size());
    }
}

int main()
{
    cut[1].resize(1);
    cut[1][0].PB(1);
    cut[2].resize(2);
    cut[2][0].PB(2);
    cut[2][1].PB(1), cut[2][1].PB(1);
    cut[3].resize(3);
    cut[3][0].PB(3);
    cut[3][1].PB(2), cut[3][1].PB(1);
    cut[3][2].PB(1), cut[3][2].PB(1), cut[3][2].PB(1);
    cut[4].resize(5);
    cut[4][0].PB(4);
    cut[4][1].PB(3), cut[4][1].PB(1);
    cut[4][2].PB(2), cut[4][2].PB(2);
    cut[4][3].PB(2), cut[4][3].PB(1), cut[4][3].PB(1);
    cut[4][4].PB(1), cut[4][4].PB(1), cut[4][4].PB(1), cut[4][4].PB(1);
    
    while (cin >> n)
    {
        REP(i, n) group[i].clear();
        REP(i, n)
        {
            cin >> sz[i] >> cost[i];
            group[i].resize(sz[i]);
            REP(j, sz[i])
                cin >> group[i][j];
        }
        
        sum[n-1] = cost[n-1];
        for (int i = n-2; i >= 0; --i)
            sum[i] = cost[i] + sum[i+1];
            
        best = -1;
        dfs(0, 0, 0, 0, 0, 0, 0);
        cout << best << endl;
    }
    return 0;
}

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

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

Compiler output:
main.c:1:19: warning: extra tokens at end of #include directive
    1 | #include <stdio.h>$
      |                   ^
main.c:2:2: error: expected ';' before 'int'
    2 | $
      |  ^
      |  ;
    3 | int main() {$
      | ~~~
main.c: In function 'main':
main.c:3:13: error: '$' undeclared (first use in this function)
    3 | int main() {$
      |             ^
main.c:3:13: note: each undeclared identifier is reported only once for each function it appears in
main.c:3:14: error: expected ';' before 'int'
    3 | int main() {$
      |              ^
      |              ;
    4 |   int i, j;$
      |   ~~~         
main.c:4:13: error: expected ';' before '$'
    4 |   int i, j;$
      |             ^
      |             ;
    5 | $
      | ~            
main.c:12:13: error: expected ';' before '}' token
   12 |   return 0;$
      |             ^
      |             ;
   13 | }$
      | ~            
main.c: At top level:
main.c:13:1: error: expected '=', ',', ';', 'asm' or '__attribute__' at end of input
   13 | }$
      | ^
Language: C

# include <cstring>
# include <cstdlib>
# include <cstdio>
# include <iostream>
# include <algorithm>
using namespace std;
long long solve (long long n,long long x)
{
    if (n<=0)
       return 0;
    int a[20],tot=0;
    long long num[20];
    long long nn=n;
    while (nn)
    {
       a[++tot]=nn%10;
       nn/=10;
    }
    long long xx=x/10;
    int len=1;
    while (xx)
    {
       len++;
       xx/=10;
    }
    int now=tot-len-1;
    num[0]=1;
    for (int i=1;i<=now || i<=len;i++)
        num[i]=num[i-1]*10;
    long long ans=0;
    for (int i=tot;i>=len+1;i--)
    {
       for (int j=0;j<a[i];j++)
           ans+=num[now];
       now--;
    }
    if (n%num[len]>=x)
       ans++;
    return ans;
}
int main (void)
{
    int t;
    cin>>t;
    while (t--)
    {
        long long x,a,b;
        cin>>x>>a>>b;
        cout<<solve(b,x)-solve(a-1,x)<<endl;
    }
    return 0;
}

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

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

unsigned long long pow[20];

unsigned long long func(unsigned long long a,unsigned long long x)
{
    int i,res,p,l,r;

    if (x==0)
    {
        l=a/10;
        r=a%10;

        res=l;
        if (r>0)
            res++;

        return res;
    }

    for (i=0;i<20;i++)
        if (x/pow[i]==0)
        {
            p=i;
            break;
        }

    l=a/pow[p];
    r=a%pow[p];

    res=l;

    if (r>x)
        res++;

    return res;

}

main()
{
    int i,t;
    unsigned long long x,a,b,ans;

    pow[0]=1;
    for (i=1;i<20;i++)
        pow[i]=pow[i-1]*10;
    cout<<pow[18]<<endl;
    cin>>t;
    while (t--)
    {
        cin>>x>>a>>b;

        ans=func(b+1,x)-func(a,x);
        cout<<"a "<<func(a,x)<<endl;
        cout<<"b "<<func(b+1,x)<<endl;

        cout<<ans<<endl;
    }

    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>

using namespace std;

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

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

X,Y;main(0){for(;++X<10;)for(Y=0;Y<9;)printf("%dx%d=%d\n",X,Y,X*++Y);}

Compiler output:
main.c:1:1: warning: data definition has no type or storage class
    1 | X,Y;main(0){for(;++X<10;)for(Y=0;Y<9;)printf("%dx%d=%d\n",X,Y,X*++Y);}
      | ^
main.c:1:1: error: type defaults to 'int' in declaration of 'X' [-Wimplicit-int]
main.c:1:3: error: type defaults to 'int' in declaration of 'Y' [-Wimplicit-int]
    1 | X,Y;main(0){for(;++X<10;)for(Y=0;Y<9;)printf("%dx%d=%d\n",X,Y,X*++Y);}
      |   ^
main.c:1:10: error: expected declaration specifiers or '...' before numeric constant
    1 | X,Y;main(0){for(;++X<10;)for(Y=0;Y<9;)printf("%dx%d=%d\n",X,Y,X*++Y);}
      |          ^
Language: C

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
using namespace std;

struct Man
{
    string name;
    map<string, int> have;
    Man() {}
    Man(string _name)
    {
        name = _name;
        have.clear();
    }
    void add(string st)
    {
        have[st]++;
    }
};

const string S[34] = {"1N", "2N", "3N", "4N", "5N", "6N", "7N", "8N", "9N",
                      "1S", "2S", "3S", "4S", "5S", "6S", "7S", "8S", "9S",
                      "1B", "2B", "3B", "4B", "5B", "6B", "7B", "8B", "9B",
                      "EH", "SH", "WH", "NH",
                      "rH", "wH", "gH"};

const int maxn = 137, maxt = 507;
      int run, total;
      Man man[4];
      string s[maxn];
      string a[14];

map<string, int> hand[maxt];

void Add_hand(string a[14])
{
    ++total;
    hand[total].clear();
    for (int i = 0; i < 14; i++) hand[total][a[i]]++;
}

void prepare()
{
    total = 0;
    //Special 13T
    a[0] = "EH";
    a[1] = "SH";
    a[2] = "WH";
    a[3] = "NH";
    a[4] = "rH";
    a[5] = "wH";
    a[6] = "gH";
    a[7] = "1N";
    a[8] = "9N";
    a[9] = "1S";
    a[10] = "9S";
    a[11] = "1B";
    a[12] = "9B";
    for (int i = 0; i < 13; i++)
    {
        a[13] = a[i];
        Add_hand(a);
    }
    /////////////////////////////////////////////////////
}

bool isPair(string a, string b)
{
    return a==b;
}

bool check(Man a)
{
    //Special 7Pair
    int sum = 0;
    for (map<string, int>::iterator it = a.have.begin(); it != a.have.end(); it++)
        if (it->second>=2) sum++;
    if (sum>=7) return true;
    /////////////////////////////////////////////////////
}

void work()
{
    for (int i = 1; i <= 136; i++) cin >> s[i];
    man[0] = Man("Takakamo Shizuno");
    man[1] = Man("Atarashi Ako");
    man[2] = Man("Matsumi Kuro");
    man[3] = Man("Haramura Nodoka");
    int sign = 0;
    for (int i = 1; i <= 3; i++)
        for (int j = 0; j < 4; j++)
            for (int k = 1; k <= 4; k++) man[j].add(s[++sign]);
    for (int j = 0; j < 4; j++) man[j].add(s[++sign]);
    for (int turn = 1; turn <= 21; turn++)
        for (int i = 0; i < 4; i++)
        {
            man[i].add(s[++sign]);
            if (check(man[i]))
            {
                return;
            }
        }
}

int main()
{
    prepare();
    int test;
    for (run = 1; run <= test; run++) work();
}

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

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>

using namespace std ;

#define Maxn 1005

typedef long long LL ;


int main() {
	while (cin >> n>>m>>op ) {
	            for (int i=1;i<=op;i++){
					   cin>>s;
					   if (s[0]=='D'){
						   cin>>xc>>yc>>r>>c;
						   for (int j=xc-r;j<=xc+r;j++){
							      up=yc+r-abs(xc-j);
							      down=yc-(r-abs(xc-j));
						          update(j,up,down,c);      //蝨ィ隨ャj譽オ譬台ク雁ー?p蛻ーdown蛹コ髣エ譟捺?c
						   }
					   }
					   if (s[0]=='T'){
						   cin>>xc>>yc>>w>>c>>W;
						   
					   }
					   if (s[0]=='R'){
						   cin>>xc>>yc>>l>>w>>c;
						   for (int j=)
					   }
					   if (s[0]=='C'){
						   cin>>xc>>yc>>rc>>c;
						   
					   }
				}
	}
	return 0 ;
}

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

include<stdio.h>

int main() {

  int i, j;

  for(i = 1; i <= 9; i++) {
    for(j = 1; j <= 9; j++) {
      printf("%d*%d=%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() {
char hoge[100];
gets(hoge);
}

Compiler output:
main.c: In function 'main':
main.c:5:1: error: implicit declaration of function 'gets'; did you mean 'fgets'? [-Wimplicit-function-declaration]
    5 | gets(hoge);
      | ^~~~
      | fgets
Language: C

#include <iostream>

using namespace std;

int main()
{
    int i,j;
    for(i=1;i<=9;i++)
    {
        for(j=1;j<=9;j++)
        {
            cout<<i<<"*"<<j<<"="<<i*j<<endl;
        }
    }
    return 0;
}

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

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

Compiler output:
main.c:1:2: error: invalid preprocessing directive #incldue; did you mean #include?
    1 | #incldue<stdio.h>
      |  ^~~~~~~
      |  include
main.c: In function 'main':
main.c:7:1: error: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
    7 | printf("%d*%d=%d\n",i,j,i*j);
      | ^~~~~~
main.c:1:1: note: include '<stdio.h>' or provide a declaration of 'printf'
  +++ |+#include <stdio.h>
    1 | #incldue<stdio.h>
main.c:7:1: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
    7 | printf("%d*%d=%d\n",i,j,i*j);
      | ^~~~~~
main.c:7:1: note: include '<stdio.h>' or provide a declaration of 'printf'
Language: C

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>

using namespace std;

#define lowbit(x) (x&(-x))
#define LL long long
#define ULL unsigned long long
#define maxn 20005
#define msize 2001
#define mod 1000000009ll
#define CC(m,what) memset(m,what,sizeof(m))
#define inf 0x7f7f7f7f
#define eps 1e-12
#define lson l , mid , fa << 1
#define rson mid + 1 , r , fa << 1 | 1
#define pi acos(-1.0)
#define keytree (ch[ch[root][1]][0])

template<class Z>inline bool checkmax(Z &a,Z b){if(a==-1||a<b){a=b;return true;}return false;}
template<class Z>inline bool checkmin(Z &a,Z b){if(a==-1||a>b){a=b;return true;}return false;}

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

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

Compiler output:
main.c:1:20: warning: extra tokens at end of #include directive
    1 | #include <stdio.h> int main(){int i,j;for(i=1;i<=9;i++)for(j=1;j<=9;j++)printf("%dx%d=%d\n",i,j,i*j);return 0;}
      |                    ^~~
/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>

using namespace std;

int main()
{
    for(int j=1;j<=9;j++)
        for(int i=1;i<10;i++)
            {
                cout<<j<<"x"<<i<<"="<<i*j<<endl;
            }
    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<algorithm>
using namespace std;

struct seg
{
    int a,b;
    bool operator < (const seg p) const
    {
        return a!=p.a?a<p.a:b>p.b;
    }
}s[50000];

int main()
{
    //freopen("d:\\in.txt","r",stdin);
    int l,g;
    while(scanf("%d%d",&l,&g),l||g)
    {
        for(int i=0;i<g;i++)
        {
            int x,r;
            scanf("%d%d",&x,&r);
            s[i].a=x-r;
            s[i].b=x+r;
        }
        sort(s,s+g);
        int cnt=0,pre=0,i=0,fg=1;
        while(i<g&&pre<l)
        {
            int j=i,tmp=pre;
            for(;s[j].a<=pre&&j<g;j++) if(s[j].b>tmp) tmp=s[j].b;
            if(j==0||j>=g&&tmp<l) fg=0;
            i=j,pre=tmp,cnt++;
        }
        printf("%d\n",fg?g-cnt:-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<stdio.h>
int main()
{
int a,b,c;
for(a=1;a<10;i++)
{
for(b=1;b<10;i++)
{
c = a * b;
printf("%dx%d=%d\n");
}
}
return 0;
}

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

include<stdio.h>

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:1:8: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
    1 | include<stdio.h>
      |        ^
Language: C

#include<stdio.h>

int main(){
int i, j;

for(i = 1; i <= 9; i++) {
for(j = 1; j<=9;j++) {
printf("%dx%d=%d\n", i, j, i*j);
    return 0;
}

Compiler output:
main.c: In function 'main':
main.c:10:1: error: expected declaration or statement at end of input
   10 | }
      | ^
main.c:10:1: error: expected declaration or statement at end of input
Language: C

#include <stdio.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <cstring>
using namespace std;

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

int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0;}
double sqr(double x) { return x*x; }

//ツカテセテ篠ャツオテ」
struct pt
{
    double x,y;
    pt(double _x = 0,double _y = 0) { x = _x; y = _y;}
    pt operator + (const pt &a) const { return pt(x+a.x, y+a.y);}
    pt operator - (const pt &a) const { return pt(x-a.x, y-a.y);}
    pt operator * (const double r) const { return pt(x * r, y * r);}
    pt operator / (const double r) const { return pt(x / r, y / r);}
    
	bool operator == (const pt &a) const { return sgn(x-a.x) == 0 && sgn(y-a.y) == 0; }
    
	double len() { return sqrt(x*x + y*y); }
    double ang() { return atan2(y, x); }
	
	pt unit() { double l = len(); return pt(x/l, y/l); }
	pt per()  { return pt(-y, x); }
    
	void rd() { scanf("%lf%lf",&x,&y);}
    void write() { printf("(%.2f, %.2f) ",x, y); }
};
bool CompareByX(const pt &a, const pt &b) {
    return sgn(a.x - b.x) < 0 || (sgn(a.x - b.x) == 0 && sgn(a.y - b.y) < 0);
}
bool CompareByY(const pt &a, const pt &b) {
    return sgn(a.y - b.y) < 0 || (sgn(a.y - b.y) == 0 && sgn(a.x - b.x) < 0);
}

double det(const pt &a,const pt &b) { return a.x*b.y - a.y*b.x; }
double dot(const pt &a,const pt &b) { return a.x*b.x + a.y*b.y; } 

double dis(const pt &a,const pt &b) { return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));}

///////////////////////

const V = 100000 + 10;
int n;
pt p[V];

double closest_pair_point_distance(int l, int r)
{
    vector<pt> back_up;
    
    int mid = (l + r) / 2;
    
    double min_left = closest_pair_point_distance(l, mid);
    double min_right = closest_pair_point_distance(mid+1, r);
    double min_all = min(min_left, min_right);
    
    sort(p+l, p+mid+1, CompareByY);
    sort(p+mid+1, p+r+1, CompareByY);
    
}

int main()
{
    while (cin >> n)
    {
        for (int i = 0; i < n; i++)
            p[i].read();
        
        sort(p, p+n, CompareByX);
        cout << closest_pair_point_distance(0, n-1);
    }    
}

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

//#include<cstdio>
//#include <algorithm>
//#include <cstdlib>
//
//using namespace std;
//
//typedef long long LL;
//
//struct st
//{
//    LL x,y;
//}p[100010];
//
//LL a[100010],b[100010];
//
//int res[100010];
//int cnt;
//LL maxi;
//
//int xl,xr,yl,yr;
//
//LL judge(int x,int y)
//{
//    if(xl <= x && x<=xr && yl<=y && y<=yr)
//        return 0;
//
//    LL ret = 0;
//    if(x < xl)  ret += xl-x;
//    if(x > xr)  ret += x - xr;
//    if(y < yl)  ret += yl-y;
//    if(y > yr)  ret += y - yr;
//    return  ret;
//}
//
//
//int T,n;
//int main()
//{
//    scanf("%d",&T);
//    while(T--)
//    {
//        scanf("%d",&n);
//        for(int i=1; i<=n; i++)
//        {
//            scanf("%I64d%I64d",&p[i].x,&p[i].y);
//            a[i] = p[i].x,b[i] = p[i].y;
//        }
//        sort(a+1,a+1+n);
//        sort(b+1,b+1+n);
//
//
//        if(n%2 == 1)
//        {
//            xl = xr = a[(n+1)/2];
//            yl = yr = b[(n+1)/2];
//        }
//        else
//        {
//            xl = a[n/2],xr = a[n/2+1];
//            yl = b[n/2];yr = b[n/2+1];
//        }
//
//        cnt = 0;
//        maxi = 1000000000000LL;
//        for(int i=1; i<=n; i++)
//        {
//            LL d = judge(p[i].x,p[i].y);
//            if(d < maxi)
//            {
//                maxi = d;
//                cnt = 0;
//                res[++cnt] = i;
//            }
//            else if(d == maxi)
//                res[++cnt] = i;
//        }
//
//        LL ans = 1000000000000LL;
//        for(int i=1; i<=cnt; i++)
//        {
//            LL tmp = 0;
//            for(int j=1; j<=n; j++)
//                tmp += abs(p[i].x-p[j].x) + abs(p[i].y - p[j].y);
//            ans = min(tmp,ans);
//        }
//        printf("%I64d\n",ans);
//
//
//
//
//    }
//
//}
//
//
//

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 <algorithm>
#include <string.h>
#include <cstdio>
#include <vector>
#define eps 1e-8
using namespace std;

struct EDG
{
    int xx, val;
    EDG(int _xx, int _val)
    {
        xx = _xx, val = _val;
    }
};

const int maxn = 100007, maxnum = 100000000, maxzz = 1000000;
      int n, S, T, power;
      double dist[maxn];
      int zz[maxzz];
      bool use[maxn];

vector<EDG> edg[maxn];

void spfa(int S, int power)
{
    for (int i = 1; i <= n; i++) dist[i] = -maxnum, use[i] = false;
    int head = 1, tail = 1;
    zz[head] = S;
    dist[zz[head]] = power, use[zz[head]] = true;
    while (head <= tail)
    {
        int x = zz[head];
        use[x] = false;
        if (dist[x] < dist[T])
        {
            head++;
            continue;
        }
        for (int i = 0; i < edg[x].size(); i++)
        {
            int xx = edg[x][i].xx, val = edg[x][i].val;
            if (dist[xx] < dist[x]*val/100)
            {
                dist[xx] = dist[x]*val/100;
                if (!use[xx]) use[xx] = true, zz[++tail] = xx;
            }
        }
        head++;
    }
}

void work()
{
    for (int i = 1; i <= n; i++) edg[i].clear();
    for (int x = 1; x <= n; x++)
    {
        int k;
        scanf("%d", &k);
        for (int i = 1; i <= k; i++)
        {
            int xx, val;
            scanf("%d%d", &xx, &val);
            val = 100-val;
            edg[x].push_back(EDG(xx, val));
        }
    }
    scanf("%d%d%d", &S, &T, &power);
    spfa(S, power);
    double res = power-dist[T];
    if (res < eps) puts("IMPOSSIBLE!");
    else           printf("%.2f\n", res);
}

int main()
{
    while (scanf("%d", &n) != EOF) work();
}

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

#include <iostream>
#include <algorithm>
#include <string.h>
#include <cstdio>
#include <vector>
#define eps 1e-8
using namespace std;

struct EDG
{
    int xx, val;
    EDG(int _xx, int _val)
    {
        xx = _xx, val = _val;
    }
};

const int maxn = 50007, maxnum = 100000000, maxzz = 1000000;
      int n, S, T, power;
      double dist[maxn];
      int zz[maxzz+7];
      bool use[maxn];

vector<EDG> edg[maxn];

void spfa(int S, int power)
{
    for (int i = 1; i <= n; i++) dist[i] = -maxnum, use[i] = false;
    int head = 1, tail = 1;
    zz[head] = S;
    dist[zz[head]] = power, use[zz[head]] = true;
    while (head != tail+1)
    {
        int x = zz[head];
        use[x] = false;
        if (dist[x] < dist[T])
        {
            if (++head > maxzz) head = 1;
            continue;
        }
        for (int i = 0; i < edg[x].size(); i++)
        {
            int xx = edg[x][i].xx, val = edg[x][i].val;
            if (dist[xx] < dist[x]*val/100)
            {
                dist[xx] = dist[x]*val/100;
                if (!use[xx])
                {
                    use[xx] = true;
                    if (++tail > maxzz) tail = 1;
                    zz[tail] = xx;
                }
            }
        }
        head++;
    }
}

void work()
{
    for (int i = 1; i <= n; i++) edg[i].clear();
    for (int x = 1; x <= n; x++)
    {
        int k;
        scanf("%d", &k);
        for (int i = 1; i <= k; i++)
        {
            int xx, val;
            scanf("%d%d", &xx, &val);
            val = 100-val;
            edg[x].push_back(EDG(xx, val));
        }
    }
    scanf("%d%d%d", &S, &T, &power);
    spfa(S, power);
    double res = power-dist[T];
    if (res < eps) puts("IMPOSSIBLE!");
    else           printf("%.2f\n", res);
}

int main()
{
    while (scanf("%d", &n) != EOF) work();
}

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

#include<stdio.h>
#include<conio.h>

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

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

#include<iostream>
#include<algorithm>
using namespace std;

#define lson u<<1
#define rson u<<1|1
#define MAXN 50005

struct Node{
	int lef,rig;
	int lsom,msum,rsom;//lsom隶ー蠖募玄髣エ蟾ヲ遶ッ譛?、ァ遨コ逋ス蛹コ?罫som隶ー蠖募承遶ッ?稽sum隶ー蠖墓紛荳ェ蛹コ髣エ譛?、ァ遨コ逋ス蛹コ
}T[MAXN<<2];

void Build(int u,int l,int r){
	T[u].lef=l;
	T[u].rig=r;
	T[u].lsom=T[u].rsom=T[u].msum=r-l+1;
	if(l==r)return;
	int mid=(l+r)>>1;
	Build(lson,l,mid);
	Build(rson,mid+1,r);
}

void Check_in(int u,int size){
	if(T[u].lsom>=size){}
}

int main(){}

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

/*========================================
	prim邂玲ウ穂ク堺サ?サ?庄莉・豎よ怙蟆冗函謌先??御ケ溷庄莉・豎や?譛?、ァ逕滓?譬鯛?縲よ怙蟆丞牡髮?toer-Wagner邂玲ウ募ーア譏ッ蜈ク蝙狗噪蠎皮畑螳樔セ九?
	豎りァ」譛?ー丞牡髮?勸驕埼?逕ィStoer-Wagner邂玲ウ包シ御ク肴署萓帶ュ、邂玲ウ戊ッ∵?蜥御サ」遐?シ悟宵謠蝉セ帷ョ玲ウ墓?霍ッ??
	1.min=MAXINT?悟崋螳壻ク?クェ鬘カ轤ケP
	2.莉守せP逕ィ邀サ莨シprim逧г邂玲ウ墓黄螻募?窶懈怙螟ァ逕滓?譬鯛??瑚ョー蠖墓怙蜷取黄螻慕噪鬘カ轤ケ蜥梧怙蜷取黄螻慕噪霎ケ
	3.隶。邂玲怙蜷取黄螻募芦逧?。カ轤ケ逧??蜑イ蛟シ?亥叉荳取ュ、鬘カ轤ケ逶ク霑樒噪謇?怏霎ケ譚?柱?会シ瑚凶豈芭in蟆乗峩譁ーmin
	4.蜷亥ケカ譛?錘謇ゥ螻慕噪驍」譚。霎ケ逧?ク、荳ェ遶ッ轤ケ荳コ荳?クェ鬘カ轤ケ?亥ス鍋┯莉紋サャ逧?セケ荵溯ヲ∝粋蟷カ?瑚ソ吩クェ螂ス逅?ァ」蜷ァ?滂シ?
	5.霓ャ蛻ー2?悟粋蟷カN-1谺。蜷守サ捺據
	6.min蜊ウ荳コ謇?アゑシ瑚セ灘?min
	prim譛ャ霄ォ螟肴揩蠎ヲ譏ッO(n^2)?悟粋蟷カn-1谺。?檎ョ玲ウ募、肴揩蠎ヲ蜊ウ荳コO(n^3)
	螯よ棡蝨ィprim荳ュ蜉??莨伜喧?悟、肴揩蠎ヲ莨夐剄荳コO((n^2)logn) 縲?
========================================*/
/*
	豁、鬚俶弍 譌?髄蝗セ 蜈ィ螻?怙蟆丞牡s-w邂玲ウ慕噪 荳?クェ蠕亥・ス逧?コ皮畑
	證エ蜉帛悉髯、荳?クェ轤ケ?檎┯蜷取アょ?莉也せ逧?怙蟆丞牡縲?
	蜑イ霎ケ髮??螳槫ーア譏ッ maxv轤ケ逧?桷謌?蜥?W髮?粋荳ュ逧?せ 
	逶ク霑樒噪霎ケ?檎┯蜷?maxv轤ケ逧?桷謌?謌台スソ逕ィ莠?ケカ譟・髮?シ瑚ソ呎?蟆ア蜿ッ莉・蛻、譁ュ荳、荳ェ髮?粋莠?シ御サ手?譖エ譁ー蜑イ霎ケ縲?
*/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int maxn=100;
const int maxm=maxn*maxn;
const int INFI=999999999;

struct data
{
	int id,v;
} edge[maxn][maxn],bak[maxn][maxn];

bool use[maxm];
int node[maxm],dist[maxm],root[maxm],fa[maxm];
int put[maxn*maxn];
int n,m,ans;

int find(int v)
{
	if ( fa[v]!=v )
		fa[v]=find(fa[v]);
	return fa[v];
}
void updata(int x,int v)
{
	int len=0;
	for (int i=1;i<=n;i++)
		root[i] = find(i);
	
	for (int i=1;i<=n;i++)
	if ( root[i]==root[v] && i!=x )
		for (int j=1;j<=n;j++)
		if ( root[j]!=root[v] && edge[i][j].id>0 && j!=x )
			put[++len]=bak[i][j].id;
	
	put[0]=len;
}
void Union(int a,int b)
{
	if (find(a) != find(b))
		fa[find(a)] = find(b);
}
void prim(int x)
{
	int len=0,S;
	for (int i=1;i<=n;i++)
	{
		if (i != x) 
			node[++len]=i;
		fa[i]=i;
	}
	while ( len>1 )
	{
		S = node[1];
		for (int i=1;i<=len;i++)
		{
			dist[ node[i] ] = edge[S][node[i]].v;
			use[i] = false;
		}
		use[1] = 1;
		int maxv = 1, prev;
		for (int tt=2;tt<=len;tt++)
		{
			int maxd = -INFI;
			prev = maxv;
			for (int i=1;i<=len;i++)
			if (!use[i] && dist[node[i]] > maxd)
			{
				maxd = dist[node[i]];
				maxv = i;
			}
			use[maxv] = true;
			for (int i=1;i<=len;i++)
			if ( !use[i] )
				dist[node[i]] += edge[ node[maxv] ][node[i]].v;	
		}
		if (dist[node[maxv]] < ans) 
		{
			ans = dist[node[maxv]];
			updata(x,node[maxv]);
		}
		for (int i=1;i<=len;i++)
			edge[node[i]][node[prev]].v = edge[node[prev]][node[i]].v += edge[node[maxv]][node[i]].v;
			
		Union(node[prev], node[maxv]);
		node[maxv] = node[len--];
	}	
}
int main()
{
	int a,b,c;
	scanf("%d%d",&n,&m);
	memset(edge,0,sizeof(edge));
	for (int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		edge[a][b].id = i;
		edge[a][b].v = +c; 
		edge[b][a].id = i;
		edge[b][a].v = +c;
	}
	memcpy(bak,edge,sizeof(edge));
	ans = INFI;
	
	for (int i=1;i<=n;i++)
	{
		memcpy(edge,bak,sizeof(bak));
		prim(i);
	}
	sort(put+1,put+put[0]+1);
	printf("%d\n",ans);
	printf("%d\n",put[0]);
	for (int i=1;i<=put[0];i++)
	{
		if ( i<put[0] )
			printf("%d ",put[i]);
		else
			printf("%d",put[i]);
	}
	printf("\n");
}

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

1 1
2 1
3 1
4 0
5 0
6 0
7 0
8 0
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 0
17 0
18 0
19 0
20 0
21 0
22 0
23 0
24 0
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 0
37 0
38 0
39 0
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61 1
62 1
63 1
64 0
65 0
66 0
67 0
68 0
69 0
70 0
71 0
72 0
73 0
74 0
75 0
76 0
77 0
78 0
79 0
80 0
81 1
82 1
83 1
84 1
85 1
86 1
87 1
88 1
89 1
90 1
91 1
92 1
93 1
94 1
95 1
96 1
97 1
98 1
99 1
100 0
101 0
102 0
103 0
104 0
105 0
106 0
107 0
108 0
109 0
110 0
111 0
112 0
113 0
114 0
115 0
116 0
117 0
118 0
119 0
120 0
121 1
122 1
123 1
124 1
125 1
126 1
127 1
128 1
129 1
130 1
131 1
132 1
133 1
134 1
135 1
136 1
137 1
138 1
139 1
140 1
141 1
142 1
143 1
144 0
145 0
146 0
147 0
148 0
149 0
150 0
151 0
152 0
153 0
154 0
155 0
156 0
157 0
158 0
159 0
160 0
161 0
162 0
163 0
164 0
165 0
166 0
167 0
168 0
169 1
170 1
171 1
172 1
173 1
174 1
175 1
176 1
177 1
178 1
179 1
180 1
181 1
182 1
183 1
184 1
185 1
186 1
187 1
188 1
189 1
190 1
191 1
192 1
193 1
194 1
195 1
196 0
197 0
198 0
199 0
200 0
201 0
202 0
203 0
204 0
205 0
206 0
207 0
208 0
209 0
210 0
211 0
212 0
213 0
214 0
215 0
216 0
217 0
218 0
219 0
220 0
221 0
222 0
223 0
224 0
225 1
226 1
227 1
228 1
229 1
230 1
231 1
232 1
233 1
234 1
235 1
236 1
237 1
238 1
239 1
240 1
241 1
242 1
243 1
244 1
245 1
246 1
247 1
248 1
249 1
250 1
251 1
252 1
253 1
254 1
255 1
256 0
257 0
258 0
259 0
260 0
261 0
262 0
263 0
264 0
265 0
266 0
267 0
268 0
269 0
270 0
271 0
272 0
273 0
274 0
275 0
276 0
277 0
278 0
279 0
280 0
281 0
282 0
283 0
284 0
285 0
286 0
287 0
288 0
289 1
290 1
291 1
292 1
293 1
294 1
295 1
296 1
297 1
298 1
299 1
300 1

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

void RectangularArea()
{
    int i;
    high[0] = high[n + 1] = -1;      //蛻晏ァ句喧霎ケ逡鯉シ碁亟豁「雜顔阜蛻、髞?

    for (i = 1; i <= n; i ++)     //謚獲eft[], right[]襍句?荳コ譛ャ霄ォ
        left[i] = right[i] = i;

    for (i = 1; i <= n; i ++)
    {
        while(high[left[i] - 1] >= high[i])  //遑ョ螳嗟[i]逧?怙鬮伜キヲ菴咲スョ
            left[i] = left[left[i] - 1];
    }
    for (i = n; i >= 1; i --)
    {
        while (high[right[i] + 1] >= high[i])   //遑ョ螳嗷[i]逧?怙鬮伜承菴咲スョ
            right[i] = right[right[i] + 1];
    }
    int ans = 0;
    for (i = 1; i <= n; i ++)
        ans = Max(high[i] * (right[i] - left[i] + 1), ans); //蠕怜芦譛?、ァ逧?ソ樒サュ遏ゥ蠖「髱「遘ッ?亥黒菴埼柄蠎ヲ譏ッ1??
    printf("%d\n", ans);
}

Compiler output:
main.c: In function 'RectangularArea':
main.c:4:5: error: 'high' undeclared (first use in this function)
    4 |     high[0] = high[n + 1] = -1;      //蛻晏ァ句喧霎ケ逡鯉シ碁亟豁「雜顔阜蛻、髞?
      |     ^~~~
main.c:4:5: note: each undeclared identifier is reported only once for each function it appears in
main.c:4:20: error: 'n' undeclared (first use in this function)
    4 |     high[0] = high[n + 1] = -1;      //蛻晏ァ句喧霎ケ逡鯉シ碁亟豁「雜顔阜蛻、髞?
      |                    ^
main.c:7:9: error: 'left' undeclared (first use in this function)
    7 |         left[i] = right[i] = i;
      |         ^~~~
main.c:7:19: error: 'right' undeclared (first use in this function)
    7 |         left[i] = right[i] = i;
      |                   ^~~~~
main.c:21:15: error: implicit declaration of function 'Max' [-Wimplicit-function-declaration]
   21 |         ans = Max(high[i] * (right[i] - left[i] + 1), ans); //蠕怜芦譛?、ァ逧?ソ樒サュ遏ゥ蠖「髱「遘ッ?亥黒菴埼柄蠎ヲ譏ッ1??
      |               ^~~
main.c:22:5: error: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
   22 |     printf("%d\n", ans);
      |     ^~~~~~
main.c:1:1: note: include '<stdio.h>' or provide a declaration of 'printf'
  +++ |+#include <stdio.h>
    1 | void RectangularArea()
main.c:22:5: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
   22 |     printf("%d\n", ans);
      |     ^~~~~~
main.c:22:5: note: include '<stdio.h>' or provide a declaration of 'printf'
Language: C

#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#define N 1010
#define mod 100000007
#define LL __int64
using namespace std;

//const int maxn=1000010;
//LL a,b;
//int T,cnt=0;
//bool isprm[maxn];
//int prm[maxn];
//
//int main()
//{
//    memset(isprm,1,sizeof(isprm));
//    for(int i=2;i<maxn;i++) if(isprm[i])
//    {
//        for(int j=i+i;j<maxn;j+=i) isprm[j]=0;
//        prm[cnt++]=i;
//    }
//    scanf("%d",&T);
//    int cas=1;
//    while(T--)
//    {
//        scanf("%I64d%I64d",&a,&b);
//        int lim=min(sqrt(a*1.0),sqrt(b*1.0))+1;
//        bool fg=1;
//        for(int i=0;prm[i]<=lim;i++)
//        {
//            if(a%prm[i]==0||b%prm[i]==0)
//            {
//                if(a%prm[i]==0&&b%prm[i]==0)
//                {
//                    while(a%prm[i]==0) a/=prm[i];
//                    while(b%prm[i]==0) b/=prm[i];
//                }
//                else fg=0;
//            }
//        }
//        if(a!=b) fg=0;
//        printf("Case #%d: %s\n",cas++,fg?"YES":"NO");
//    }
//    return 0;
//}

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

# include <cstring>
# include <cstdio>
# include <cstdlib>
# include <iostream>
using namespace std;
# define N 2000
char s[N][15];
int dp[15][15];
int len[N];
inline int abss (int x)
{
	return x>0?x:-x;
}
int main (void)
{
	int t,ys=0,n,m;
	scanf("%d",&t);
	for (int i=1;i<=11;i++)
		dp[0][i]=dp[i][0]=i;
	while (t--)
	{
		scanf("%d%d",&n,&m);
		for (int i=1;i<=n;i++)
		{
			scanf("%s",s[i]+1);
			len[i]=strlen(s[i]+1);
		}
		char ss[15];
		int k;
		printf("Case #%d:\n",++ys);
		while (m-->0)
		{
			scanf("%s%d",ss+1,&k);
			int ans=0,len1=strlen(ss+1);
			for (int i=1;i<=n;i++)
			{
				if (k>=max(len1,len[i]))
				{
					ans++;
					continue;
				}
				if (k<abss(len1-len[i]))
					continue;
				int flag=1;
				for (int x=1;x<=len[i] && flag;x++)
					for (int y=1;y<=len1 && flag;y++)
					{
						if (s[i][x]==ss[y])
							dp[x][y]=dp[x-1][y-1];
						else
						{
							dp[x][y]=min(dp[x-1][y],dp[x][y-1])+1;
							dp[x][y]=min(dp[x][y],dp[x-1][y-1]+1);
						}
						if (max(len[i]-x,len1-y)<=k-dp[x][y])
						{
							ans++;
							flag=0;
						}
					}
				if (flag)
					ans++;
			}
			printf("%d\n",ans);
		}
	}
	return 0;
}

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