代码搜索:printf

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

代码结果 10,000
www.eeworm.com/read/487368/6510724

c strpoint.c

/* 将字符串a复制到字符串b */ # include void main() { int i; char a[] = "I am a student."; char b[20]; char *p1, *p2; p1 = a; p2 = b; for(; *p1!='\0'; p1++, p2++) *p2 = *p1; *p
www.eeworm.com/read/487368/6510785

c heapsort.c

#include #define MARK 0 static a[8] = {MARK,25,4,36,1,60,10,58,}; int count = 1; void heap(int n); void adjust(int i,int n); int main(void) { int i; printf("源数据为:"); for(i =
www.eeworm.com/read/487368/6510794

c bp.c

#include "math.h" #include "time.h" #include "stdio.h" #include "stdlib.h" #define Ni 1 #define Nm 4 #define No 1 #define L 100 #define Enom 0.02 #define loopmax 100000 #define e 2.71828 do
www.eeworm.com/read/487311/6519047

l ch2-07.l

%s MAGIC %% .+ { BEGIN 0; printf("Magic:"); ECHO; } magic BEGIN MAGIC; .+ ECHO; %% main() { yylex(); }
www.eeworm.com/read/486962/6521544

cpp test_usbsoftlock.cpp

// Test_USBSoftLock.cpp // // Generated by DriverWizard version DriverStudio 2.7.0 (Build 562) // // This console application demonstrates how to open a handle // to a device in y
www.eeworm.com/read/486654/6524058

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/486654/6524061

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/486654/6524067

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/486654/6524104

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/486654/6524133

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;