diff --git a/level1/p01_runningLetter/running-letter.cpp b/level1/p01_runningLetter/running-letter.cpp
new file mode 100644
index 00000000..21a783f6
--- /dev/null
+++ b/level1/p01_runningLetter/running-letter.cpp
@@ -0,0 +1,26 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <windows.h>
+
+void print_1(int i)
+{
+	int j=0;
+	while (j<i) {printf(" ");j++;}
+}
+
+void print_2(int i)
+{
+	print_1(i);
+	printf("C\n");
+	Sleep(70);
+	system("cls");
+}
+
+int main()
+{
+	int i;
+	system("mode con cols=101 lines=30  ");
+	for (i=0;i<=100;i++) print_2(i);
+	for (i=100;i>=0;i--) print_2(i);
+	return 0;
+}
diff --git a/level1/p02_isPrime/isPrime.cpp b/level1/p02_isPrime/isPrime.cpp
new file mode 100644
index 00000000..8b6fa7ff
--- /dev/null
+++ b/level1/p02_isPrime/isPrime.cpp
@@ -0,0 +1,37 @@
+#include <stdio.h>
+#include <math.h>
+
+int judge(int num)
+{
+	int i,judge=0;
+	for (i=2;i<=sqrt(num);i++)
+	{
+		judge=num%i;
+		if (judge==0)
+		{
+			break;
+		}
+		else continue;
+	}
+	if (num==2||num==3)
+	{
+		judge=1;
+	}
+	return judge;
+}
+
+int main()
+{
+	int num;
+	printf("Please enter a nunber:\n");
+	scanf("%d",&num);
+	if (judge(num)==0) 
+	{
+		printf("%d is not a prime number.\n",num);
+	}
+	else
+	{
+		printf("%d is a prime number.\n",num);
+	}
+	return 0;
+}
diff --git a/level1/p03_Diophantus/Diophantus.cpp b/level1/p03_Diophantus/Diophantus.cpp
new file mode 100644
index 00000000..33841d99
--- /dev/null
+++ b/level1/p03_Diophantus/Diophantus.cpp
@@ -0,0 +1,15 @@
+#include<stdio.h>
+
+int main()
+{
+	int x;
+	for (x=1;x<200;x++)
+	{
+		if ((x/6.0+x/12.0+x/7.0+5+x/2.0+4)==(x/1.0))
+		{
+			printf("Diophantus was %d years old\n",x);
+		}
+		else continue;
+	}
+	return 0;
+}
diff --git a/level1/p04_ narcissus/narcissus.cpp b/level1/p04_ narcissus/narcissus.cpp
new file mode 100644
index 00000000..b42f3144
--- /dev/null
+++ b/level1/p04_ narcissus/narcissus.cpp	
@@ -0,0 +1,30 @@
+# include <stdio.h>
+# include <math.h>
+
+int judge(int n)
+{
+	int unit,tens,hundreds,m=n;
+	hundreds=n/100;
+	n-=hundreds*100;
+	tens=n/10;
+	unit=n-tens*10;
+	if ((pow(unit,3)+pow(tens,3)+pow(hundreds,3))==m)
+	{
+		return 1;
+	}
+	else return 0;
+}
+
+int main()
+{
+	int i;
+	for (i=100;i<1000;i++)
+	{
+		if(judge(i)==1)
+		{
+			printf("%-4d",i);
+		}
+		else continue;
+	}
+	return 0;
+}
diff --git a/level1/p05_allPrimes/allPrimes.cpp b/level1/p05_allPrimes/allPrimes.cpp
new file mode 100644
index 00000000..4005ae2d
--- /dev/null
+++ b/level1/p05_allPrimes/allPrimes.cpp
@@ -0,0 +1,41 @@
+#include <stdio.h>
+#include <time.h>
+
+int judge(int num)
+{
+	int i,judge=0;
+	for (i=2;i<(num/2+1);i++)
+	{
+		judge=num%i;
+		if (judge==0)
+		{
+			break;
+		}
+		else continue;
+	}
+	if (num==2||num==3)
+	{
+		judge=1;
+	}
+	return judge;
+}
+
+int main()
+{
+	int a=clock();
+	int i,c;
+	for (i=2;i<1000;i++)
+	{
+		if (judge(i)==0) 
+		{
+			continue;
+		}
+		else
+		{
+			printf("%-4d",i);
+		}
+	}
+	int b=clock();
+	printf ("\nRunning time:%d ms",c=b-a);
+	return 0;
+}
diff --git a/level1/p06_Goldbach/Goldbach.cpp b/level1/p06_Goldbach/Goldbach.cpp
new file mode 100644
index 00000000..d4815a21
--- /dev/null
+++ b/level1/p06_Goldbach/Goldbach.cpp
@@ -0,0 +1,42 @@
+#include <stdio.h>
+#include <math.h>
+
+int judge(int num)
+{
+	int i,judge=0;
+	for (i=2;i<(sqrt(num)+1);i++)
+	{
+		judge=num%i;
+		if (judge==0)
+		{
+			break;
+		}
+		else continue;
+	}
+	if (num==2||num==3)
+	{
+		judge=1;
+	}
+	return judge;
+}
+
+int main()
+{
+	int n,i,j;
+	printf("Please enter the range:\n");
+	scanf("%d",&j);
+	for (n=4;n<=j;n+=2)
+	{
+		for (i=2;i<n;i++)
+		{
+			if (((judge(i)!=0)) && ((judge(n-i))!=0))
+			{
+				printf("%d = %d+%d \n",n,i,(n-i));
+				break;
+			}
+			else continue;
+		}
+	}
+	return 0;
+}
+
diff --git a/level1/p07_encrypt_decrypt/encrypt-decrypt.cpp b/level1/p07_encrypt_decrypt/encrypt-decrypt.cpp
new file mode 100644
index 00000000..03bd829c
--- /dev/null
+++ b/level1/p07_encrypt_decrypt/encrypt-decrypt.cpp
@@ -0,0 +1,39 @@
+#include<stdio.h>
+#define K 2
+
+void encrypt(char *p)
+{
+	for (int i=0;i<100;i++,p++)
+	{
+		if ((*p)=='\0')
+		{break;}
+		(*p)+=K;
+		printf("%c",*p);
+	}
+}
+
+void decrypt(char *p)
+{
+	for (int i=0;i<100;i++,p++)
+	{
+		if ((*p)=='\0')
+		{break;}
+		(*p)-=K;
+		printf("%c",*p);
+	}
+}
+
+int main()
+{
+	int n;
+	void (*p1)(char *);
+	char ch[100];
+	printf("Please choose 1 or 2(1--encrypt, 2--decrypt) :\n");
+	scanf("%d",&n);
+	printf("Please enter your text:\n");
+	scanf("%s",ch);
+	(n==1) ? p1=encrypt :p1=decrypt;
+	printf("Result:\n");
+	(*p1)(ch);
+	return 0;
+}
diff --git a/level1/p08_hanoi/hanio.cpp b/level1/p08_hanoi/hanio.cpp
new file mode 100644
index 00000000..bf7145a8
--- /dev/null
+++ b/level1/p08_hanoi/hanio.cpp
@@ -0,0 +1,30 @@
+#include <stdio.h>
+
+void move(char x,char y)
+{
+	printf("%c-->%c\n",x,y);
+}
+
+void hanoi(int n,char one,char two,char three)
+{
+	if (n == 1)
+	{
+		move(one,three);
+	}
+	else 
+	{
+		hanoi(n-1,one,three,two);
+		move(one,three);
+		hanoi(n-1,two,one,three);
+	}
+}
+
+int main()
+{
+	int n;
+	printf("Please enter the number of disks:\n");
+	scanf("%d",&n);
+	printf("The steps are as follows:\n");
+	hanoi(n,'A','B','C');
+	
+}
diff --git a/level1/p09_maze/maze.cpp b/level1/p09_maze/maze.cpp
new file mode 100644
index 00000000..61e5cbe5
--- /dev/null
+++ b/level1/p09_maze/maze.cpp
@@ -0,0 +1,136 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <conio.h>
+#include <windows.h>
+#include <time.h> 
+#define ROW 10
+#define COL 10
+
+
+
+int main(){
+	void output(int (*p)[COL],int x,int y,char ch);			//函数声明 
+	void move(int (*p)[COL],char ch,int *px,int *py);
+	void print(int *p);
+	void goto_xy(int,int);
+	
+	int maze[ROW][COL]={										//迷宫数组 
+	35,43,35,35,35,35,35,35,35,35,
+	35,43,43,43,35,35,35,43,35,35,
+	35,35,35,43,35,35,35,43,35,35,
+	35,35,35,43,43,43,43,35,35,35,
+	35,43,43,43,43,35,43,35,35,35,
+	35,43,35,35,43,35,43,35,35,35,
+	35,43,43,35,35,35,43,35,43,35,
+	35,43,43,43,43,35,43,43,43,35,
+	35,43,35,35,35,35,35,35,43,43,
+	35,35,35,35,35,35,35,35,35,35
+	};
+	
+	int x = 0,y = 1;										//定义变量 
+	int *px = &x,*py = &y;
+	int (*p)[COL] = maze;
+	char m;
+	
+	output(p,x,y,'w');										//迷宫实现 
+
+	m = getch();
+	while (1){
+		move(p,m,px,py);
+		if (maze[ROW-2][COL-1] == 64){
+			break;
+		}
+		m = getch();
+	}
+	printf("Congratulations!\n");
+	system("pause");
+	return 0;
+}
+
+void print(int *p){											//输出迷宫数组 
+	printf("\n");
+	for (int i = 0; i<ROW; i++){
+		for (int j = 0; j<COL; j++,p++){
+			//if (*p == 43 || *p == 64){
+				printf(" ");
+			//}
+			printf("%c",*p);
+		}
+		printf("\n");
+	}
+		
+	printf("迷宫小游戏\n");
+	printf("图例：\n");
+	printf("%c --墙壁, %c --道路, %c --人物\n",35,43,64);
+	printf("输入w, a, s, d移动人物\n");
+	printf("w -- 向上, a -- 向左, s -- 向下, d -- 向右\n");
+	
+}
+
+void goto_xy(int x,int y){									//定位光标位置到指定坐标
+	HANDLE hOut;
+	hOut = GetStdHandle(STD_OUTPUT_HANDLE);
+	COORD pos={x,y};
+	SetConsoleCursorPosition(hOut,pos);
+}
+
+void output(int (*p)[COL],int x,int y,char ch){				//实现玩家移动 
+	
+	if (ch == 'w'){
+		*(*(p+x)+y) = 64;
+		system("cls");
+		print((int *) p);
+		goto_xy(0,20);
+	}
+	else {
+		*(*(p+x)+y) = 43;
+		system("cls");
+		print((int *) p);
+		goto_xy(0,20);
+	}
+}
+
+int isWall(int (*p)[COL],int x,int y){						//判断玩家移动位置是否为墙壁 
+	if (*(*(p+x)+y) == 43){
+		return 0;
+	}
+	else return 1;
+}
+
+void move(int (*p)[COL],char ch,int *px,int *py){			//实现玩家移动 
+	int x = *px, y = *py;
+	switch (ch){
+		case 'w':
+			if (isWall(p,x-1,y) == 0){
+				output(p,x,y,'b');
+				output(p,x-1,y,'w');
+				*px = x-1;
+			}
+			break;
+		case 'a':
+			if (isWall(p,x,y-1) == 0){
+				output(p,x,y,'b');
+				output(p,x,y-1,'w');
+				*py = y-1;
+			}
+			break;
+		case 's':
+			if (isWall(p,x+1,y) == 0){
+				output(p,x,y,'b');
+				output(p,x+1,y,'w');
+				*px = x+1;
+			}
+			break;
+		case 'd':
+			if (isWall(p,x,y+1) == 0){
+				output(p,x,y,'b');
+				output(p,x,y+1,'w');
+				*py = y+1;
+			}
+			break;
+		default:;
+	}
+}
+
+
+
diff --git a/level1/p09_maze/random-maze-without-cls.cpp b/level1/p09_maze/random-maze-without-cls.cpp
new file mode 100644
index 00000000..00e6d1d4
--- /dev/null
+++ b/level1/p09_maze/random-maze-without-cls.cpp
@@ -0,0 +1,328 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <conio.h>
+#include <windows.h>
+#include <time.h> 
+#define ROW 39															//迷宫行数 
+#define COL 39															//迷宫列数 
+#define DOWN 46															//玩家输入移动指令时光标的位置 
+
+typedef struct _SITE {													//自定义坐标类型SITE 
+
+INT X;
+
+INT Y;
+
+} SITE;
+
+int main(){
+	void output(int (*p)[COL],int x,int y,char ch);						//函数声明
+	void originalmaze(int (*p)[COL]);
+	void makemaze(int (*p)[COL], int *px, int *py);
+	void replace(int (*p)[COL]);
+	int destination(int (*p)[COL]);
+	void move(int (*p)[COL],char ch,int *px,int *py);
+	void print(int *p);
+	void goto_xy(int,int);
+	
+	int x = 0, y = 0, desti;												//定义变量 
+	
+	int *px = &x, *py = &y;
+	int maze[ROW][COL];
+	int (*p)[COL] = maze;
+	char m;
+	
+	originalmaze(p);
+	makemaze(p,px,py);
+	replace(p);
+	desti = destination(p);
+	
+	print((int *) p);
+	output(p,x,y,'w');												//迷宫实现 
+
+	m = getch();
+	while (1){
+		move(p,m,px,py);
+		if (maze[0][desti] == 64){
+			break;
+		}
+		m = getch();
+	}
+	printf("Congratulations!\n");
+	system("pause");
+	return 0;
+}
+
+void print(int *p){													//输出迷宫数组 
+	printf("\n");
+	for (int i = 0; i < ROW; i++){
+		for (int j = 0; j<COL; j++,p++){
+			printf(" ");
+			printf("%c",*p);
+		}
+		printf("\n");
+	}
+		
+	printf("迷宫小游戏\n");
+	printf("图例：\n");
+	printf("%c --墙壁, %c --人物\n",35,64);
+	printf("输入w, a, s, d移动人物\n");
+	printf("w -- 向上, a -- 向左, s -- 向下, d -- 向右\n");
+	
+}
+
+void printrow(int (*p)[COL], int x){
+	for (int i = 0; i < ROW; i++){
+		printf(" ");
+		printf("%c",*(*(p+x)+i));
+	}
+}
+
+void goto_xy(int x,int y){										//定位光标位置到指定坐标
+	HANDLE hOut;
+	hOut = GetStdHandle(STD_OUTPUT_HANDLE);
+	COORD pos={x,y};
+	SetConsoleCursorPosition(hOut,pos);
+}
+
+void originalmaze(int (*p)[COL]){									//初始化迷宫数组 
+	for (int i = 0; i < ROW; i++){
+		for (int j = 0; j < COL; j++){
+			if ((i%2) == 0){
+				*(*(p+i)+j) = 0;
+			}
+			else{
+				if (j != 0 && j != (COL-1)){
+					if (*(*(p+i)+(j-1)) == 0){
+						*(*(p+i)+j) = 1;
+					}
+					else {
+						*(*(p+i)+j) = 0;
+					}
+				}
+				else{
+					*(*(p+i)+j) = 0;
+				}
+			}
+		}
+	}
+}
+
+
+//此随机迷宫生成思路详见附件文档《迷宫地图基础》 --方案二 
+
+//此函数生成随机迷宫 
+void makemaze(int (*p)[COL], int *px, int *py){						//2x --红色x , 3x -- 蓝色x
+	int x = ROW-2, y = *py, x0, y0, r1, r2;
+	SITE randblue = {0,0};
+	
+	void mark(int (*p)[COL],int x,int y);							//函数声明 
+	SITE randchoose(int (*p)[COL],int *px,int *py);
+	int judire(int (*p)[COL],int *px,int *py);
+	
+    srand((unsigned int)time(NULL));
+    r1 = (rand()%((COL-1)/2) +1)*2 -1;								//生成2-COL 之间的随机偶数 
+    *(*(p+x)+r1) = 21;												//随机取一个地图边缘的1，把它标记为红色1
+    y = r1;
+    x0 = x; y0 = y;													//记录迷宫起点坐标 
+    
+    mark(p,x,y);													//把红色1旁边的0标记成蓝色0，表示"待定"
+    randblue = randchoose(p,px,py);									//随机选一个蓝色0
+    while (1){
+    	if (randblue.X != 0 && randblue.Y != 0){
+	    	*px = randblue.X; *py = randblue.Y;
+	    	x = *px; y = *py;
+	    	
+			int direction = judire(p,px,py);						//调用函数判断蓝色0的哪个方向有1, 返回值:1-左, 2-右, 3-上, 4-下 
+			switch (direction){
+				case 1:{
+					*(*(p+x)+(y-1)) = 21;
+					*(*(p+x)+y) = 20;
+					y--; *py = y;
+					break;
+				}
+				case 2:{
+					*(*(p+x)+(y+1)) = 21;
+					*(*(p+x)+y) = 20;
+					y++; *py = y;
+					break;
+				}
+				case 3:{
+					*(*(p+(x-1))+y) = 21;
+					*(*(p+x)+y) = 20;
+					x--; *px = x;
+					break;
+				}
+				case 4:{
+					*(*(p+(x+1))+y) = 21;
+					*(*(p+x)+y) = 20;
+					x++; *px = x;
+					break;
+				}
+				default:;
+			}
+			mark(p,x,y);
+			randblue = randchoose(p,px,py);
+    	}
+    	else {
+    		*(*(p+x0)+y0) = 41;
+    		*px = x0+1; *py = y0;								//将坐标重新定位至迷宫起点 
+    		break;
+    	}
+    }
+    
+}
+
+void replace(int (*p)[COL]){									//对生成的迷宫数组字符进行替换，便于输出 
+	for (int i = 0; i < ROW; i++){
+		for (int j = 0; j < COL; j++){
+			if (*(*(p+i)+j) == 0){
+				*(*(p+i)+j) = 35;
+			}
+			if (*(*(p+i)+j) == 41){
+				*(*(p+(i+1))+j) = 64;
+				*(*(p+i)+j) = 32;
+			}
+			if (*(*(p+i)+j) == 21 || *(*(p+i)+j) == 20){
+				*(*(p+i)+j) = 32;
+			}
+		}
+	}
+}
+
+int destination(int (*p)[COL]){							//生成迷宫出口 
+	int r;
+	srand((unsigned int)time(NULL));
+	r = rand()%(COL-3) +1;
+	while (*(*(p+1)+r) != 32){
+		r = rand()%(COL-3) +1;
+	}
+	*(*(p)+r) = 32;
+	return r;
+}
+
+void mark(int (*p)[COL],int x,int y){						//把红色1旁边的0标记成蓝色0，表示"待定"
+	if (*(*(p+x)+y) == 21){
+		if ((y-1) != 0 && *(*(p+x)+(y-1)) == 0){
+			*(*(p+x)+(y-1)) = 30;
+		}
+		if ((y+1) != (COL-1) && *(*(p+x)+(y+1)) == 0){
+			*(*(p+x)+(y+1)) = 30;
+		}
+		if ((x-1) != 0 && *(*(p+(x-1))+y) == 0){
+			*(*(p+(x-1))+y) = 30;
+		}
+		if ((x+1) != (ROW-1) && *(*(p+(x+1))+y) == 0){
+			*(*(p+(x+1))+y) = 30;
+		}
+	}
+}
+
+SITE randchoose(int (*p)[COL],int *px,int *py){				//随机选一个蓝色0
+	SITE blue[ROW*COL];
+	int k = 0, r;
+	for (int i = 1; i < (ROW-1); i++){
+		for (int j = 1; j < (COL-1); j++){
+			if (*(*(p+i)+j) == 30){
+				blue[k] = {i,j};
+				k++;
+			}
+		}
+	}
+	if (k != 0){
+		srand((unsigned int)time(NULL));
+		r = rand()%k;
+		*px = blue[r].X;
+		*py = blue[r].Y;
+		return blue[r];
+	}
+	else {
+		 SITE over = {0,0};
+		 return over;
+	}
+}
+
+int judire(int (*p)[COL],int *px,int *py){					//判断哪个方向有1; 返回值:1-左, 2-右, 3-上, 4-下 
+	int x = *px; int y = *py;
+	if (*(*(p+x)+(y+1)) == 21 && *(*(p+x)+(y-1)) == 1){
+		return 1;
+	}
+	else if (*(*(p+x)+(y-1)) == 21 && *(*(p+x)+(y+1)) == 1){
+		return 2;
+	}
+	else if (*(*(p+(x+1))+y) == 21 && *(*(p+(x-1))+y) == 1){
+		return 3;
+	}
+	else if (*(*(p+(x-1))+y) == 21 && *(*(p+(x+1))+y) == 1){
+		return 4;
+	}
+	else {
+		*(*(p+x)+y) = 0;
+		return 0;
+	}
+}
+
+
+
+void output(int (*p)[COL],int x,int y,char ch){				//实现玩家移动 
+	
+	if (ch == 'w'){
+		*(*(p+x)+y) = 64;
+		goto_xy(2*y+1,x+1);									//此两行代码实现不闪屏 
+		printf("%c",*(*(p+x)+y));
+		//printrow(p,x);
+		goto_xy(0,DOWN);
+	}
+	else {
+		*(*(p+x)+y) = 32;
+		goto_xy(2*y+1,x+1);
+		printf("%c",*(*(p+x)+y));
+		//printrow(p,x);
+		goto_xy(0,DOWN);
+	}
+}
+
+int isWall(int (*p)[COL],int x,int y){						//判断玩家移动位置是否为墙壁 
+	if (*(*(p+x)+y) == 32){
+		return 0;
+	}
+	else return 1;
+}
+
+void move(int (*p)[COL],char ch,int *px,int *py){			//实现玩家移动 
+	int x = *px, y = *py;
+	switch (ch){
+		case 'w':
+			if (isWall(p,x-1,y) == 0){
+				output(p,x,y,'b');
+				output(p,x-1,y,'w');
+				*px = x-1;
+			}
+			break;
+		case 'a':
+			if (isWall(p,x,y-1) == 0){
+				output(p,x,y,'b');
+				output(p,x,y-1,'w');
+				*py = y-1;
+			}
+			break;
+		case 's':
+			if (isWall(p,x+1,y) == 0){
+				output(p,x,y,'b');
+				output(p,x+1,y,'w');
+				*px = x+1;
+			}
+			break;
+		case 'd':
+			if (isWall(p,x,y+1) == 0){
+				output(p,x,y,'b');
+				output(p,x,y+1,'w');
+				*py = y+1;
+			}
+			break;
+		default:;
+	}
+}
+
+
+
diff --git a/level1/p09_maze/random-maze.cpp b/level1/p09_maze/random-maze.cpp
new file mode 100644
index 00000000..0b97a5e7
--- /dev/null
+++ b/level1/p09_maze/random-maze.cpp
@@ -0,0 +1,316 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <conio.h>
+#include <windows.h>
+#include <time.h> 
+#define ROW 39														//迷宫行数 
+#define COL 39														//迷宫列数 
+#define DOWN 46														//玩家输入移动指令时光标的位置 
+
+typedef struct _SITE {												//自定义坐标类型SITE 
+
+INT X;
+
+INT Y;
+
+} SITE;
+
+int main(){
+	void output(int (*p)[COL],int x,int y,char ch);					//函数声明 
+	void originalmaze(int (*p)[COL]);
+	void makemaze(int (*p)[COL], int *px, int *py);
+	void replace(int (*p)[COL]);
+	int destination(int (*p)[COL]);
+	void move(int (*p)[COL],char ch,int *px,int *py);
+	void print(int *p);
+	void goto_xy(int,int);
+	
+	int x = 0, y = 0, desti;												//定义变量 
+	int *px = &x, *py = &y;
+	int maze[ROW][COL];
+	int (*p)[COL] = maze;
+	char m;
+	
+	originalmaze(p);
+	makemaze(p,px,py);
+	replace(p);
+	desti = destination(p);
+	
+	output(p,x,y,'w');												//迷宫实现 
+
+	m = getch();
+	while (1){
+		move(p,m,px,py);
+		if (maze[0][desti] == 64){
+			break;
+		}
+		m = getch();
+	}
+	printf("Congratulations!\n");
+	system("pause");
+	return 0;
+}
+
+void print(int *p){													//输出迷宫数组 
+	printf("\n");
+	for (int i = 0; i<ROW; i++){
+		for (int j = 0; j<COL; j++,p++){
+			printf(" ");
+			printf("%c",*p);
+		}
+		printf("\n");
+	}
+		
+	printf("迷宫小游戏\n");
+	printf("图例：\n");
+	printf("%c --墙壁, %c --人物\n",35,64);
+	printf("输入w, a, s, d移动人物\n");
+	printf("w -- 向上, a -- 向左, s -- 向下, d -- 向右\n");
+	
+}
+
+void goto_xy(int x,int y){										//定位光标位置到指定坐标
+	HANDLE hOut;
+	hOut = GetStdHandle(STD_OUTPUT_HANDLE);
+	COORD pos={x,y};
+	SetConsoleCursorPosition(hOut,pos);
+}
+
+void originalmaze(int (*p)[COL]){									//初始化迷宫数组 
+	for (int i = 0; i < ROW; i++){
+		for (int j = 0; j < COL; j++){
+			if ((i%2) == 0){
+				*(*(p+i)+j) = 0;
+			}
+			else{
+				if (j != 0 && j != (COL-1)){
+					if (*(*(p+i)+(j-1)) == 0){
+						*(*(p+i)+j) = 1;
+					}
+					else {
+						*(*(p+i)+j) = 0;
+					}
+				}
+				else{
+					*(*(p+i)+j) = 0;
+				}
+			}
+		}
+	}
+}
+
+
+//此随机迷宫生成思路详见同名附件文档 --方案二 
+
+//此函数生成随机迷宫 
+void makemaze(int (*p)[COL], int *px, int *py){						//2x --红色x , 3x -- 蓝色x
+	int x = ROW-2, y = *py, x0, y0, r1, r2;
+	SITE randblue = {0,0};
+	
+	void mark(int (*p)[COL],int x,int y);							//函数声明 
+	SITE randchoose(int (*p)[COL],int *px,int *py);
+	int judire(int (*p)[COL],int *px,int *py);
+	
+    srand((unsigned int)time(NULL));
+    r1 = (rand()%((COL-1)/2) +1)*2 -1;								//生成2-COL 之间的随机偶数 
+    *(*(p+x)+r1) = 21;												//随机取一个地图边缘的1，把它标记为红色1
+    y = r1;
+    x0 = x; y0 = y;													//记录迷宫起点坐标 
+    
+    mark(p,x,y);													//把红色1旁边的0标记成蓝色0，表示"待定"
+    randblue = randchoose(p,px,py);									//随机选一个蓝色0
+    while (1){
+    	if (randblue.X != 0 && randblue.Y != 0){
+	    	*px = randblue.X; *py = randblue.Y;
+	    	x = *px; y = *py;
+	    	
+			int direction = judire(p,px,py);						//调用函数判断蓝色0的哪个方向有1, 返回值:1-左, 2-右, 3-上, 4-下 
+			switch (direction){
+				case 1:{
+					*(*(p+x)+(y-1)) = 21;
+					*(*(p+x)+y) = 20;
+					y--; *py = y;
+					break;
+				}
+				case 2:{
+					*(*(p+x)+(y+1)) = 21;
+					*(*(p+x)+y) = 20;
+					y++; *py = y;
+					break;
+				}
+				case 3:{
+					*(*(p+(x-1))+y) = 21;
+					*(*(p+x)+y) = 20;
+					x--; *px = x;
+					break;
+				}
+				case 4:{
+					*(*(p+(x+1))+y) = 21;
+					*(*(p+x)+y) = 20;
+					x++; *px = x;
+					break;
+				}
+				default:;
+			}
+			mark(p,x,y);
+			randblue = randchoose(p,px,py);
+    	}
+    	else {
+    		*(*(p+x0)+y0) = 41;
+    		*px = x0+1; *py = y0;								//将坐标重新定位至迷宫起点 
+    		break;
+    	}
+    }
+    
+}
+
+void replace(int (*p)[COL]){									//对生成的迷宫数组字符进行替换，便于输出 
+	for (int i = 0; i < ROW; i++){
+		for (int j = 0; j < COL; j++){
+			if (*(*(p+i)+j) == 0){
+				*(*(p+i)+j) = 35;
+			}
+			if (*(*(p+i)+j) == 41){
+				*(*(p+(i+1))+j) = 64;
+				*(*(p+i)+j) = 32;
+			}
+			if (*(*(p+i)+j) == 21 || *(*(p+i)+j) == 20){
+				*(*(p+i)+j) = 32;
+			}
+		}
+	}
+}
+
+int destination(int (*p)[COL]){							//生成迷宫出口 
+	int r;
+	srand((unsigned int)time(NULL));
+	r = rand()%(COL-3) +1;
+	while (*(*(p+1)+r) != 32){
+		r = rand()%(COL-3) +1;
+	}
+	*(*(p)+r) = 32;
+	return r;
+}
+
+void mark(int (*p)[COL],int x,int y){						//把红色1旁边的0标记成蓝色0，表示"待定"
+	if (*(*(p+x)+y) == 21){
+		if ((y-1) != 0 && *(*(p+x)+(y-1)) == 0){
+			*(*(p+x)+(y-1)) = 30;
+		}
+		if ((y+1) != (COL-1) && *(*(p+x)+(y+1)) == 0){
+			*(*(p+x)+(y+1)) = 30;
+		}
+		if ((x-1) != 0 && *(*(p+(x-1))+y) == 0){
+			*(*(p+(x-1))+y) = 30;
+		}
+		if ((x+1) != (ROW-1) && *(*(p+(x+1))+y) == 0){
+			*(*(p+(x+1))+y) = 30;
+		}
+	}
+}
+
+SITE randchoose(int (*p)[COL],int *px,int *py){				//随机选一个蓝色0
+	SITE blue[ROW*COL];
+	int k = 0, r;
+	for (int i = 1; i < (ROW-1); i++){
+		for (int j = 1; j < (COL-1); j++){
+			if (*(*(p+i)+j) == 30){
+				blue[k] = {i,j};
+				k++;
+			}
+		}
+	}
+	if (k != 0){
+		srand((unsigned int)time(NULL));
+		r = rand()%k;
+		*px = blue[r].X;
+		*py = blue[r].Y;
+		return blue[r];
+	}
+	else {
+		 SITE over = {0,0};
+		 return over;
+	}
+}
+
+int judire(int (*p)[COL],int *px,int *py){					//判断哪个方向有1; 返回值:1-左, 2-右, 3-上, 4-下 
+	int x = *px; int y = *py;
+	if (*(*(p+x)+(y+1)) == 21 && *(*(p+x)+(y-1)) == 1){
+		return 1;
+	}
+	else if (*(*(p+x)+(y-1)) == 21 && *(*(p+x)+(y+1)) == 1){
+		return 2;
+	}
+	else if (*(*(p+(x+1))+y) == 21 && *(*(p+(x-1))+y) == 1){
+		return 3;
+	}
+	else if (*(*(p+(x-1))+y) == 21 && *(*(p+(x+1))+y) == 1){
+		return 4;
+	}
+	else {
+		*(*(p+x)+y) = 0;
+		return 0;
+	}
+}
+
+
+void output(int (*p)[COL],int x,int y,char ch){				//实现玩家移动 
+	
+	if (ch == 'w'){
+		*(*(p+x)+y) = 64;
+		system("cls");
+		print((int *) p);
+		goto_xy(0,DOWN);
+	}
+	else {
+		*(*(p+x)+y) = 32;
+		system("cls");
+		print((int *) p);
+		goto_xy(0,DOWN);
+	}
+}
+
+int isWall(int (*p)[COL],int x,int y){						//判断玩家移动位置是否为墙壁 
+	if (*(*(p+x)+y) == 32){
+		return 0;
+	}
+	else return 1;
+}
+
+void move(int (*p)[COL],char ch,int *px,int *py){			//实现玩家移动 
+	int x = *px, y = *py;
+	switch (ch){
+		case 'w':
+			if (isWall(p,x-1,y) == 0){
+				output(p,x,y,'b');
+				output(p,x-1,y,'w');
+				*px = x-1;
+			}
+			break;
+		case 'a':
+			if (isWall(p,x,y-1) == 0){
+				output(p,x,y,'b');
+				output(p,x,y-1,'w');
+				*py = y-1;
+			}
+			break;
+		case 's':
+			if (isWall(p,x+1,y) == 0){
+				output(p,x,y,'b');
+				output(p,x+1,y,'w');
+				*px = x+1;
+			}
+			break;
+		case 'd':
+			if (isWall(p,x,y+1) == 0){
+				output(p,x,y,'b');
+				output(p,x,y+1,'w');
+				*py = y+1;
+			}
+			break;
+		default:;
+	}
+}
+
+
+
diff --git a/level1/p09_maze/random-maze.docx b/level1/p09_maze/random-maze.docx
new file mode 100644
index 00000000..7a391b9d
Binary files /dev/null and b/level1/p09_maze/random-maze.docx differ
diff --git a/level1/p10_pushBoxes/map1.dat b/level1/p10_pushBoxes/map1.dat
new file mode 100644
index 00000000..464962ce
--- /dev/null
+++ b/level1/p10_pushBoxes/map1.dat
@@ -0,0 +1,10 @@
+9,9,4,
+35,35,35,35,35,35,35,35,35,
+35,32,32,32,79,32,32,32,35,
+35,32,32,32,32,32,32,32,35,
+35,32,32,32,88,32,32,32,35,
+35,79,32,88,64,88,32,79,35,
+35,32,32,32,88,32,32,32,35,
+35,32,32,32,32,32,32,32,35,
+35,32,32,32,79,32,32,32,35,
+35,35,35,35,35,35,35,35,35
\ No newline at end of file
diff --git a/level1/p10_pushBoxes/map2.dat b/level1/p10_pushBoxes/map2.dat
new file mode 100644
index 00000000..934695f7
--- /dev/null
+++ b/level1/p10_pushBoxes/map2.dat
@@ -0,0 +1,10 @@
+9,9,3,
+35,35,35,35,35,32,32,32,32,
+35,32,32,32,35,32,32,32,32,
+35,32,88,32,35,32,35,35,35,
+35,32,88,64,35,32,35,79,35,
+35,35,35,88,35,35,35,79,35,
+32,35,35,32,32,32,32,79,35,
+32,35,32,32,32,35,32,32,35,
+32,35,32,32,32,35,35,35,35,
+32,35,35,35,35,35,32,32,32.
\ No newline at end of file
diff --git a/level1/p10_pushBoxes/pushBoxes.c b/level1/p10_pushBoxes/pushBoxes.c
new file mode 100644
index 00000000..8a1ac7b8
--- /dev/null
+++ b/level1/p10_pushBoxes/pushBoxes.c
@@ -0,0 +1,513 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <conio.h>
+#include <windows.h>
+	
+int main(){
+	void chooselevel(int *plevel);
+	void showscore();
+	void getrowcolaim(FILE *fin,int *prow,int *pcol,int *paim);
+	void creatmap(FILE *fin,int *p,int row,int col);
+	void output(int *p,int x,int y,int n,int COL);							//函数声明 
+	int getmove(int *p,char ch,int *px,int *py,int ROW,int COL);
+	void print(int *p,int ROW,int COL);
+	void findplayer(int *p,int *px,int *py,int ROW,int COL);
+	void goto_xy(int,int);
+	int gameover(int *p,int ROW,int COL,int AIM);
+	void savescores(FILE *fout,int steps);
+	
+	int x = 0,y = 0;														//定义变量 
+	int *px = &x,*py = &y;
+	
+	char m;
+	
+	int row, col, aim;
+	int *prow = &row, *pcol = &col, *paim = &aim;
+	
+	FILE *fin,*fout;
+	
+	int level;
+	int *plevel = &level;
+	
+	chooselevel(plevel);													//调用选关函数 
+	while (1){
+		switch (level){
+			case 0:{												//调用函数查看纪录
+				showscore();
+				system("pause");
+				system("cls");
+				chooselevel(plevel);
+			}
+			case 1:{														//打开对应关卡文件 
+				if ((fin = fopen("map1.dat","r+")) == NULL) {
+					printf("Can't open this map!\n");
+					exit(0);
+				}
+				if ((fout = fopen("score1.dat","a+")) == NULL) {
+					printf("Can't read the scores!\n");
+					exit(0);
+				}
+				break;
+			}
+			case 2:{
+				if ((fin = fopen("map2.dat","r+")) == NULL) {
+					printf("Can't open this map!\n");
+					exit(0);
+				}
+				if ((fout = fopen("score2.dat","a+")) == NULL) {
+					printf("Can't read the scores!\n");
+					exit(0);
+				}
+				break;
+			}
+			default:;
+		}
+		if (level != 0){
+			break;
+		}
+	}
+	
+	
+	getrowcolaim(fin,prow,pcol,paim);									//获取地图行数,列数和箱子数 
+	
+	const int ROW = row, COL = col, AIM = aim;							//创建对应的大小数组 并 读入地图数组 
+	int map[ROW][COL];
+	int *p = &map[0][0];
+	creatmap(fin,&map[0][0],ROW,COL);
+	
+	
+	print(&map[0][0],ROW,COL);      									//输出地图 
+	findplayer(&map[0][0],px,py,ROW,COL);								//定位玩家初始坐标 
+	goto_xy(0,ROW+9);
+	
+	int steps = 0;														//此变量记录玩家步数 
+	
+	m = getch();
+	while (1){
+		
+		if (m == 'q') {													//输入 q 退出游戏 
+			printf("Game Over!\n");
+			system("pause");
+			exit(0);
+		}
+		
+		int temp = getmove(p,m,px,py,ROW,COL);							//玩家每推着箱子走一步，计数器+1
+		if (temp == 1){
+			steps++;
+		}
+		goto_xy(0,ROW+9);
+		printf("已走步数:%d\n",steps);	
+		
+		if (gameover(&map[0][0],ROW,COL,AIM) == 0){						//箱子全部到达目的地,游戏结束 
+			break;
+		}
+		
+		m = getch();
+	}
+	printf("Congratulations!\n");										//收尾工作 
+	savescores(fout,steps);												//保存成绩 
+	fclose(fin);														//关闭文件 
+	fclose(fout);
+	system("pause");
+	return 0;
+}
+
+void chooselevel(int *plevel) {											//选关函数 
+	printf("推箱子小游戏\n");
+	printf("输入 0 查看纪录  1,2... 选关\n");
+	
+	scanf("%d",plevel);
+	system("cls");
+	
+}
+
+void showscore(){														//从对应文件在读入纪录 
+	printf("请输入你想查看纪录的关卡:\n");
+	int n;
+	scanf("%d",&n);
+	FILE *fscore;
+	switch(n){
+		case 1:{
+			if ((fscore = fopen("score1.dat","r")) == NULL) {
+				printf("Can't read your score!\n");
+				exit(0);
+			}
+			break;
+		}
+		case 2:{
+			if ((fscore = fopen("score2.dat","r")) == NULL) {
+				printf("Can't read your score!\n");
+				exit(0);
+			}
+			break;
+		}
+		default:;
+	}
+	rewind(fscore);
+	
+	while(!feof(fscore)){
+		putchar(getc(fscore));
+	}
+	putchar(10);		//输出一个空格 
+}
+
+void getrowcolaim(FILE *fin,int *prow,int *pcol,int *paim){				//从文件中读入地图行数,列数和箱子数 
+	int row,col,aim;
+	fscanf(fin,"%d,%d,%d,",&row,&col,&aim);
+	*prow = row; *pcol = col; *paim = aim;
+}
+
+void creatmap(FILE *fin,int *p,int row,int col){						//从文件中读入地图数组 
+	
+	for (int i = 0; i < row; i++){
+		for (int j = 0; j < col; j++){
+			fscanf(fin,"%d,",(p+(i*col)+j));
+		}
+	}
+}
+
+void print(int *p,int ROW,int COL){												//输出地图数组 
+	for (int i = 0; i<ROW; i++){
+		for (int j = 0; j<COL; j++,p++){
+			printf(" ");
+			printf("%c",*p);
+		}
+		printf("\n");
+	}
+		
+	printf("\n推箱子小游戏\n图例:\n");
+	printf("%c --空地, %c --墙壁, %c --未到目的地箱子, %c --目的地, %c --玩家, %c --已到目的地箱子\n",32,35,88,79,64,85);
+	printf("输入w, a, s, d移动人物\n");
+	printf("w -- 向上, a -- 向左, s -- 向下, d -- 向右\n");
+	printf("输入 q 退出游戏\n");
+}
+
+void goto_xy(int x,int y){									//定位光标位置到指定坐标
+	HANDLE hOut;
+	hOut = GetStdHandle(STD_OUTPUT_HANDLE);
+	COORD pos={x,y};
+	SetConsoleCursorPosition(hOut,pos);
+}
+
+void findplayer(int *p,int *px,int *py,int ROW,int COL){					//定位玩家初始坐标 
+	for (int i = 0; i<ROW; i++){
+		for (int j = 0; j<COL; j++,p++){
+			if (*p == 64){
+				*px = i; 
+				*py = j;
+				return;
+			}
+		}
+	}
+}
+
+
+int isBox(int *p,int x,int y,int COL){						//判断位置(x,y)是否为箱子 
+	if (*(p+(x*COL)+y) == 88){
+		return 10;
+	}
+	else if (*(p+(x*COL)+y) == 85){
+		return 11;
+	}
+	else return 0;
+}
+
+int isStop(int *p,int x,int y,int COL){						//判断下一步是否可移动到位置(x,y)
+	if (*(p+(x*COL)+y) == 32 || *(p+(x*COL)+y) == 79){
+		return 0;
+	}
+	else return 1;
+}
+
+int isDesti(int *p,int x,int y,int COL){						//判断位置(x,y)是否为目的地 
+	if (*(p+(x*COL)+y) == 79){
+		return 1;
+	}
+	else return 0;
+}
+
+void judge(int *p,int *pr,char ch,int x,int y,int COL){		//判断函数，判断玩家即将移动的方向 的情况， 
+	int x0 = x, y0 = y;										//并将判断结果返回到move函数的result数组中 
+	switch(ch){
+		case 'w':{
+			x-=1;
+			*pr = isBox(p,x,y,COL);				//判断玩家前方是否为箱子 
+			if(*pr == 10){					//进一步判断，该箱子是什么箱子 
+				x-=1;						//如果是未到目的地的箱子，x-1，供下面的函数进一步判断 
+			}
+			else if(*pr == 11){
+				x-=1;
+				*(pr+4) = 1;				//如果是已到目的地的箱子，返回结果到result数组，记录该箱子状态为 已到目的地 
+			}
+			pr++;
+			*pr = isStop(p,x,y,COL); pr++;		//判断即将移动的位置是否可移动 
+			*pr = isDesti(p,x,y,COL);pr++;		//判断即将移动的位置是否为目的地 
+			
+			if (*(p+(x0*COL)+y0) == 641){	//判断玩家当前是否站在目的地上 
+				*pr = 1;
+			}
+			break;
+		}
+		case 'a':{
+			y-=1;
+			*pr = isBox(p,x,y,COL);
+			if(*pr == 10){
+				y-=1;
+			}
+			else if(*pr == 11){
+				y-=1;
+				*(pr+4) = 1;
+			}
+			pr++;
+			*pr = isStop(p,x,y,COL); pr++;
+			*pr = isDesti(p,x,y,COL);pr++;
+			
+			if (*(p+(x0*COL)+y0) == 641){
+				*pr = 1;
+			}
+			break;
+		}
+		case 's':{
+			x+=1;
+			*pr = isBox(p,x,y,COL);
+			if(*pr == 10){
+				x+=1;
+			}
+			else if(*pr == 11){
+				x+=1;
+				*(pr+4) = 1;
+			}
+			pr++;
+			*pr = isStop(p,x,y,COL); pr++;
+			*pr = isDesti(p,x,y,COL);pr++;
+			
+			if (*(p+(x0*COL)+y0) == 641){
+				*pr = 1;
+			}
+			break;
+		}
+		case 'd':{
+			y+=1;
+			*pr = isBox(p,x,y,COL);
+			if(*pr == 10){
+				y+=1;
+			}
+			else if(*pr == 11){
+				y+=1;
+				*(pr+4) = 1;
+			}
+			pr++;
+			*pr = isStop(p,x,y,COL); pr++;
+			*pr = isDesti(p,x,y,COL);pr++;
+			
+			if (*(p+(x0*COL)+y0) == 641){
+				*pr = 1;
+			}
+			break;
+		}
+		default:;
+	}
+}
+
+void output(int *p,int x,int y,int n,int COL){			//输出函数，根据传入参数进行不同的输出 
+	switch(n){
+		case 1:{							//在位置(x,y)输出 空地 
+			*(p+(x*COL)+y) = 32;
+			goto_xy(2*y+1,x);
+			printf("%c",*(p+(x*COL)+y));
+			break;
+		}
+		case 2:{							//在位置(x,y)输出 玩家 
+			*(p+(x*COL)+y) = 64;
+			goto_xy(2*y+1,x);
+			printf("%c",*(p+(x*COL)+y));
+			break;
+		}
+		case 3:{							//在位置(x,y)输出 站在目的地上的玩家 
+			*(p+(x*COL)+y) = 641;
+			goto_xy(2*y+1,x);
+			printf("%c",64);
+			break;
+		}
+		case 4:{							//在位置(x,y)输出 未到目的地的箱子 
+			*(p+(x*COL)+y) = 88;
+			goto_xy(2*y+1,x);
+			printf("%c",*(p+(x*COL)+y));
+			break;
+		}
+		case 5:{							//在位置(x,y)输出 已到目的地的箱子 
+			*(p+(x*COL)+y) = 85;
+			goto_xy(2*y+1,x);
+			printf("%c",*(p+(x*COL)+y));
+			break;
+		}
+		case 6:{							//在位置(x,y)输出 目的地 
+			*(p+(x*COL)+y) = 79;
+			goto_xy(2*y+1,x);
+			printf("%c",*(p+(x*COL)+y));
+			break;
+		}
+	}
+}
+
+void move(int *p,int *pr,int x,int y,int x1,int y1,int x2,int y2,int COL){
+	//移动函数,根据result数组的内容，调用output函数输出从而实现玩家移动和推箱子 
+		if (*pr == 0){								// 
+			if(*(pr+2) == 0){						//result数组内容代表的含义:玩家即将移动的位置 的情况 
+				if (*(pr+3) == 0){					//result[0]: 是否为箱子，0 --不是，1 --是 
+					output(p,x,y,1,COL);			//result[1]: 是否为障碍物，0 --不是，1 --是 
+					output(p,x1,y1,2,COL);			//result[2]: 是否为目的地，0 --不是，1 -- 是 
+				}									//result[3]: 玩家当前位置是否为目的地， 0 --不是，1 --是 
+				else {								//result[4]: 箱子当前位置是否为目的地， 0 --不是，1 --是 
+					output(p,x,y,6,COL);
+					output(p,x1,y1,2,COL);
+				}
+			}
+			else {
+				if (*(pr+3) == 0){
+					output(p,x,y,1,COL);
+					output(p,x1,y1,3,COL);
+				}
+				else {
+					output(p,x,y,6,COL);
+					output(p,x1,y1,3,COL);
+				}
+			}
+		}
+		else {
+			if(*(pr+2) == 0){
+				if (*(pr+3) == 0){
+					if (*(pr+4) == 0){
+						output(p,x,y,1,COL);
+						output(p,x1,y1,2,COL);
+						output(p,x2,y2,4,COL);
+					}
+					else {
+						output(p,x,y,1,COL);
+						output(p,x1,y1,3,COL);
+						output(p,x2,y2,4,COL);
+					}
+				}
+				else {
+					if (*(pr+4) == 0){
+						output(p,x,y,6,COL);
+						output(p,x1,y1,2,COL);
+						output(p,x2,y2,4,COL);
+					}
+					else {
+						output(p,x,y,6,COL);
+						output(p,x1,y1,3,COL);
+						output(p,x2,y2,4,COL);
+					}
+				}
+			}
+			else {
+				if (*(pr+3) == 0){
+					if (*(pr+4) == 0){
+						output(p,x,y,1,COL);
+						output(p,x1,y1,2,COL);
+						output(p,x2,y2,5,COL);
+					}
+					else {
+						output(p,x,y,1,COL);
+						output(p,x1,y1,3,COL);
+						output(p,x2,y2,5,COL);
+					}
+				}
+				else {
+					if (*(pr+4) == 0){
+						output(p,x,y,6,COL);
+						output(p,x1,y1,2,COL);
+						output(p,x2,y2,5,COL);
+					}
+					else {
+						output(p,x,y,6,COL);
+						output(p,x1,y1,3,COL);
+						output(p,x2,y2,5,COL);
+					}
+				}
+			}
+		}
+}
+
+int getmove(int *p,char ch,int *px,int *py,int ROW,int COL){		//读入玩家移动方向，并调用move函数进行移动 
+	int x = *px, y = *py;
+	int result[5] = {0,0,0,0,0};
+	int *pr = &result[0];
+	
+	judge(p,pr,ch,x,y,COL);
+	
+	switch(ch){
+		case 'w':{
+			if ((x-1) != 0 && result[1] == 0){
+				move(p,pr,x,y,x-1,y,x-2,y,COL);
+				*px = x-1;
+			}
+			break;
+		}
+		case 'a':{
+			if ((y-1) != 0 && result[1] == 0){
+				move(p,pr,x,y,x,y-1,x,y-2,COL);
+				*py = y-1;
+			}
+			break;
+		}
+		case 's':{
+			if ((x+1) != (ROW-1) && result[1] == 0){
+				move(p,pr,x,y,x+1,y,x+2,y,COL);
+				*px = x+1;
+			}
+			break;
+		}
+		case 'd':{
+			if ((y+1) != (COL-1) && result[1] == 0){
+				move(p,pr,x,y,x,y+1,x,y+2,COL);
+				*py = y+1;
+			}
+			break;
+		}
+		default :{
+			return 0;
+		}
+	}
+	if (((result[0]/10) == 1) && (result[1] == 0)) {
+		return 1;
+	}
+	return 0;
+} 
+
+
+int gameover(int *p,int ROW,int COL,int AIM){									//判断箱子是否全部到达目的地 
+	int count=0;
+	for (int i = 0; i<ROW; i++){
+		for (int j = 0; j<COL; j++,p++){
+			if (*p == 85){
+				count++;
+			}
+		}
+	}
+	if (count == AIM){
+		return 0;
+	}
+	else {
+		return 1;
+	}
+}
+
+void savescores(FILE *fout,int steps){											//保存玩家成绩 
+	char name[20];
+	int i = 0;
+	printf("\n请留下尊姓大名(以 # 结束):");
+	name[0] = getchar();
+	
+	while (name[i] != '#'){
+		fprintf(fout,"%c",name[i]);
+		i++;
+		name[i] = getchar();
+		
+	}
+	fprintf(fout," : ");
+	fprintf(fout,"%d ,\n",steps);
+	printf("你的成绩已保存!\n");
+}
+
diff --git a/level1/p11_linkedList/linkedlist.c b/level1/p11_linkedList/linkedlist.c
new file mode 100644
index 00000000..c0c52773
--- /dev/null
+++ b/level1/p11_linkedList/linkedlist.c
@@ -0,0 +1,111 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define LEN sizeof(Stu)
+
+typedef struct Student{
+	long num;
+	float score;
+	struct Student *next;
+}Stu;
+
+int n;
+Stu * creat();
+void print(Stu *head);
+Stu * reverse(Stu *head);
+int search(Stu *head,int t);
+
+int main(){
+	int t=0;
+	Stu *pt = creat();//创建链表 
+	printf("\n");
+	print(pt);
+	pt = reverse(pt);//反转链表 
+	printf("\nreverse:\n");
+	print(pt);
+	printf("\n");
+	t = search(pt,t);//查找第一个满足要求的节点 
+	printf("%d ",t);
+	t = search(pt,t);//查找下一个满足要求的节点 
+	printf("%d ",t);
+	return 0;
+}
+
+Stu * creat() {
+	Stu *head = NULL, *p1 = NULL, *p2 = NULL;
+	p1 = p2 = (Stu *) malloc(LEN);
+	scanf("%ld %f",&p1 -> num,&p1 -> score);
+	while (p1 -> num != 0){
+		n++;
+		if (n == 1){
+			head = p1;
+		}
+		else{
+			p2 -> next = p1;
+		}
+		p2 = p1;
+		p1 = (Stu *) malloc(LEN);
+		scanf("%ld %f",&p1 -> num,&p1 -> score);
+	}
+	p2 -> next = NULL;
+	return head;
+}
+
+void print(Stu *head){
+	Stu *p = head;
+	while (head != NULL){
+		printf("%ld %.1f\n",p -> num,p -> score);
+		if (p -> next == NULL) {
+			break;
+		}
+		p = p -> next;
+	}
+}
+
+Stu * reverse(Stu *head)  {  
+    /*递归法 
+	if (head == NULL || head -> next == NULL)  {     
+        return head;  
+    }     
+    Stu *p = head -> next;  
+    Stu *newhead =  reverse(p);  
+    p -> next = head;  
+    head -> next = NULL;  
+    return newhead; */
+    
+	Stu *cur = head, *temp = head;
+	if ((cur -> next) != NULL){
+		cur = cur -> next;
+		temp -> next = NULL;
+	}
+	while (1){
+		temp = cur;
+		cur = cur -> next;
+		temp -> next = head;
+		head = temp;
+		if (cur -> next == NULL){
+			cur -> next = temp;
+			break;
+		}
+	}
+	head = cur;
+	return head;
+}  
+
+int search(Stu *head,int t){
+	int m=0;
+	Stu *p = head;
+	while(head != NULL){
+		m++;
+		if((p->score < 60) || (p->next == NULL)){
+			if(m>t){
+				break;
+			}
+		}
+		p = p -> next;
+	}
+	if((m>=n)&&(p->score >= 60)){
+		return -1;
+	}
+	return m;
+}
+
diff --git a/level1/p12_warehouse/warehouse.c b/level1/p12_warehouse/warehouse.c
new file mode 100644
index 00000000..e5fb914c
--- /dev/null
+++ b/level1/p12_warehouse/warehouse.c
@@ -0,0 +1,165 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+//货号为4位,数量为2位 
+
+void print();
+void outList();
+void add();
+void move();
+
+int main() {
+	print();
+	int m;
+	m=getch();
+	while(1){
+		system("cls");
+		switch(m){
+			case 49:{
+				printf("货号  数量\n");
+				outList();
+				break;
+			}
+			case 50:{
+				add();
+				break;
+			}
+			case 51:{
+				move();
+				break;
+			}
+			case 52:{
+				printf("感谢使用!\n");
+				system("pause");
+				exit(0);
+				break;
+			}
+			default:;
+		}
+		system("cls");
+		print();
+		m=getch();
+	}
+	
+	
+	return 0;
+}
+
+void print(){
+	printf("1.显示存货列表\n");
+	printf("2.入库\n");
+	printf("3.出库\n");
+	printf("4.退出程序\n");
+}
+
+void outList(){
+	FILE *fin;
+	if((fin=fopen("list.dat","r"))==NULL){
+		printf("读取存货列表失败!\n");
+		system("pause");
+		system("cls");
+		return;
+	}
+	rewind(fin);
+	while(!feof(fin)){
+		putchar(getc(fin));
+	}
+	putchar(10);
+	fclose(fin);
+	
+	system("pause");
+	system("cls");
+}
+
+void add(){
+	FILE *fout;
+	if((fout=fopen("list.dat","a+"))==NULL){
+		printf("打开文件失败!");
+		system("pause");
+		system("cls");
+		return;
+	}
+	char ch='y';
+	while(ch=='y'){
+		char goods[20];
+		int i = 0;
+		printf("请输入货物型号(以 # 结束):\n");
+		goods[0] = getchar();
+		
+		while (goods[i] != '#'){
+			fprintf(fout,"%c",goods[i]);
+			i++;
+			goods[i] = getchar();	
+		}
+		fprintf(fout," : ");
+		
+		int num;
+		printf("请输入货物数量:\n");
+		getchar();
+		scanf("%d",&num);
+		getchar();
+		if(num<10){
+			fprintf(fout,"%d",0);
+			fprintf(fout,"%d\n",num);
+		}
+		else{
+			fprintf(fout,"%d\n",num);
+		}
+		
+		printf("是否继续?(y/n)\n");
+		ch = getch();
+	}
+	fclose(fout);	
+}
+
+void move(){
+	FILE *fout;
+	if((fout=fopen("list.dat","r+"))==NULL){
+		printf("打开文件失败!");
+		system("pause");
+		system("cls");
+		return;
+	}
+	
+	int goods=0,num1=0,num2=0,num3=0;
+	char ch='y';
+	while(ch=='y'){
+		long tag=7;
+		printf("请输入货号:\n");
+		scanf("%d",&goods);
+		getchar();
+		tag=tag+1+(goods-1)*10;
+		fseek(fout,tag,SEEK_SET);
+		
+		printf("请输入出库数量:\n");
+		scanf("%d",&num1);
+		getchar();
+		fscanf(fout,"%d\n",&num2);
+		rewind(fout);
+		fseek(fout,tag,SEEK_SET);
+		num3=num2-num1;
+		if(num3<10){
+			if(num3>0){
+				fprintf(fout,"%d",0);
+				fprintf(fout,"%d",num3);
+			}
+			else{
+				printf("出库数量大于库存数量,请重新输入!\n");
+				continue;
+			}
+		}
+		else{
+			fprintf(fout,"%d",num3);
+		}
+		
+		fseek(fout,tag,SEEK_SET);
+		printf("操作成功!此货物目前数量:");
+		fscanf(fout,"%d\n",&num2);
+		printf("%d\n",num2);
+		
+		printf("是否继续?(y/n)\n");
+		ch=getch();
+	}
+	fclose(fout);
+}
+