代码搜索：printf
找到约 10,000 项符合「printf」的源代码
代码结果 10,000
www.eeworm.com/read/131123/14160108
c apriori.c
/*----------------------------------------------------------------------
File : apriori.c
Contents: apriori algorithm for finding association rules
Author : Christian Borgelt
History : 14.
www.eeworm.com/read/131088/14161763
c apriori.c
/*----------------------------------------------------------------------
File : apriori.c
Contents: apriori algorithm for finding association rules
Author : Christian Borgelt
History : 14.
www.eeworm.com/read/233206/14163147
cpp subblock.cpp
#include
int x = 1; // declare a global instance of x
void FunctionOne(); // Prototype our function
main ()
{
printf ("The global x is %d\n", x);
FunctionOn
www.eeworm.com/read/233206/14163213
cpp block.cpp
#include
int main ()
{
int x;
x = 2;
printf ("x prior to the block is %d\n", x);
{
int x;
x = 3;
printf ("x inside the block is %d\n", x);
www.eeworm.com/read/130965/14165229
c domacro.c
/*
* Copyright (c) 1985, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are
www.eeworm.com/read/130918/14167504
cpp linesearch_sm.cpp
/*单纯形法求解线性规划
bug:1 约束条件右端不能出现负值
2 不能用分数，只能用小数
3 默认自变量非负，如果有负值需要平移为正值，加一个正数，最优值不变，但是最优解需要减掉此正数平移量
4 目标函数中常量不被计算在内，如果含有常量，需要计算后自己加上
*/
#include
#include
#include ...
www.eeworm.com/read/233105/14169096
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/233105/14169124
c 小白鼠钻迷宫.c
这是个经典的数学问题，说的是：在一个随机的迷宫里，小白鼠如何能最快地从起点走到终点。
-# --------### # ## # # ###
----# # #-## # # # #### #### #
## ## #-# ## # # # #---# ## #
## # # # # -# ### ##
www.eeworm.com/read/233105/14169137
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/233105/14169140
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[