代码搜索:stdlib

找到约 10,000 项符合「stdlib」的源代码

代码结果 10,000
www.eeworm.com/read/464500/7157016

c execle.c

#include #include #include int main() { char *envp[]={"PATH=/tmp","USER=sunq",NULL}; if(fork()==0){ if(execle("/bin/env","env",NULL,en
www.eeworm.com/read/464500/7157021

c execve.c

#include #include #include int main() { char *arg[]={"env",NULL}; char *envp[]={"PATH=/tmp","USER=sunq",NULL}; if(fork()==0){ if(("b
www.eeworm.com/read/464500/7157032

c alarm.c

#include #include #include int main() { int ret; ret=alarm(5); pause(); printf("I have been waken up.\n",ret); }
www.eeworm.com/read/463983/7171127

h lj.h

#include #include #define MAXVEX 6 int visited[MAXVEX]; /* struct vertex { int num; char data; };*/ typedef struct graph { char vexs[MAXVEX]; //定义顶点集 int edges[MA
www.eeworm.com/read/463983/7171160

h j.h

#include #include #define MAXVEX 100 int visited[MAXVEX]; struct vertex { int num; //第几个结点 char data; //结点内容 }; typedef struct graph { struct vertex vexs[MAXVEX];
www.eeworm.com/read/463562/7178343

cpp gg.cpp

#include"stdio.h" #include"string.h" #include"stdlib.h" void main() { char s[40]; gets(s); if(!strcmp(s,"()"))printf("相等"); printf("%d",strlen(s)); }
www.eeworm.com/read/463491/7179566

c mathtest.c

#include #include #include int main(void) { double a=8.733243; printf("sqrt(%f)=%f\n", a, sqrt(a)); return 0; }
www.eeworm.com/read/461892/7214847

cpp 查找与替换.cpp

#include #include #include main() { int i,j,k,l,n,m=0,t,s,p; char S[10000],T[10],re[10],r[100000]; scanf("%d",&n); while(m
www.eeworm.com/read/461831/7218831

h alloc.h

//定义一个不易发生错误的内存分配器。 #include #define malloc //不要直接调用malloc #define MALLOC( num, type ) ( type * )alloc( num * sizeof( type ) ) extern void *alloc( size_t size );
www.eeworm.com/read/461590/7223922

c c.c

#include #include #include main(){ union{ unsigned int a[2]; double b; float c; }; cout b; pr