diff --git a/level1/p01_runningLetter/main.c b/level1/p01_runningLetter/main.c
new file mode 100644
index 00000000..9df6682e
--- /dev/null
+++ b/level1/p01_runningLetter/main.c
@@ -0,0 +1,42 @@
+#include <stdio.h>  
+#include <stdlib.h>  
+#include <windows.h>  
+/* run this program using the console pauser or add your own getch, system("pause") or input loop */
+
+int main(int argc, char *argv[]) {
+  int a,b;  
+    a = 0;
+	while(1){
+		//从左向右 	
+	    while (a<=79)  
+	    {  
+	        system ("cls");  
+	        b = 1;  
+	        while (b<=a)  
+	        {  
+	            printf(" ");  
+	            ++b;  
+	        }  
+	        printf("H");  
+	        Sleep(100);  
+	        ++a;  
+	    } 
+	    a--;
+		//从右向左
+		while (a> 0)  //如果使用大于等于，将会于开头处输出两个0空格的H，导致停顿时间变长 
+	    {  
+	        system ("cls"); 
+			b = 1;
+	        while (b<=a)  
+	        {  
+	            printf(" ");  
+	            ++b;  
+	        }  
+	        printf("H");  
+	        Sleep(100);  
+	        --a;  
+	    } 
+	}
+    system("pause");  
+    return 0;  
+}  
diff --git a/level1/p02_isPrime/main.c b/level1/p02_isPrime/main.c
new file mode 100644
index 00000000..c8173408
--- /dev/null
+++ b/level1/p02_isPrime/main.c
@@ -0,0 +1,34 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define MIN_PRIME 2
+/* run this program using the console pauser or add your own getch, system("pause") or input loop */
+
+int main(int argc, char *argv[]) {
+	
+	/*input*/
+	printf("Please input a number\n");
+	int number;
+	scanf("%d",&number);
+	
+	/*judgement*/
+	int i;
+	for(i=MIN_PRIME;i<number;i++){
+		if(number==MIN_PRIME){
+			goto is_prime;
+		}
+		else if(number%i!=0){		
+			continue;
+		}
+		else{
+			goto is_not_prime;
+		}
+	}
+	
+	/*print*/
+is_prime:
+	printf("%d is a prime.\n",number);
+	return 0;
+is_not_prime:
+	printf("%d is not a prime.\n",number);	
+	return 0;
+}
diff --git a/level1/p03_Diophantus/main.c b/level1/p03_Diophantus/main.c
new file mode 100644
index 00000000..401ba832
--- /dev/null
+++ b/level1/p03_Diophantus/main.c
@@ -0,0 +1,10 @@
+#include <stdio.h>
+
+int main() {
+    for(float FatherAge=1;FatherAge<200;FatherAge++){
+        if(FatherAge/6+FatherAge/12+FatherAge/7+5+FatherAge/2+4==FatherAge){
+            printf("%f\n",FatherAge-4);
+        }
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/level1/p04_ narcissus/p04_ narcissus.c b/level1/p04_ narcissus/p04_ narcissus.c
new file mode 100644
index 00000000..07b47d3f
--- /dev/null
+++ b/level1/p04_ narcissus/p04_ narcissus.c	
@@ -0,0 +1,27 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+/* run this program using the console pauser or add your own getch, system("pause") or input loop */
+
+int main(int argc, char *argv[]) {
+	int number;
+	int hundred;
+	int ten;
+	int one;
+	int target;
+	
+	number = 100;
+	while(number<=999)
+	{
+		hundred = number/100;
+		ten = (number-hundred*100)/10;
+		one = number%10;
+		target = pow(hundred,3)+pow(ten,3)+pow(one,3);
+		if(target==number)
+		{
+			printf("%d\n",number);
+		}
+		number++;
+	}
+	return 0;
+}
diff --git a/level1/p05_allPrimes/p05_allPrimes.c b/level1/p05_allPrimes/p05_allPrimes.c
new file mode 100644
index 00000000..d1063f9b
--- /dev/null
+++ b/level1/p05_allPrimes/p05_allPrimes.c
@@ -0,0 +1,42 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#define MIN_PRIME 2
+/* run this program using the console pauser or add your own getch, system("pause") or input loop */
+
+int main(int argc, char *argv[]) {
+	int number;
+	clock_t t1,t2;
+	t1 = clock();
+	number = MIN_PRIME;
+	while(number<=1000)
+	{
+		if(is_prime(number))
+		{
+			printf("%d\n",number);
+		}
+		number++;
+	}
+	t2 = clock();
+	printf("%d\n",t2-t1);
+	return 0;
+}
+int is_prime(number){
+	int i;
+	for (i=MIN_PRIME;i<number;i++)
+	{
+		if(number==MIN_PRIME)
+		{
+			return 1;
+		}
+		else if(number%i!=0)
+		{
+			continue;
+		}
+		else
+		{
+			return 0;
+		}
+	}
+	
+}
diff --git a/level1/p06_Goldbach/main.c b/level1/p06_Goldbach/main.c
new file mode 100644
index 00000000..99f64c50
--- /dev/null
+++ b/level1/p06_Goldbach/main.c
@@ -0,0 +1,18 @@
+#include <stdio.h>
+
+int main() {
+    int Primes[25] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
+    for (int i = 2; i < 99; i += 2) {
+        for (int j = 0; j < 25; j++) {
+            if (Primes[j] >= i)break;
+            for (int k = j; k < 25; k++) {
+                if (Primes[j] + Primes[k] == i)
+                    printf("%d=%d+%d\n", i, Primes[j], Primes[k]);
+                else if (Primes[j] + Primes[k] > i) {
+                    break;
+                }
+            }
+        }
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/level1/p07_encrypt_decrypt/main.c b/level1/p07_encrypt_decrypt/main.c
new file mode 100644
index 00000000..b62c704c
--- /dev/null
+++ b/level1/p07_encrypt_decrypt/main.c
@@ -0,0 +1,20 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+/* run this program using the console pauser or add your own getch, system("pause") or input loop */
+/*reverse encrypt*/
+int main(int argc, char *argv[]) {
+	char c[1000];
+	fgets(c,(sizeof c / sizeof c[0]),stdin);
+	int d = strlen(c);
+	
+	char a[1000];
+	int j = 0;
+	for (int i=d-2;i>=0;i--)
+	{
+		a[i] = c [j];
+		j++;
+	}
+	puts(a);
+	return 0;
+}
diff --git a/level1/p08_hanoi/hanoi.c b/level1/p08_hanoi/hanoi.c
new file mode 100644
index 00000000..553c4a41
--- /dev/null
+++ b/level1/p08_hanoi/hanoi.c
@@ -0,0 +1,59 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+/* run this program using the console pauser or add your own getch, system("pause") or input loop */
+int change(n,position1,position2)
+{
+	//得到position3 
+	char position3;
+	 if(position1 == 'A')
+	 {
+	 	if(position2 == 'B')
+		 {
+		 	position3 = 'C';
+		 }
+	 	else
+		 {
+		 	position3 = 'B';
+		 }
+	 }
+	 else if(position1 == 'B')
+	 {
+	 	if(position2 == 'A')
+	 	{
+	 		position3 = 'C';
+	 	}
+	 	else
+	 	{
+	 		position3 = 'A';
+	 	}
+	 }
+	 else
+	 {
+	 	if(position2 == 'A')
+	 	{
+	 		position3 = 'B';
+	 	}
+	 	else
+	 	{
+	 		position3 = 'A';
+	 	}
+	 }
+	 
+	 if(n==1)
+	 {
+	 	printf("%c->%c\n",position1,position2);
+	 	return 0;
+	 } 
+	 
+	 change(n-1,position1,position3);
+	 change(1,position1,position2);
+	 change(n-1,position3,position2);	
+}
+int main(int argc, char *argv[]) {
+	int n;
+	printf("输入塔的层数\n");
+	scanf("%d",&n);
+	change(n,'A','B');
+	return 0;
+}
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/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;
+}
+