line.c-某软件公司大约有30名员工，每名员工有姓名、工号、职务等属性，每年都有员工离职和入职。

把所有员工按照顺序存储结构建立一个线性表，建立离职和入职函数，当有员工离职或入职时，修改线性表，并且打印最新的员工名单。

Compute.cpp--约瑟夫（Josephus）环问题

8Queens.cpp--8皇后问题

4Colors.cpp--4色问题

4Fib.cpp--f0=f1=f2=0, f3=1,…,fi=fi-1+fi-2+fi-3+fi-4，

利用容量为k=4的循环队列，构造序列的前n+1项（f0, f1 , f2 ,… fn ），要求满足fn ≤200而fn+1 >200。-line.c-a software company about 30 employees, each employee has the name, work number, and rank each year, staff turnover and vacancies. All employees in accordance with the order of a linear table storage structure, the establishment of separation and entry functions, when employees leave or entry, modify the linear form, and print the latest staff list. Compute.cpp-- Joseph (Josephus) Central problems 8Queens.cpp--8 queens 4Colors.cpp--4 color problem 4Fib.cpp--f0 = f1 = f2 = 0, f3 = 1, ..., fi = fi- 1+ fi-2+ fi-3+ fi-4, with size k = 4 of the cycle for the queue, before the construction sequence n+1 items (f0, f1, f2, ... fn), required to meet the fn ≤ 200 and fn+1>　200.