代码搜索:printf

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

代码结果 10,000
www.eeworm.com/read/482736/6621926

txt 7-12.txt

/* 范例:7-12 */ #include int main() { /* 数组与指针 */ char sa[] = "this is a book"; char *ptr = "this is a book"; /* 结果输出至屏幕 */ printf("这是sa数组字符串 -->%s",sa); printf("\n这是ptr指针
www.eeworm.com/read/482748/6622041

c process.c

/*process.c*/ #include #include #include int main() { printf("The PID of this process is %d\n",getpid()); printf("The PPID of this process is %d\n",getppid());
www.eeworm.com/read/482300/6622527

c rinex.c

rinex.c void gps_dat(fp,ifp,xhidat,odat_t,odat_dt,odat_n,In0,rt,dt,odat, id_odat,iodat,odat1,iodat1, sdat,id_sdat,isdat,sdat_n,ddat,id_ddat,iddat,ddat_n, t
www.eeworm.com/read/481966/6633356

cpp 1848.cpp

/* This Code is Submitted by wywcgs for Problem 1848 on 2005-03-28 at 15:45:00 */ #include #define fabs(a) (((a)>0)?(a):(-(a))) int main() { int n, a[2], sub[3000]; int i
www.eeworm.com/read/481966/6633359

cpp 2449.cpp

/* This Code is Submitted by wywcgs for Problem 2449 on 2007-04-13 at 18:27:18 */ #include #include #include #include using namespace std; const int L =
www.eeworm.com/read/481966/6633365

cpp 1247.cpp

/* This Code is Submitted by wywcgs for Problem 1247 on 2005-10-02 at 16:36:29 */ #include #include #define MAX 60001 int main() { bool prime[MAX] = {false}; int i, j;
www.eeworm.com/read/481966/6633402

cpp 1987.cpp

/* This Code is Submitted by wywcgs for Problem 1987 on 2005-09-22 at 14:16:28 */ #include int main() { int n, m, i, f[10001]; while(scanf("%d %d", &n, &m) == 2) {
www.eeworm.com/read/481966/6633431

cpp 1205.cpp

/* This Code is Submitted by wywcgs for Problem 1205 on 2005-03-25 at 14:03:31 */ #include #include int main() { int prime[50]; int temp[8], i, j, k, flag, m;
www.eeworm.com/read/481966/6633434

cpp 1533.cpp

/* This Code is Submitted by wywcgs for Problem 1533 on 2005-03-24 at 08:05:11 */ #include int numLen(long); int main() { long fib[2][120], order; int i, j, k, l, flag, l
www.eeworm.com/read/481966/6633447

cpp 1401.cpp

/* This Code is Submitted by wywcgs for Problem 1401 on 2005-03-14 at 16:16:32 */ #include int main() { long N, zeroNumber, i, j; int a[2], m, n; while(scanf("%ld", &