代码搜索:printf

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

代码结果 10,000
www.eeworm.com/read/154692/11934605

c netmon.c

/* Simple network monitor for 'TCP/IP Lean' (c) Iosoft Ltd. 2000 This software is only licensed for distribution with the book 'TCP/IP Lean', and may only be used for personal experimentation by t
www.eeworm.com/read/257293/11934846

c knapsack01_dynprog.c

/* 0/1背包问题的动态规划法算法*/ #include #include #define ymax 100 #define nmax 100 double f[nmax][ymax]; void Knapsack(double p[], int w[], int c, int n) { int y = 0, i =
www.eeworm.com/read/257293/11934946

c knapsack_greedy.c

/* 背包问题的贪心法算法*/ #include #include /* 线性表p和w中,按p[i]/w[i]的降序分别存放物体的价格(单位为元)和重量(单位为公斤);*/ /* m是背包能放的物体总重量,n是物体件数。x存放解向量*/ double knapSack(double* p, double* w, double* x ,doub
www.eeworm.com/read/343590/11940832

h common.h

#ifndef COMMON_H_ #define COMMON_H_ //#define printf uartPrintf #endif /*COMMON_H_*/
www.eeworm.com/read/343582/11941225

cpp usbfxtest.cpp

/////////////////////////////////////////////////////////////////////////////// // // (C) Copyright 1995 - 2003 OSR Open Systems Resources, Inc. // All Rights Reserved // // This sofware
www.eeworm.com/read/343409/11950227

h mshell.h

/* * mShell * Copyright 2006, Julien Lecomte * * This software is provided 'as-is', without any express or implied warranty. * In no event will the authors be held liable for any damages arising
www.eeworm.com/read/343401/11951237

c 105.c

#include #include #include #include int shoudsave=0 ; int count1=0,count2=0,mark=0,mark1=0 ; /*定义存储火车信息的结构体*/ struct train { char num[10];/*列车
www.eeworm.com/read/256998/11961528

cpp nhuanhou.cpp

#include #include #define ERROR 0; #define OK 1; int Queen[100];//下标为对应棋盘的列号,数组存放的是放了棋的行号 int m; //函数一检查放置皇后是否成功,是的话返回1,否则返回0; int cheak(int i) { for(int j=1;j
www.eeworm.com/read/256998/11961536

cpp nhuanghou ok.cpp

#include //#include #define MAXQ 100 int N, t; int qx[MAXQ], qy[MAXQ]; int cure; //char c; int cheak(int x, int y) //检测(x,y)处的皇后是否与已有皇后冲突,同列、同斜线均为冲突。 { if
www.eeworm.com/read/154230/11980100

c sort.c

#include #define FALSE 0 #define TURE 1 #define MAXSIZE 100 /* Declaration for functions */ void selectsort(int *list,int index); /* void creatheap(int *heap,int root,int index);