}
}
total+=p>quantity;
q>next=p>next;
delete p;
}
}
//显示版权信息函数
void version()
{
cout< cout<<" ┏━━━━━━━━━━━━━━━━━━━━━━━┓"< cout<<" ┃ 模拟UNIX的成组链接法 ┃"< cout<<" ┠───────────────────────┨"< cout<<" ┃ (c)All Right Reserved Neo ┃"< cout<<" ┃sony006@163.com ┃"< cout<<" ┃version 2004 build 1122┃"< cout<<" ┗━━━━━━━━━━━━━━━━━━━━━━━┛"< cout< }
void main()
{
int f=1;
int chioce;
version();
head=initial();
total=0;
jhead=initial_job();
readData();
[1] [2] [3] [4] [5] [6] [7] [8]