#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++];
return true;
}
//输出售票结果
void OutputResult(int * SeatNum, int Count)
{
FILE* fp = fopen("d:\\result.txt","a");
int i;
fprintf(fp,"====================================\n");
for(i = 0; i < Count; i++){
fprintf(fp,"%d,",SeatNum[i]);
}
fprintf(fp,"\n");
fclose(fp);
}
//售出座位
int SaleSeat(int Count,int *SeatNum)
{
int i ,iCount;
iCount = 0;
switch (Count)
{
case 2:
for (i=0;i<Max;i+=2)
{
if((SeatStatus[i]==1)&&(SeatStatus[i+1]==1))
{
SeatStatus[i]=0;
SeatStatus[i+1]=0;
SeatNum[iCount++]=i+1;
SeatNum[iCount++]=i+2;
break;
}
}
case 3:
case 4:
{
int k=6;
for (i=0;i<Max;i+=k)
{
k=8-k;
if (SeatStatus[i]+SeatStatus[i+1]+SeatStatus[i+4]+SeatStatus[i+5]>Count)
{
if ((SeatStatus[i] == 1)&&(iCount < Count))
{
SeatStatus[i]=0;
SeatNum[iCount++]=i+1;
}
if ((SeatStatus[i+1] == 1)&&(iCount < Count))
{
SeatStatus[i+1]=0;
SeatNum[iCount++]=i+2;
}
if ((SeatStatus[i+4] == 1)&&(iCount < Count))
{
SeatStatus[i+4]=0;
SeatNum[iCount++]=i+5;
}
if ((SeatStatus[i+5] == 1)&&(iCount < Count))
{
SeatStatus[i+5]=0;
SeatNum[iCount++]=i+6;
}
break;
}
}
}
break;
default:
break;
}
if (iCount == 0)
{
for(i=0;(i<Max)&&(iCount < Count);i++)
{
if (SeatStatus[i] == 1)
{
SeatStatus[i] = 0;
SeatNum[iCount++]=i+1;
}
}
}
SeatRemain-=iCount;
return iCount;
}
void main()
{
int i,Count,SeatNum[Max];
Count = 0;
for (i=0;i<Max;i++)
{
SeatStatus[i] = 1;
}
while (GetRequest(&Count))
{
if (Count >= SeatRemain)
printf("Seat not enough!\n");
else
{
Count = SaleSeat(Count,SeatNum);
OutputResult(SeatNum,Count);
}
}
}
#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++];
return true;
}
//输出售票结果
void OutputResult(int * SeatNum, int Count)
{
FILE* fp = fopen("d:\\result.txt","a");
int i;
fprintf(fp,"====================================\n");
for(i = 0; i < Count; i++){
fprintf(fp,"%d,",SeatNum[i]);
}
fprintf(fp,"\n");
fclose(fp);
}
//售出座位
int SaleSeat(int Count,int *SeatNum)
{
int i ,iCount;
iCount = 0;
switch (Count)
{
case 2:
for (i=0;i<Max;i+=2)
{
if((SeatStatus[i]==1)&&(SeatStatus[i+1]==1))
{
SeatStatus[i]=0;
SeatStatus[i+1]=0;
SeatNum[iCount++]=i+1;
SeatNum[iCount++]=i+2;
break;
}
}
case 3:
case 4:
{
int k=6;
for (i=0;i<Max;i+=k)
{
k=8-k;
if (SeatStatus[i]+SeatStatus[i+1]+SeatStatus[i+4]+SeatStatus[i+5]>Count)
{
if ((SeatStatus[i] == 1)&&(iCount < Count))
{
SeatStatus[i]=0;
SeatNum[iCount++]=i+1;
}
if ((SeatStatus[i+1] == 1)&&(iCount < Count))
{
SeatStatus[i+1]=0;
SeatNum[iCount++]=i+2;
}
if ((SeatStatus[i+4] == 1)&&(iCount < Count))
{
SeatStatus[i+4]=0;
SeatNum[iCount++]=i+5;
}
if ((SeatStatus[i+5] == 1)&&(iCount < Count))
{
SeatStatus[i+5]=0;
SeatNum[iCount++]=i+6;
}
break;
}
}
}
break;
default:
break;
}
if (iCount == 0)
{
for(i=0;(i<Max)&&(iCount < Count);i++)
{
if (SeatStatus[i] == 1)
{
SeatStatus[i] = 0;
SeatNum[iCount++]=i+1;
}
}
}
SeatRemain-=iCount;
return iCount;
}
void main()
{
int i,Count,SeatNum[Max];
Count = 0;
for (i=0;i<Max;i++)
{
SeatStatus[i] = 1;
}
while (GetRequest(&Count))
{
if (Count >= SeatRemain)
printf("Seat not enough!\n");
else
{
Count = SaleSeat(Count,SeatNum);
OutputResult(SeatNum,Count);
}
}
}