代码搜索：printf
找到约 10,000 项符合「printf」的源代码
代码结果 10,000
www.eeworm.com/read/481239/6645712
c pow10.c
#include
#include
void main (void)
{
printf("10 raised to -1 is %f\n", pow10(-1));
printf("10 raised to 0 is %f\n", pow10(0));
printf("10 raised to 1 is %f\n", pow
www.eeworm.com/read/481239/6645733
c map_rand.c
#include
#include
void main(void)
{
int i;
printf("Values in the range 0.0 through 1.0\n");
for (i = 0; i < 5; i++)
printf("%f\n", rand() / 32767.0);
www.eeworm.com/read/481249/6646392
c 傻瓜递归.c
#include
main()
{ int m=1,n=1,s;
s=akm(m,n);
printf("%d",s);
}
akm(int m,int n)
{ if(m==0)
return n+1;
else if(m!=0&&n==0)
akm(m-1,1);
else if(m!=0&&n!=0)
www.eeworm.com/read/481249/6646402
c 小白鼠钻迷宫.c
这是个经典的数学问题，说的是：在一个随机的迷宫里，小白鼠如何能最快地从起点走到终点。
-# --------### # ## # # ###
----# # #-## # # # #### #### #
## ## #-# ## # # # #---# ## #
## # # # # -# ### ##
www.eeworm.com/read/481249/6646407
c 小写数字转换成大写数字3.c
#include
void main()
{
double x,y;
char *ch[]={"零","壹","贰","叁","肆","伍","陆","柒","捌","玖"};
char *ch1[]={"拾","佰","仟","万","拾","佰","仟","亿"};
char num[256];
long i,n,j,m,y1;
printf("input:"
www.eeworm.com/read/481249/6646409
c 逆阵.c
#include "stdio.h"
float z[4][4],*y=z; /*定义一个全局二维数组用来存放N-1阶余子式,因为A的伴随矩阵除以|A|时会产生小数，因此定义成float而非int*/
int js(int *p,int n) /*计算行列式的函数*/
{int k=0,i,s2=0,s1=0,j,s,t;
printf("\n"
www.eeworm.com/read/481249/6646410
c 逆矩阵.c
#define N 5 /*[注]：修改6为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];/*b[N][N]用于存放，在矩阵s[
www.eeworm.com/read/481249/6646426
c 阿姆斯特朗数.c
#include
main()
{
int i,t,k,a[3];
printf("There are following Armstrong number smaller than 1000: \n");
for(i=152;i=10;t++)
{
a[t]=(i%k)/(k/1
www.eeworm.com/read/481249/6646429
c 猴子和桃.c
#include
main()
{
int x,x1,x2,x3,x4;/*我用的不知算不算是穷举法，桃子的初值设的是１００*/
for(x=100;x
www.eeworm.com/read/481249/6646438
c re.c
#include
main()
{
int n,s,j,k,p;
int a[100];//最多允许100人
printf("请输入人数：");
scanf("%d",&n);
printf("请输入数字：");
scanf("%d",&s);
for(j=0;j