submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | language stringclasses 3
values | code stringlengths 1 522k | compiler_output stringlengths 43 10.2k |
|---|---|---|---|---|
s571249166 | p00000 | 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;
} | 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
|
s611183347 | p00000 | 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;
... | main.c:2:10: fatal error: iostream: No such file or directory
2 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s658396664 | p00000 | 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... | /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
|
s243568561 | p00000 | 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, ... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s573456738 | p00000 | 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, p... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s789325507 | p00000 | 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;
} ... | main.c:2:9: fatal error: conio.h: No such file or directory
2 | #include<conio.h>
| ^~~~~~~~~
compilation terminated.
|
s488207373 | p00000 | 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].r... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s852037476 | p00000 | C | /*========================================
prim邂玲ウ穂ク堺サ?サ?庄莉・豎よ怙蟆冗函謌先??御ケ溷庄莉・豎や?譛?、ァ逕滓?譬鯛?縲よ怙蟆丞牡髮?toer-Wagner邂玲ウ募ーア譏ッ蜈ク蝙狗噪蠎皮畑螳樔セ九?
豎りァ」譛?ー丞牡髮?勸驕埼?逕ィStoer-Wagner邂玲ウ包シ御ク肴署萓帶ュ、邂玲ウ戊ッ∵?蜥御サ」遐?シ悟宵謠蝉セ帷ョ玲ウ墓?霍ッ??
1.min=MAXINT?悟崋螳壻ク?クェ鬘カ轤ケP
2.莉守せP逕ィ邀サ莨シprim逧г邂玲ウ墓黄螻募?窶懈怙螟ァ逕滓?譬鯛??瑚ョー蠖墓怙蜷取黄螻慕噪鬘カ轤ケ蜥梧怙蜷取黄螻慕噪霎ケ
3.隶。邂玲怙蜷取黄螻募芦逧?。カ轤ケ逧... | main.c:21:9: fatal error: algorithm: No such file or directory
21 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s269489873 | p00000 | 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... | main.c:1:1: error: expected identifier or '(' before numeric constant
1 | 1 1
| ^
|
s199294673 | p00000 | 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] = lef... | 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' undecl... |
s289853614 | p00000 | 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()
//{
// m... | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s144486658 | p00000 | 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--)
... | main.c:1:11: fatal error: cstring: No such file or directory
1 | # include <cstring>
| ^~~~~~~~~
compilation terminated.
|
s259070272 | p00000 | C | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<stdio.h>
#include<string.h>
using namespace std;
const int N = 2010;
int r[N*2],l[N*2],h[N*2];
char map[N][N];
inline int cal(int l,int r)
{
return r/2-(l-1)/2;
}
int rec(int h[],int n,int flag)
{
h[0]=h[n+1]=-1;
for(int... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s777351930 | p00000 | C | #include <iostream>
#include <cstdio>
#include <algorithm>
#define MAX (1<<18)
#define M (1<<17)
using namespace std;
struct Node {
int l[2],r[2],m[2],sum[2];
int op;
} Tree[MAX];
void push_up(int s) {
for(int i(0);i!=2;++i) {
Tree[s].sum[i] = Tree[s<<1].sum[i]+Tree[s<<1^1].sum[i];
if(Tree[s<<1].sum[i^1]=... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s504517546 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
#define N 300
typedef long long LL;
LL a[10][N];
LL val1[N*N],val2[N... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s255996478 | p00000 | C | #include<cstdio>
#include<cstring>
const int N = 205;
typedef long long ll;
int a[5][N],rd,ed;
ll q[N*N*20];
int u[N*N*20];
int f(ll v)
{
int rt=(v%rd)*(v%rd+1)%rd;
if(rt<0)rt+=rd;
return rt;
}
void hash(int x,ll v)
{
if(u[x]==-1)
{
u[x]=0;
q[x]=v;
return;
}
while(u[x]!=0)
x=u[x];
u[x]=ed;
x=u[x];
ed+... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s515851861 | p00000 | C | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define maxn 201001
int wa[maxn],wb[maxn],wv[maxn],WS[maxn];
int cmp(int *r,int a,int b,int l)
{
return r[a]==r[b]&&r[a+l]==r[b+l];
}
void da(int *r,int *sa,int n,int m)
{
int i,j,p,*x=wa,*y=wb,*t;
for(i=0;i<m;i++)WS[i]=0;... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s726109134 | p00000 | C | //#include<stdio.h>
//#include<algorithm>
//#include<string.h>
//#include<vector>
//#include<math.h>
//struct TPoint {
// double x, y;
//};
//using namespace std;
//#define N 1100
//#define EPS 1e-6
//struct TPoint p1[N], p2[N];
//double dis(TPoint a, TPoint b) {
// return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y... | main.c:101:10: fatal error: iostream: No such file or directory
101 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s838608484 | p00000 | C | 30
1
2
1000000000
41
19028315
927
193885869
22394
765366
100700763
1000000000
999999999
999999998
999999997
999999996
999999995
999999994
999999993
999999992
999999991
874
304205
4764
823832483
118
371
678
163028
504110219
132780
Case 1: 2
Case 2: 49
Case 3: 400157471
Case 4: 339006498
Case 5: 58074093... | main.c:1:1: error: expected identifier or '(' before numeric constant
1 | 30
| ^~
|
s790291892 | p00000 | C | const int N=10010;
const int E=200010;
class Graph
{
public:
int pnt[E],nxt[E],id[E];
int head[N],nv,ne;
void init(const int v)
{
nv=v;
ne=0;
memset(head,255,sizeof(head));
}
void add(const int u,const int v,const int i)
{
pnt[ne]=v,id[ne]=i,nxt[ne]=head[u],head[u]=ne++;
pnt[ne]=u,id[ne]=i,nxt[ne]=... | main.c:4:1: error: unknown type name 'class'
4 | class Graph
| ^~~~~
main.c:5:1: error: expected '=', ',', ';', 'asm' or '__attribute__' before '{' token
5 | {
| ^
main.c:22:2: warning: data definition has no type or storage class
22 | }ga,gb;
| ^~
main.c:22:2: error: type defaults to 'int... |
s542372153 | p00000 | C | qweqewqrgvl
vmebnklvndkls
vm slafnkdvn
mvsl;adfk
vmsl;adfmngv
v,s;adfl | main.c:1:1: error: unknown type name 'qweqewqrgvl'
1 | qweqewqrgvl
| ^~~~~~~~~~~
main.c:3:1: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'vm'
3 | vm slafnkdvn
| ^~
main.c:3:1: error: unknown type name 'vm'
main.c:4:6: error: unknown type name 'adfk'
4 | mvsl;adfk
| ... |
s325977164 | p00000 | C | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define lson u<<1
#define rson u<<1|1
#define MAXN 100010
//#define Max(a,b,c) ((a)>(b)?(a)>(c)?(a):(c):(b)>(c)?(b):(c))
int dat[MAXN];
struct Node {
int lef,rig;
int lsum,rsum,msum;//蟾ヲ遶ッ譛?柄霑樒サュ1?悟承遶ッ譛?柄霑樒サュ1?悟玄髣エ譛?柄霑... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s570443365 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
const int MAXN = 400100;
const int m = 10;
int val[MAXN], mp[11][... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s539182217 | p00000 | C | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=50005;
const double inf=1e15;
const double eps=1e-12;
struct A
{
int a,b,c,d;
}l[N],r[N];
double x[N],w[N];
void init(int n)
{
int i;
l[0].a=l[0].b=l[0].c=l[0].d=0;
for (i=1; i<=n... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s655090523 | p00000 | C | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<vector>
#include<map>
#include<string>
using namespace std;
const int maxn = 100100;
int n, first[maxn], cnt;
struct Arc
{
int v, next;
}arc[maxn*2];
int w[maxn], K;
int ans[maxn];
int q[m... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s548205450 | p00000 | C | #include<stdio.h>
main()
{
int l, m;
for(l=1; l<=9; l++)
for(m=1; m<=9; m++)
printf(" %d x %d = %d", l, m. l*m);
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:9:30: error: request for member 'l' in something not a structure or union
9 | printf(" %d x %d = %d", l, m. l*m);
| ^
|
s042577461 | p00000 | C | #include<stdio.h>
main()
{
int l, m;
for(l=1; l<=9; l++)
for(m=1; m<=9; m++)
printf( %d x %d = %d, l, m. l*m,);
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:9:10: error: expected expression before '%' token
9 | printf( %d x %d = %d, l, m. l*m,);
| ^
|
s605823786 | p00000 | C | #include<stdio.h>
main()
{
int n, m;
for(n=1; n<=9; l++)
for(m=1; m<=9; m++)
printf( %d x %d = %d, n, m. n*m,);
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:6:17: error: 'l' undeclared (first use in this function)
6 | for(n=1; n<=9; l++)
| ^
main.c:6:17: note: each undeclared identifier is reported only once for each fu... |
s975842993 | p00000 | C | #include<stdio.h>
main()
{
int n, m;
for(n=1; n<=9; n++){}
for(m=1; m<=9; m++){}
printf( %d x %d = %d, n, m, n*m,);
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:9:10: error: expected expression before '%' token
9 | printf( %d x %d = %d, n, m, n*m,);
| ^
|
s993729090 | p00000 | C | #include<stdio.h>
main()
{
int n, m;
for(n=1; n<=9; n++){}
for(m=1; m<=9; m++){}
printf( %d\n x %d\n = %d\n, n, m, n*m,);
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:9:10: error: expected expression before '%' token
9 | printf( %d\n x %d\n = %d\n, n, m, n*m,);
| ^
main.c:9:12: error: stray '\' in program
9 | printf( %d\n x %d\n = ... |
s038687475 | p00000 | C | #include<stdio.h>
main()
{
int n, m;
for(n=1; n<=9; n++){}
for(m=1; m<=9; m++){}
printf( %d\n x %d\n =%d\n, n, m, n*m,);
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:9:10: error: expected expression before '%' token
9 | printf( %d\n x %d\n =%d\n, n, m, n*m,);
| ^
main.c:9:12: error: stray '\' in program
9 | printf( %d\n x %d\n =%d... |
s948913650 | p00000 | C | #include<stdio.h>
main()
{
int n, m;
for(n=1; n<=9; n++){
for(m=1; m<=9; m++){
printf( %d x %d =%d\n, n, m, n*m,);
}
}
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main()
| ^~~~
main.c: In function 'main':
main.c:8:10: error: expected expression before '%' token
8 | printf( %d x %d =%d\n, n, m, n*m,);
| ^
main.c:8:21: error: stray '\' in program
8 | printf( %d x %d =%d\n, n, m... |
s075205694 | p00000 | C | #include<stdio.h>
main(){
int n, m;
for(n=1; n<=9; n++){
for(m=1; m<=9; m++){
printf("%dx%d=%d\n", n, m, n*m,);
}
}
return(0);
} | main.c:3:1: error: return type defaults to 'int' [-Wimplicit-int]
3 | main(){
| ^~~~
main.c: In function 'main':
main.c:7:33: error: expected expression before ')' token
7 | printf("%dx%d=%d\n", n, m, n*m,);
| ^
|
s786038201 | p00000 | C | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<vector>
#include<map>
#include<string>
using namespace std;
const int maxn = 2100;
int n, C, K, M,first[maxn], cnt;
struct Arc
{
int v, next;
}arc[maxn*2];
int q[maxn];
int state[maxn];
pa... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s572411565 | p00000 | C | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<vector>
#include<map>
#include<string>
using namespace std;
#define MID(x,y) (((x)+(y))/2)
const int N = 100100;
const int M = 200100;
const int Q = 11;
typedef long long LL;
struct O
{
... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s299765905 | p00000 | 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;
} | main.c: In function 'main':
main.c:7:11: error: expected expression before '%' token
7 | printf(%dx%d=%d\n,i,j,i*j);
| ^
main.c:7:19: error: stray '\' in program
7 | printf(%dx%d=%d\n,i,j,i*j);
| ^
|
s845667552 | p00000 | C | #include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 100010;
int sz[N],dep[N],fa[N],son[N],val[N],top[N];
int g[N],d[N];
vector<int> edge[N],pos[N];
int loc=0;
void dfs(int x,int dp,int pa)
{
fa[x]=pa;
sz[x]=1;
dep[x]=dp;
son[x]=0;... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s233454309 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
#define min(x , y) ((x) > (y) ? (y) : (x))
#define max(x , y) ((x) ... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s687186264 | p00000 | C | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
#define M 40
const int MOD=1000000007;
int f[M+5][M+5][5][5][5][5][2];
int cs[5][5][5][5];
int n,m;
void init(void);
void fz(int i,int j,int a,int b,int c,int d,int st);
int main()
{
freopen("data.... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s862166945 | p00000 | C | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int a[110][1010],sum[110][1010],dp[110][1010];
struct node{
int cc;
int id;
}tmp1[1010],tmp2[1010];
int cmp(node aa,node bb){
return aa.cc>bb.cc;
}
main(){
int n,m,x,t;
scanf("%d%d%d%d",&n,&m,&x,&t);
memset(a,0,sizeof(a)... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s467734245 | p00000 | C | #include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1005;
const int M = 52;
const int INF = 2000000011;
struct P
{
int p,e;
}data[M][N];
bool cmp(P a,P b)
{
return a.p<b.p;
}
int dp[M][N],q[N],top,tail;
int abs(int x){return x>0?x:-x;}
int cost(int i,int k,int j)
{
ret... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s164434845 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <algorithm>
#define DBLE 1e-8
#define PI 3.1415926535898
#define MAXN 310
#define INF 800000000
using namespace std;
int matrix[MAXN][MAXN],n;
int dp[MAXN];
int SPFA()
{
bool visit[MAXN]={0};
i... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s192946097 | p00000 | C | #include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#define REP(i,n) for(int i=0;i<n;i++)
#define N 32
using namespace std;
int A,B,C,D,E;
int alla,allb,allc,alld,alle;
double dp[N][N][N][N][2];
const int base=16;
double f(int a,int b,int c,int d,int e)
{
if (a<=0 && b<=0 && c<=0 && d<=0) return ... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s584329873 | p00000 | C | j;main(i){for(;j>8?j=i++<9:++j;printf("%dx%d=%d\n",i,j,i*j));} | main.c:1:1: warning: data definition has no type or storage class
1 | j;main(i){for(;j>8?j=i++<9:++j;printf("%dx%d=%d\n",i,j,i*j));}
| ^
main.c:1:1: error: type defaults to 'int' in declaration of 'j' [-Wimplicit-int]
main.c:1:3: error: return type defaults to 'int' [-Wimplicit-int]
1 | j;main(i){for(;j>8... |
s256679751 | p00000 | C | #include<cstdio>
#include<algorithm>
#include<math.h>
using namespace std;
const int MAXN=1200;
const double pi=acos(-1.0);
const double eps=e-8;
struct point{
double x,y;
};
struct node{
double a;
int ind;
};
node t[MAXN*2];
point p[MAXN];
int s[MAXN][MAXN];
int ss[MAXN][MAXN];
int seg[MAXN][MAXN],sseg[MAX... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s285619068 | p00000 | C | #include <cstdio>
#include <cstring>
using namespace std;
const int Prime[16] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
const int Orz = 64;
long long N, MaxAP;
int MaxFacNum;
void DFS(int i, int FacNum, int MaxPow, long long AP)
{
if (FacNum>MaxFacNum || (FacNum==MaxFacNum && AP<MaxAP))
{
Ma... | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s003356722 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int gcd(int a,int b){
return b ? gcd(b, a%b) : a;
}
void ExGcd(int a,int b,int &d,int &x,int &y){
if(!b) {d = a;x = 1;y = 0;}
else {ExGcd(b, a%b, d, y, x); y -= x*(a/b);}
}
int main()
{
freopen("in.txt","r",stdin);
i... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s706278656 | p00000 | C | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
double dp[1010][1010][2];
double t[1010][1010][2];
struct node{
double x,c;
int id;
node(){
id=-1;
}
};
node g[1010];
int cmp(node a,node b){
return a.x<b.x;
}
main(){
int n;
double v,p;
w... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s705152183 | p00000 | C | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#define M (1<<15)
#define MAX (1<<16)
using namespace std;
int Tree[MAX];
void add(int s,int t) {
int i(1);
for(s = s+M-1,t = t+M+1;s^t^1;s>>=1,t>>=1,i<<=1) {
if(~s&1) Tree[s^1]+=i;
if( t&1) Tree[t^1]+=i;
}
}
in... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s188400233 | p00000 | C | #include <cstdio>
#include <cmath>
#define eps 1e-4
double len[110],PI=acos(-1.0);
int n;
double cals(double bc)
{
int i;
double p,ans=0;
for(i=1;i<n;i++)
{
p=(len[i]+len[i+1]+bc)/2.0;
ans+=sqrt(p*(p-len[i])*(p-len[i+1])*(p-bc));
}
p=(len[1]+len[n]+bc)/2.0;
ans+=sqrt(p*(p-l... | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s959561428 | p00000 | C | #include<stdio.h>
int main(void){
int i,j;
for(i=1;i<9;i++){
for(j=1;j<9;j++){
printf("%d×%d=%d",i,j,i*j)
}
}
return 0;
} | main.c: In function 'main':
main.c:6:31: error: expected ';' before '}' token
6 | printf("%d×%d=%d",i,j,i*j)
| ^
| ;
7 | }
| ~
|
s657599906 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
typedef double DB;
const int N = 100010;
set<pair<int,int> > st;
set<pair<int,int> >::iterator it;
pai... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s451318400 | p00000 | C | #include<cstdio>
#include<cstring>
#include<algorithm>
#include <map>
using namespace std;
const int MAX = 100010;
int arr[MAX],n,tot;
int low(int x)
{
return x&(-x);
}
void add(int pos,int v)
{
for(int i=pos; i<=tot; i+=low(i))
arr[i] += v;
}
int sum(int pos)
{
int ret = 0;
for(int i=pos; i... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s720339611 | p00000 | C | #include<cstdio>
#include<cstring>
#include<algorithm>
#include <map>
using namespace std;
const int MAX = 100010;
int arr[2*MAX],arr2[2*MAX],n,tot;
int low(int x)
{
return x&(-x);
}
void add(int arr[], int pos,int v)
{
for(int i=pos; i<=tot; i+=low(i))
arr[i] += v;
}
int sum(int arr[], int pos)
{
... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s007684160 | p00000 | C | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<set>
#include<iostream>
using namespace std;
int a[20],c[3],n,t;
typedef pair<int,int>p;
set<p>s;
void dfs(int k)
{
if(k==n)
{
int d[3];
for(int i=0;i<3;i++) d[i]=c[i];
sort(d,d+3);
for(int i=0;i<3;i++) if(c[i]!=d[i]) retu... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s390244469 | p00000 | C | 200
0 1 0 0
0 2 0 0
0 3 0 0
0 4 0 0
0 5 0 0
1 6 1 1
0 7 0 1
1 8 1 2
1 9 1 3
1 10 3 4
0 11 0 4
1 12 3 5
0 13 0 5
1 14 5 6
0 15 4 6
0 16 4 6
0 17 0 6
1 18 7 7
0 19 0 7
1 20 7 8
0 21 6 8
1 22 9 9
0 23 0 9
1 24 9 10
1 25 3 11
1 26 11 12
0 27 6 12
1 28 11 13
0 29 0 13
1 30 15 14
0 31 0 14
1 32 11 15
0 33 10 15
1 34 15 16
0 ... | main.c:1:1: error: expected identifier or '(' before numeric constant
1 | 200
| ^~~
|
s626001412 | p00000 | C | 1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 2
9 3
10 4
11 4
12 5
13 5
14 6
15 6
16 6
17 6
18 7
19 7
20 8
21 8
22 9
23 9
24 10
25 11
26 12
27 12
28 13
29 13
30 14
31 14
32 15
33 15
34 16
35 16
36 16
37 16
38 17
39 17
40 18
41 18
42 19
43 19
44 20
45 20
46 21
47 21
48 22
49 23
50 24
51 24
52 25
53 25
54 26
55 26
56 27
57 27
58 28
59 2... | main.c:1:1: error: expected identifier or '(' before numeric constant
1 | 1 0
| ^
|
s420496646 | p00000 | C | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
using namespace std;
#define F first
#define S second
#define MP(x, y) make_pair(x, y)
typedef unsigned long long LL;
LL cal(LL x)
{
if (x<=2) retur... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s295826964 | p00000 | C | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int num[50];
double dp[50];
double dfs(int l,bool e)
{
if(l==-1) return 1;
if(!e&&dp[l]!=-1) return dp[l];
int u=e?num[l]:1;
double res=0;
for(int i=0;i<=u;i++)
{
res+=((double)1/((double)2*l)+(double)(l-1)/l*dfs(l-1,e&&i==u));
}
retu... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s066882639 | p00000 | C | #include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<vector>
using namespace std;
#define maxn 1009
#define maxm 300000
#define inf (1<<29)
struct edge{
int v,flow;
int next;
};
edge e[maxm];
int start[maxn];
int nn,n,m,s,t;
int sum;
void in... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s832122074 | p00000 | C | #include<stdio.h>
#include<string.h>
#define clr(x,y) memset(x,y,sizeof(x))
#include<algorithm>
#define ll long long
using namespace std;
const int inf=2000000000;
int i,j,n;
struct item{
int l,r,num;
bool flag;
}a[1000];
int idx[1000];
bool cmp(const item &a,const item &b){
if(a.flag!=b.flag) return a.fl... | main.c:4:9: fatal error: algorithm: No such file or directory
4 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s350923104 | p00000 | C | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <queue>
#include <ctime>
using namespace std;
template <class T> void checkmin(T &t,T x){if (x < t) t = x;}
template <class T> voi... | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s347648666 | p00000 | C | #include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 3;
typedef long long LOL;
LOL a[N][N],b[N][N],g[N][N],c[N][N];
LOL dp[100];
LOL mod1=1000000007ll;
LOL mod2=1000000006ll;
LOL mod3=500000002ll;
int sz;
//17
void matcopy(LOL a[N][N],LOL b[N][N])
{
for(int i=1;i... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s951945659 | p00000 | C | #include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
struct Node {
int x, y;
friend bool operator <(struct Node a, struct Node b) {
if (a.y != b.y)
return a.y > b.y;
return a.x < b.x;
}
friend bool operator ==(struct Node a, struct Node b) {
return a.x == b.x && a.y == b.y;
}
};
#... | main.c:2:9: fatal error: algorithm: No such file or directory
2 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s966496869 | p00000 | C | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define N 510
using namespace std;
int n;
int dp[N];
struct nd
{
int a,b;
int v;
bool operator == (const nd &p) const
{
return a==p.a&&b==p.b;
}
}nod[N];
bool cmp(nd a,nd b)
{
if(a.b!=b.b)
return a.b<b.b;... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s893491041 | p00000 | C | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <string.h>
#include <vector>
#include <map>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define MP make_pair
const int V = 100000;
int a[V];
struct Node {
int ugly;
char direct;
int next;
};
Node data[100][2];
int ... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s076853562 | p00000 | C | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <climits>
#define clr(x) memset ( (x) , 0 , sizeof ( x ) )
#define Mp make_pair
#define Pb push_back
using names... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s413635270 | p00000 | C | #include<cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
struct st
{
int l,r,num;
int id;
}q[100010];
int num[200010];
int s[100010];
int T;
int n,m;
map<int,int> hash;
int tot;
int low(int x)
{
return x&(-x);
}
const int N= 200000;
int arr1[200010];
int arr2[20001... | main.c:1:9: fatal error: cstdio: No such file or directory
1 | #include<cstdio>
| ^~~~~~~~
compilation terminated.
|
s284222604 | p00000 | C | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define N 100100
const int inf=0x3f3f3f3f;
using namespace std;
struct nd
{
int a,b;
}nod[N],ndd[N];
bool cmp(nd a,nd b)
{
if(a.b!=b.b)return a.b<b.b;
return a.a<b.a;
}
int T,tt,n,m;
int main()
{
//freopen("in","r",stdin);
... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s823256244 | p00000 | C | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define see(x) cout<<#x<<":"<<x<<endl;
using namespace std;
const int maxn = 100005;
struct Node{
int a, b;
}p0[maxn],p1[maxn];
bool cmp(Node x, Node y){
return x.a<y.a;
}
int main(){
int T, t, i, j, k, n0, n1, n, m;
... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s958496931 | p00000 | C | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define N 100100
#define ll long long
const ll inf=0x3f3f3f3f3f3f3f3fll;
using namespace std;
struct nd
{
ll a,b;
}nod[N],ndd[N];
bool cmp(nd a,nd b)
{
if(a.b!=b.b)return a.b<b.b;
return a.a<b.a;
}
ll T,tt,n,m;
int main()
{
... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s832994208 | p00000 | C | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define clr(a,b) memset(a,b,sizeof(a))
using namespace std;
//int t,n,m;
//int a[100010];
//int ti=1;
//int main(){
//// freopen("d:\\in.txt","r",stdin);
// scanf("%d",&t);
// while(t--){
// scanf("%d%d",&n,&m);
// int mi=1<<30;
// ... | main.c:3:10: fatal error: algorithm: No such file or directory
3 | #include <algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s515035337 | p00000 | C | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct snode {
int x;
double p;
bool operator<(const snode &rhs) const {
return x<rhs.x;
}
}node[1000010];
int N, M;
double cost[1010][1010];
double f[1010][55];
int main() {
int i, j, k;
... | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s446256257 | p00000 | C | #include<stdio.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<queue>
#define ll long long
#define clr(x,y) memset(x,y,sizeof(x))
using namespace std;
const int inf=100000000;
int i,j,n,m,l,k,h;
int g[100][100];
int x1,y1,x2,y2;
int boss[60][60];
bool vis[60][60][1<<5],flag[60][60];
int d[60][60][1<<5... | main.c:3:9: fatal error: algorithm: No such file or directory
3 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s024821675 | p00000 | C | /*
HDU 4055
DP
隶セdp[i][j]陦ィ遉コ莉・j蠑?、エ逧?シ碁柄蠎ヲ荳コi逧?賜蛻礼噪謨ー逶ョ縲?
莉主ュ礼ャヲ荳イ逧?錘髱「蛻ー蜑埼擇DP蟆ア蠕怜?遲疲。井コ??
A
G++ 1437ms
*/
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=1010;
const int MOD=1000000007;
char str[MAXN];
int dp[MAXN][MAXN];
int main()
{
// freopen("in.t... | main.c:11:9: fatal error: algorithm: No such file or directory
11 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s104580468 | p00000 | C | #include<stdio.h>
int main()
{
int m,n,l;
l = m*n
for(m=1;m<10;m++)
{
for(n=1;n<10;n++)
{
printf("%dx%d=%d\n",m,n,l);
}
}
return 0;
} | main.c: In function 'main':
main.c:5:8: error: expected ';' before 'for'
5 | l = m*n
| ^
| ;
6 | for(m=1;m<10;m++)
| ~~~
|
s220149133 | p00000 | C | #include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
ll x,y,ans;
ll _pow(ll k,int r)
{
ll b=1;
while(r)
{
if(r%2) b=b*k;
k=k*k;r/=2;
}
return b;
}
ll g(ll k,int r)
{
return k*(_pow(k,r)-1)/(k-1);
}
void cal(ll n,int r,ll low,ll up)
{
while(low<=u... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s816396666 | p00000 | C | #include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
using namespace std;
#define inf (1ll<<62)
long long f[42];
void init(){
f[0]=1;
for(int i=1;i<=41;i++){
f[i]=f[i-1]*2;
}
}
long long qpow(long long x,long long y){
if(y==0) return 1;
... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s145690796 | p00000 | C | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#define DBLE 1e-8
#define PI 3.1415926535898
#define MAXN (1<<8)
#define INF 500000000
using namespace std;
int dp[55][MAXN][MAXN];
bool visi... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s680052734 | p00000 | C | #include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
using namespace std;
string a,b,c;
int w[10];
int main(){
int T;
scanf("%d",&T);
while(T--){
cin >> a >> b >> c;
int d[6];
int res = 0;
for(int i=0;i<5;i++) w[i] = 1;
for(int i=0;i<a.size();i++)
... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s916017179 | p00000 | C | #include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include <vector>
#include<queue>
#include<map>
#define L(a) ((a)<<1)
#define R(a) ((a)<<1|1)
#define clr(x,y) memset(x,y,sizeof(x))
#define ll long long
using namespace std;
const int inf=1<<30;
int a[6][6],b[6][6];
int t;
int x[]={1,0,0,-1},y[... | main.c:2:9: fatal error: algorithm: No such file or directory
2 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s452564266 | p00000 | C | #include <iostream>
#include <string.h>
#include <queue>
#include <algorithm>
#include <cstdio>
using namespace std;
int r[2][6][6],l[2][6][6],up[2][6][6],dn[2][6][6],hole[2][6][6];
int mab1[6][6],mab2[6][6];
int x[4]={1,0,0,-1};
int y[4]={0,-1,1,0};
int vis[6][6][6][6];
struct nd
{
int x,y;
}st,ed,st1,ed1;
struct ... | main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s536220690 | p00000 | C | //============================================================================
// Name : main.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <ios... | main.c:9:10: fatal error: iostream: No such file or directory
9 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s016551474 | p00000 | C | //============================================================================
// Name : main.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <ios... | main.c:9:10: fatal error: iostream: No such file or directory
9 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s903159001 | p00000 | C | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
using namespace std;
const int N=50005,M=N*4;
int n;
struct Node{
int x1,x2,y1,y2;
Node(){}
Node(int a,int b,int c,int d):x1(a),y1(b),x2(c),y2(d){}
}node[N*5];
int le[M],ri[M],sum[M],c[M];
vector<int>in[N],ou[N];
void build(int rt,int... | main.c:3:9: fatal error: algorithm: No such file or directory
3 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s137553831 | p00000 | C | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define maxn 105
int a[maxn][maxn];
bool vis[maxn][maxn];
bool prime[maxn*maxn];
struct node
{
int x,y;
}c[maxn*maxn];
struct Node
{
int x,y;
int dis;
}q[maxn*maxn];
void init()
{
int i,j;
prime[1]=true;
for (i=2;i<... | main.c:4:9: fatal error: algorithm: No such file or directory
4 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s515441935 | p00000 | C | #include<iostream>
#include<stdio.h>
#include<set>
#include<string.h>
#include<math.h>
#include<string>
#include<queue>
#include<algorithm>
#define LL long long
#define N 2
using namespace std;
int a,b,mod,n;
struct mat
{
int a[N][N],n,m;
mat(int n=2,int m=2,int val=0):n(n),m(m)
{
for(int i=0;i<n;i+... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s684282316 | p00000 | C | #include<iostream>
#include<stdio.h>
#include<set>
#include<string.h>
#include<math.h>
#include<string>
#include<queue>
#include<algorithm>
#define LL long long
#define N 2
using namespace std;
int a,b,mod,n,p;
struct mat
{
int a[N][N],n,m;
mat(int n=2,int m=2,int val=0):n(n),m(m)
{
for(int i=0;i<n;... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s347603748 | p00000 | C | //#include<stdio.h>
//#include<stdlib.h>
//#include<algorithm>
//using namespace std;
//int n,d1,d2;
//
//int main(){
// scanf("%d%d%d",&n,&d1,&d2);
// int t1=d1,t2=d2,num=2;
// while(1){
// int t=min(t1,t2);
// if(num>=n) break;
// if(t==t1) t1+=d1,num++;
// if(t==t2) t2+=d2,num++;... | main.c:22:9: fatal error: algorithm: No such file or directory
22 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s156493804 | p00000 | C | #include<iostream>
using namespace std;
int main()
{
int i,j;
int s;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
s=i*j;
cout<<i<<"x"<<j<<"="<<s<<"\n";
}
}
return 0;
} | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s623386454 | p00000 | C | #include<stdio.h>
int main(void)
{
for(int f1=1;f1<=9;f1++){
for(int f2=1;f2<=9;f2++){
printf("%dx%d=%d\n",f1,f2,f1*f2);
return 0;
} | main.c: In function 'main':
main.c:8:1: error: expected declaration or statement at end of input
8 | }
| ^
main.c:8:1: error: expected declaration or statement at end of input
|
s241284078 | p00000 | C | struct SuffixArray {
int wa[LEN] , wb[LEN] , wv[LEN] , ws[LEN];
int n , m , r[LEN] , sa[LEN] , rank[LEN] , h[LEN];
void init(char *str) {
// r[] : the string
// n : length of the string
// m : kind of character
// Tips : r[n] = 0
n = strlen(str);
for(int i = 0... | main.c:2:12: error: 'LEN' undeclared here (not in a function)
2 | int wa[LEN] , wb[LEN] , wv[LEN] , ws[LEN];
| ^~~
main.c:4:26: error: expected ':', ',', ';', '}' or '__attribute__' before '{' token
4 | void init(char *str) {
| ^
|
s863781393 | p00000 | C | #include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 3100
#define lef(x) (((x)<<1)+1)
#define rig(x) (((x)<<1)+2)
int h[N], e[N], thick[N], Oceng[N], Tceng[N];
int apx[N], apy[N], apz[N];//o to r
int _x[N][2], _y[N][2], _z[N][2];
map<int, int> x, y;//... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s745512026 | p00000 | C | #include<stdio.h>
#include<string.h>
#include<algorithm>
#define clr(x,y) memset(x,y,sizeof(x))
#define ll long long
using namespace std;
const int inf = 1000000000;
ll dp[1005][1005];
ll a[1005],p;
int q[1005][1005],bg[1005],ed[1005];
int i,j,n;
ll f1(int l,int k,int j){
return dp[j][l]-dp[k][l];
}
ll f2(int l,i... | main.c:3:9: fatal error: algorithm: No such file or directory
3 | #include<algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s841719811 | p00000 | C | #include<stdio.h>
int main(void)
{ | main.c: In function 'main':
main.c:3:1: error: expected declaration or statement at end of input
3 | {
| ^
|
s960385871 | p00000 | C | #include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define db double
#define rt return
const db eps = 1e-8 , pi = acos(-1.);
inline int sig(db x){rt (x>eps)-(x<-eps);}
db calc(db a , db b , db c) {
db delta = b*b - 4.*a*c;
rt (-b - sqrt(delta)) / (2. * a);
}
int n;
db v[211] , H ... | main.c:1:10: fatal error: cstdio: No such file or directory
1 | #include <cstdio>
| ^~~~~~~~
compilation terminated.
|
s026999371 | p00000 | C | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
#define eps 1e-8
#define fabs(x) ((x) > 0?(x):-(x))
#define zero(x) (fabs(x) < eps)
#define sqr(x) ((x)*(x))
struct point3{
double x, y, z;
void read(){
scanf("%lf %lf %lf", &x, &y, &z);
};
point3 operator - (const point3 &b)const{
point3 ... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s930205606 | p00000 | C | compareTo荳ュ?瑚ソ泌屓-1邀サ莨シC++荳ュ驥崎スス逧?<'
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;
class Node implements Comparable
{
public int val;
public Node(int v){this.val=v;}
public int compareTo(Object obj)
{
if(obj instanceof Node){
Node oo=(Node)obj;
... | main.c:1:14: error: expected '=', ',', ';', 'asm' or '__attribute__' before '?' token
1 | compareTo荳ュ?瑚ソ泌屓-1邀サ莨シC++荳ュ驥崎スス逧?<'
| ^
main.c:1:24: error: invalid suffix "邀サ莨シC" on integer constant
1 | compareTo荳ュ?瑚ソ泌屓-1邀サ莨シC++荳ュ驥崎スス逧?<'
| ^~~~~~~~~~
main.c:1:52: warni... |
s877281994 | p00000 | C | #include<iostream>
#include<vector>
#include<cstdio>
using namespace std;
#define N 500010
#define Max(a, b) ((a)>(b))?(a):(b)
#define Min(a, b) ((a)<(b))?(a):(b)
#define inf 0x7fffffff
#define PB push_back
vector<int> edge[N], length[N];
bool col[N];
int mn[N], mx[N];
void dfs(int loc){
col[loc]=true;
int s=0;
f... | main.c:1:9: fatal error: iostream: No such file or directory
1 | #include<iostream>
| ^~~~~~~~~~
compilation terminated.
|
s759353974 | p00000 | C | #include<stdio.h>
int main()
{
printf("1x1=1\n1x2=2\n.\n.\n9x8=72\n9x9=81\n"};
return 0;
} | main.c: In function 'main':
main.c:4:46: error: expected ')' before '}' token
4 | printf("1x1=1\n1x2=2\n.\n.\n9x8=72\n9x9=81\n"};
| ~ ^
| )
main.c:4:46: error: expected ';' before '}' token
4 | printf("1x1=1\n1x2... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.