搜索资源列表
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
konversi-bilangan
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
NO2
- 顺序表 create_sqlist(Sqlist *L)/*创建顺序表*/ { int k ElemType x k=0 scanf(" d",&x) while(x!=0) { L->data[k]=x k++ scanf(" d",&x) } L->length=k } void print_sqlist(Sqlist *L)/*输出顺序表*/ { int j
include
- 在采用二叉链表存储的二叉树上,编程实现从根结点到指定结点之间的路径.-#include <stdio.h> #include <stdlib.h> typedef struct BTnode { char data struct BTnode*lchild,*rchild }BTNode #define NodeLen sizeof(BTNode) BTNODE*Creat_Bt(void) void Preorder
paixu
- 用指向指针的方法对n个数进行排序并输出,n和各整数在主函数中输入-#include <stdio.h> #define SIZE 100//数组最大长度 #define SWAP(x, y, t) (t = x, x = y, y = t)//交换两个数 void sort(int**p, int n){//排序函数 int i, j int min int temp for(i = 0 i < n- 1 i++){
WinRAR-ZIP
- 在C++用递归实现链表逆序 使得倒序输出。-#include <stdio.h> #include <stdlib.h> #include <time.h> const int M=10 typedef int Type typedef struct Node{ Type data struct Node* next }Node void add_elem(Node**head,Type data){ Node
jvzhenliancheng
- 矩阵连乘 动态规划问题 输出n个矩阵相乘最小的结果-printf number which is the smallest of the N-matrix
_printf
- printf的格式控制的完整格式,讲得很详细-complete format of printf format control
1111
- 二叉树的建立演示,可以将你输入的数字建立完全的二叉树-#include <stdio.h> #include <string.h> #include <windows.h> struct BTree { int data struct BTree* left struct BTree* right } //end struct BTree BTree* CreateLeaf(int number) {
huangjin
- #include<stdio.h> #include<math.h> float Function(float x) void main() { float a,b,e float x0,x1,x2,F0,F1,F2 printf("input a ,b ,e \n") scanf(" f f f",&a,&b,&e) x1=b-0.618*(b-a) x2=a+0.618*(b-a) F1=Func
hamming-(1962)
- 计算hamming(1962)级数:sn=1/n(n+x).0.0-300.0 步长,精确度可调。-Produce a table of the values of the series (1) for the 3001 values of x, x = 0.0, 0.1, 0.2, …, 300.00. All entries of the table must have an absolute error less than 10
用链表求循环小数
- 对于任意的真分数 N/M ( 0 < N < M ),均可以求出对应的小数。如果采用链表表示各个小数,对于循环节采用循环链表表示,则所有分数均可以表示为如下链表形式。 输入: N M 输出: 转换后的小数(不超过 50 位) 要求: 仅编写将分数转换为小数的函数 change( int n, int m, NODE * head ) 。 预设代码: /* PRESET CODE BEGIN - NEVER TOUCH CODE BELOW */ #in
periodString
- C语言编程题目:判断输入的字符串是否是周期性的,是则求最小正周期长度,printf打印出了整个过程。-C language programming topics: the string to determine whether the input is cyclical, that is seeking the smallest positive cycle length, printf to print out the whole process.
Desktop
- 水仙花数判定、输出杨辉三角、汉诺塔移动次数-judge Narcissistic number between two number、printf Yang Hui triangle、Tower of Hanoi
codes
- How to calculate the greatest common divisor, the conversion in centimeters, the second degree equation, one test to find out how printf works and how to calculate the number of days in a month.
colt-1.2.0
- Colt是一个高性能的数学库,由以下几个子库构成: Colt库:基本的动态数组、稀疏矩阵、线性代数。 Jet库:数理统计、直方图。 CoreJava库:类printf的打印函数,并行计算。(Colt is a high performance math library composed of the following sub libraries: Colt libraries: basic dynamic arrays, sparse matrices, linear algebra.
dsxt-1
- 数据结构第一章试写一个算法,自大到小依次输出顺序读入的三个数X、Y和Z的值(data stru for (i=2; ((n%i)!=0)&&(i<sqrt(n)); i++); if i>sqrt(n) printf("%d is a prime number", n) else printf("%d is not a prime number", n); }/)
哈夫曼编码与字母频率统计
- 统计词频并构建哈夫曼树,左边为0,右边为1。(HuffmanTree ,calculate every the number of every zee and using '1' and '0' create a tree and printf the string.)