<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><HTML><HEAD><TITLE> New Document </TITLE><META NAME="Generator" CONTENT="EditPlus"><META NAME="Author" CONTENT=""><META NAME="Keywords"
#include "stdafx.h"#include "stdio.h"#include "stdlib.h"#define SMALL 1#if(SMALL) #define MAX 7 int QueueData[MAX] = {'A','B','C','D','E','F','G'};#else #define MAX 14 int QueueData[MAX] =
//:============================“插花問題”的動態規劃法演算法============================#define F 100#define V 100/* 插花問題描述: 將f束鮮花插入v個花瓶中,使達到最徍的視覺效果, 問題相關約定及插花要求: 鮮花被編號為1--f,花瓶被編號為1--v,花瓶按從小到 大順序排列,一隻花瓶只能插一支花,鮮花i插入花瓶j中的
// Stack.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include "stdio.h"#include "stdlib.h"//* #define STACK_MAX_SIZE 7 int StackData[STACK_MAX_SIZE] = {'A','B','C','D','E','F','G'};//*//* #define STACK_MAX_SIZE 14
// Chart.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include "stdlib.h"//如:FROMHEAD = 1,則用頭插法;否則:則用尾插法#define FROMHEAD 1/* 如:HASHEAD 被定義,則各頂點的鄰接點鏈中<帶起始頂點>; 否則:各頂點的鄰接點鏈中<不帶起始頂點>;*/#define
// Detach.cpp : Defines the entry point for the console application.//#include "stdafx.h"#define MAXN 64int array[MAXN+1][MAXN];int main(int argc, char* argv[]){ int twon1,twon2,i,j,m,k; printf("指定n(n=2的k次冪)位選手/n"); scanf("%d",&k); array[1][1] =
// LongInt.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include "string.h"#define MAXLEN 50/*function InputLongInt()長整數輸入函數*/int InputLongInt(int *a,char *para){ int len,i; char number[MAXLEN];