搜索资源列表
this-is-a-sound-code-of-image-enhancement-based-on
- 小波变换的C源代码 #define N0 128 #include \"stdio.h\" #include \"stdlib.h\" #include \"math.h\" #include \"string.-wavelet transform C source code # define N0 128 # include "stdio. h "# include" stdlib.h "# include" math.h
ghgl
- #include <stdio.h> #include <stdlib.h> #define N 3 struct huowu {char num[10] char name[8] int money[3] int amount[3] }huo[N],temp -# include
quanpaixu
- 冒泡排序 直接选择排序 Shell排序 快速排序 归并排序 堆排序 直接插入排序基本算法 #include<iostream.h> #include<stdlib.h> #include<time.h> const int n=100000 typedef struct{ int key }RedType typedef struct{ RedType *r //r[n+1
332658
- #include <stdio.h> #include <string.h> #include <stdlib.h> #include <malloc.h> #include <math.h> #include <conio.h> struct DuLNode{ struct DuLNode *prior int data struct DuLNode *next-# in
process
- #include <string.h> #include <fstream.h> #include <stdio.h> #include <stdlib.h> #define FINISH 0 //完成状态 #define RUNNING 1 //运行状态 #define READY 2 //就绪状态 #define WAITIO 3 //io等待状态 #define WAITREAD 4//读写等待状态
C++yuandaima
- #define N 200 #include <graphics.h> #include <stdlib.h> #include <dos.h> #define LEFT 0x4b00 #define RIGHT 0x4d00 #define DOWN 0x5000 #define UP 0x4800 #define ESC 0x011b
魔方阵的问题求解
- #include"stdio.h" #include"stdlib.h" int main() { int i ,j,a[100][100],n,k,flag=1; while(scanf("%d",&n)!=EOF&&(n%2!=0)) { for(i=0;i<n;i++) for(j=0;j<n;j++) a[i][j]=0; j=n/2; a[0][j]=1; i=0
yy.rar
- 求用分支限界算法解决旅行商问题的源程序,#include <stdio.h> #include <stdlib.h> #include <math.h> #define TRUE (1) #define FALSE (0) #define MAX_CITIES (10) #define INFINITY (999) #define I INFINITY ,Seeking with branch and bound algorithm t
debugmalloc
- #include <stdlib.h> #include <string.h> #include <stdio.h> //#include <iostream> #include "debugmalloc.h" #include "dmhelper.h" /*Define the macro */ #define ALIGN 8 #define FENCE 0xDEADBEEF #define HE
tony
- #include <stdio.h> #include <stdlib.h> enum x {A,B,C,D,E} int main(void) { int a=73,b=85,c=66 { if (a>=90) printf("a=A等級!!\n") else if (a>=80) printf("73分=B等級!!\n") else if (a>=70) printf("7
normaldistribution
- #include <stdlib.h> #include <stdio.h> #include <time.h> #include <fstream> #include <iostream> using namespace std struct Code { float a char s } Code cc[8]={{0.25, a },{0.3,
shunxu
- //顺序表的建立、查找、插入与删除 #include <stdio.h> #include <malloc.h> #include <stdlib.h> #define ListSize 100 //表最大长度 //结构定义 typedef struct SeqList { int node[ListSize] //存放表结点 int length //当前表长度 } SeqList //插入元素
Datastructsaa
- #include <stdio.h> #include <stdlib.h> #define OK 1 #define OVERFLOW -2 typedef int status typedef struct LinkList{ //用带表头结点的有序链表表示多项式 float coef //系数 int expn //指数 struct LinkList *next //指向后继的指针
chaoshiguanli
- #include<stdlib.h> #include "dos.h" #include "graphics.h" #include "math.h" #define PI 3.1415926 #define NULL 0 #include<stdio.h> #include<string.h> -# Include <stdlib.h># Include dos.h# Include graphics.h# I
2008513183626
- 二叉树算法集 文章整理: www.diybl.com 文章来源: 网络 去论坛 建我的blog #include<stdlib.h> #include<stdio.h> #define MAX 50 #define MAS 20 #define CHAR 1 #if CHAR typedef char TElemType TElemType Nil= #define form " c" #else t
test
- #include "windows.h" #include "stdlib.h" #include "string.h" long WINAPI WndProc(HWND hWnd,UINT iMessage,UINT wParam,LONG lParam)
4
- 四则运算 将算术表达式转换成后缀表达式后计算-#include<stdio.h> #include <stdlib.h>
cc
- 分析的是实例 #include<stdio.h> #include<stdlib.h> typedef struct BST* tree_pointer //定义数据类型 typedef struct BST{ int key tree_pointer left tree_pointer right }BST tree_pointer CreateBST(tree_pointer root, int data)
C_functions
- c所有函数速查日记,对于新手来说是一份很好的学习资料-#include <stdio.h> #include <stdlib.h> int main(void) { printf("Calling abort()\n") abort() return 0 /* This is never reached*/ }
c-P-P-lexical-analysis
- c++词法分析很简单的代码#include<iostream.h> #include<fstream.h> #include<stdlib.h> #include<stdio.h> #include<string.h> #include<conio.h> #include<process.h> /*头文件*/ -c++ lexical analysis is very simple c