代码搜索：printf
找到约 10,000 项符合「printf」的源代码
代码结果 10,000
www.eeworm.com/read/157653/11676534
awk mkopcodeh.awk
#!/usr/bin/awk -f
#
# Generate the file opcodes.h.
#
# This AWK script scans a concatenation of the parse.h output file from the
# parser and the vdbe.c source file in order to generate the opcodes nu
www.eeworm.com/read/347260/11679797
txt 快速傅立叶变换（来源《c常用算法集》）.txt
// 函数名: 快速傅立叶变换（来源《C常用算法集》）
// 本函数测试OK,可以在TC2.0,VC++6.0,Keil C51测试通过。
// 如果你的MCS51系统有足够的RAM时,可以验证一下用单片机处理FFT有多么的慢。
//
// 入口参数：
// l: l = 0, 傅立叶变换; l = 1, 逆傅立叶变换
// il: il = 0,不计算傅立叶变换或逆变换模和幅角；i
www.eeworm.com/read/157615/11682308
c os_cpu_c.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/157615/11682404
c os_cpu_c.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/157615/11682726
c os_cpu_c.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/260947/11684873
cpp 4_33.cpp
# include
# include
# define R 12
void main()
{
char xin[2*R+1][2*R+1];
int t,x,y;
double d;
for(x=0;x
www.eeworm.com/read/260907/11687489
cpp 1589.cpp
#include
#include
bool relation[26][26];
bool flag[26][26];
int n = 0, num = 0 ;
int nflag ;
void floyed()
{
int i , j, k=0;
for ( i = 0 ; i < num ; i++ )
for( j
www.eeworm.com/read/260907/11687546
cpp 1180.cpp
#include
#include
#define Max 1000000
long Kaprekar[1500001];
void duli()
{
memset(Kaprekar,0,sizeof(Kaprekar));
long j,sum=0,i;
for(i=100;i
www.eeworm.com/read/260905/11687609
cpp 1180.cpp
#include
#include
#define Max 1000000
long Kaprekar[1500001];
void duli()
{
memset(Kaprekar,0,sizeof(Kaprekar));
long j,sum=0,i;
for(i=100;i
www.eeworm.com/read/260904/11687622
cpp 1589.cpp
#include
#include
bool relation[26][26];
bool flag[26][26];
int n = 0, num = 0 ;
int nflag ;
void floyed()
{
int i , j, k=0;
for ( i = 0 ; i < num ; i++ )
for( j