代码搜索：printf
找到约 10,000 项符合「printf」的源代码
代码结果 10,000
www.eeworm.com/read/252193/12294690
c 7-30.c
#include
main()
{
char * s="012345678901234567890123456789";
char *p;
p= strstr(s,"901");
printf("%s\n",p);
}
www.eeworm.com/read/252193/12294728
c 7-24.c
#include
main()
{
char *a="aBcDeF";
char *b="AbCdEf";
if(!strncasecmp(a,b,6))
printf("%s =%s\n",a,b);
}
www.eeworm.com/read/252193/12294773
c 7-14.c
#include
main()
{
char s[30];
memset (s,'A',sizeof(s));
s[30]='\0';
printf("%s\n",s);
}
www.eeworm.com/read/252193/12294787
c 7-16.c
#include
main()
{
char *a="aBcDeF";
char *b="AbCdEf";
if(!strcasecmp(a,b))
printf("%s=%s\n",a,b);
}
www.eeworm.com/read/252073/12304378
c shannon.c
#include "stdio.h"
#include "math.h"
main()
{
int i,t;
float buff,ka,R,Hx;
float p[ ]={0,0.2,0.19,0.18,0.17,0.15,0.10,0.01}; /*符号概率*/
float ps[10];
www.eeworm.com/read/338465/12305957
c ntpclient.c
/*
* ntpclient.c - NTP client
*
* Copyright 1997, 1999, 2000, 2003, 2006, 2007 Larry Doolittle
* Last hack: December 30, 2007
*
* This program is free software; you
www.eeworm.com/read/251972/12308160
cpp inverse.cpp
// inverse.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
int euclid(int f,int d)
{ //calclate gcd(f,d),note gcd(f,d)=gcd(|f|,|d|)
//assume f is larger t
www.eeworm.com/read/338402/12308603
c guessnumber.c
#include "stdlib.h"
#include "stdio.h"
#include "time.h"
#include "math.h"
#define X 50
int main(void)
{
char c[X];
char A[X]="abcdefghij";
int i,j,k,x,R;
int m=strlen(A);
www.eeworm.com/read/251885/12313673
c sieve.c
/* ------------------------------------------------------------------------- *
* This is the classic prime sieve of Eratosthenes - a simple algorithm *
* that finds all the prime numbers betwee