代码搜索：printf
找到约 10,000 项符合「printf」的源代码
代码结果 10,000
www.eeworm.com/read/400552/11574470
c twodim.c
# include
void main()
{
int array[16][16];
int i, j, k, m, n;
/* 变量初始化 */
m = 1;
while(m == 1)
{
printf("请输入n(0
www.eeworm.com/read/400552/11574473
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/400552/11574534
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/400552/11574543
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/400397/11577573
cpp huffman.cpp
//哈夫曼编码压缩解压缩程序.cpp
#include
#include
#include
#include
struct head
{
unsigned char b; //记录字符在数组中的位置
long count; //字符出现频率（权值
www.eeworm.com/read/400033/11585729
cpp 2.cpp
#include
#include
typedef struct List//节点的定义
{
int data;
struct List *next;
}List,*Link;
Link CreateList(Link head)//创建链表
{
head=(Link)malloc(sizeof(List));
head->ne
www.eeworm.com/read/262407/11589716
c ping.c
/*
* Copyright (c) 1989 The Regents of the University of California.
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Mike Muuss.
*
* Redistribution an
www.eeworm.com/read/158673/11592771
txt feidiguibahuanghou.txt
非递归八皇后解
int x[9]={0};int n=1;int chk(int a, int b) /*检测(x,y)处的皇后是否与已有皇后冲突，同行、同斜线均为冲突。*/
{
int i;
if(a != 0)
{ for(i=1; i
www.eeworm.com/read/262260/11595868
c hello.c
#include
int main()
{
printf("Hello World\n");
exit(0);
}
www.eeworm.com/read/158645/11596169
c shownet.c
/**************************************************************************
**************************************************************************
*** ***
*** SHOWNET.C ***
*