#include <stdio.h>
#define N 4
#define Max 80
#define bool int
#define true 1
#define false 0
int SeatStatus[Max];//0表示已售 1表示为空
int SeatRemain=Max;
//定义链表
bool GetRequest(int *p);
void OutputResult(int * SeatNum, int Count);
int SaleSeat(int Count,int *SeatNum);
//读取售票信息
bool GetRequest(int *p)
{
const FILE* fp = fopen("d:\\request.txt","r");
static int nIndex = 0;
static int inputData[80] = {0};
static bool isfirst = true;
int i;
if(isfirst){
for(i = 0; i < 80; i++){
if(fscanf(fp,"%d,",&inputData[i]) == EOF) break;
}
isfirst = false;
fclose(fp);
}
if(inputData[nIndex] == 0 || nIndex == 80) return false;
*p = inputData[nIndex++];
retur
#define N 4
#define Max 80
#define bool int
#define true 1
#define false 0
int SeatStatus[Max];//0表示已售 1表示为空
int SeatRemain=Max;
//定义链表
bool GetRequest(int *p);
void OutputResult(int * SeatNum, int Count);
int SaleSeat(int Count,int *SeatNum);
//读取售票信息
bool GetRequest(int *p)
{
const FILE* fp = fopen("d:\\request.txt","r");
static int nIndex = 0;
static int inputData[80] = {0};
static bool isfirst = true;
int i;
if(isfirst){
for(i = 0; i < 80; i++){
if(fscanf(fp,"%d,",&inputData[i]) == EOF) break;
}
isfirst = false;
fclose(fp);
}
if(inputData[nIndex] == 0 || nIndex == 80) return false;
*p = inputData[nIndex++];
retur