代码搜索：printf

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/260175/11741004

cpp 1045.cpp

#include #define MAX 5843 double arr[MAX+1]; int main() { int i,j,k,n; int list[4]={2,3,5,7}; double min,m; arr[0]=0; arr[1]=1; for(i=2;i
·
www.eeworm.com/read/260175/11741095

cpp 1089.cpp

#include int f[7],a[14],n; void go(int x,int step) { int i; if ((n-x+1)
·
www.eeworm.com/read/260175/11741249

cpp 1009.cpp

#include #include int max(int a,int b) { return a>b? a:b; } int main() { int i,length,sign1,sign2,x,y; char a[20],b[20]; int c[21]; while(scanf("%s%s",&a,&b)!=EO
·
www.eeworm.com/read/346394/11751391

cpp 单纯形算法.cpp

#include #include #define MAX 100 #define infinity 100000000 double c[MAX]; double g[MAX][MAX]; int B[MAX],mark[MAX]; // g[0] presents b; // g[0] presents r; int m
·
www.eeworm.com/read/346394/11751463

txt 单纯形算法.txt

#include #include #define MAX 100 #define infinity 100000000 double c[MAX]; double g[MAX][MAX]; int B[MAX],mark[MAX]; // g[0] presents b; // g[0] presents r; int m
·
www.eeworm.com/read/156908/11752930

c williams.c

/* * Program to factor big numbers using Williams (p+1) method. * Works when for some prime divisor p of n, p+1 has only * small factors. * See "Speeding the Pollard and Elliptic Curve
·
www.eeworm.com/read/156908/11752968

c pollard.c

/* * Program to factor big numbers using Pollards (p-1) method. * Works when for some prime divisor p of n, p-1 has itself * only small factors. * See "Speeding the Pollard and Elliptic Cu
·
www.eeworm.com/read/156908/11753017

c hilbert.c

/* * Solve set of linear equations involving * a Hilbert matrix * i.e. solves Hx=b, where b is the vector [1,1,1....1] * * Copyright (c) 1988-1997 Shamus Software Ltd. */ #include
·
www.eeworm.com/read/156908/11753703

c genkey.c

/* * Program to generate RSA keys suitable for use with an encryption * exponent of 3, and which are also 'Blum Integers'. * * Note that an exponent of 3 must be used with extreme care!
·
www.eeworm.com/read/259942/11755651

re calc_002.re

/* re2c lesson 001_upn_calculator, calc_002, (c) M. Boerger 2006 - 2007 */ /*!ignore:re2c - making use of YYFILL . Here we modified the scanner to not require strlen() on the call. Instead we
·