diff --git a/level1/p01_runningLetter/runningletter.c b/level1/p01_runningLetter/runningletter.c
new file mode 100644
index 00000000..fc3612f5
--- /dev/null
+++ b/level1/p01_runningLetter/runningletter.c
@@ -0,0 +1,27 @@
+#include<stdio.h>
+#include<windows.h>
+#include<stdlib.h>
+#define WIDE 110 
+ 
+int main(void){
+	char s[20];
+	int x=0;
+	int dir=1;
+	int i;
+	
+	scanf("%s",s);
+	while(1){
+		system("cls");
+		for(i=0;i<=x;i++){
+			printf(" ");
+		}
+		puts(s);
+		x += dir;
+		if(x == WIDE-1)
+			dir=-1;
+		else if(x==0)
+			dir=1;
+	}
+	 
+	return 0;	
+} 
diff --git a/level1/p02_isPrime/isprime.c b/level1/p02_isPrime/isprime.c
new file mode 100644
index 00000000..4ad0b278
--- /dev/null
+++ b/level1/p02_isPrime/isprime.c
@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main(void){
+	int x;
+	int i;
+	int cnt=0;
+	scanf("%d",&x);
+	if( x == 2){
+		cnt =1;
+	}
+	if(x == 1){
+		cnt =0;
+}
+	for(i=2;i<x;i++){
+		if(x%i == 0){
+			cnt=0;
+			break;
+		}else
+			cnt=1;
+	}
+	
+	if(cnt==1)
+		printf("yes\n");
+	else
+		printf("no\n");
+	return 0;
+} 
diff --git a/level1/p03_Diophantus/Diophantus.c b/level1/p03_Diophantus/Diophantus.c
new file mode 100644
index 00000000..cf36f7d9
--- /dev/null
+++ b/level1/p03_Diophantus/Diophantus.c
@@ -0,0 +1,12 @@
+#include<stdio.h>
+int main(void){
+	double x=1;
+	while(1){
+		if(x == x/6+x/12+x/7+5+x/2+4)
+			break;
+		x++;
+	}
+	
+	printf("The age of Diophantus is %f\n",x-4.0);
+	
+}
diff --git a/level1/p04_ narcissus/narcissus.c b/level1/p04_ narcissus/narcissus.c
new file mode 100644
index 00000000..2a2877ff
--- /dev/null
+++ b/level1/p04_ narcissus/narcissus.c	
@@ -0,0 +1,22 @@
+#include<stdio.h>
+#include<math.h>
+#define MAX 1000
+#define MIN 100
+#define third(c) pow(c,3) 
+int main(void){
+	int i;
+	int a,x,y,z;
+	
+	for(i=100;i<1000;i++){
+		a=i/10;
+		z=i%10;
+		y=a%10;
+		x=i/100;
+		int t=third(x)+third(y)+third(z);
+		
+		if(i == t )
+			printf("%d ",i);
+	}
+	printf("\n");
+	return 0;
+}
diff --git a/level1/p05_allPrimes/allprimes.c b/level1/p05_allPrimes/allprimes.c
new file mode 100644
index 00000000..cb7ad454
--- /dev/null
+++ b/level1/p05_allPrimes/allprimes.c
@@ -0,0 +1,38 @@
+#include<stdio.h>
+#include<time.h>
+#define MAX 1000
+
+int isprime(int a);
+
+int main(void){
+	clock_t t1,t2;
+	t1= clock();
+	int i;
+	for(i=2;i<MAX;i++){
+		if(isprime(i) )
+			printf("%d ",i);
+	}
+	printf("\n");
+	t2=clock();
+	printf("0.0%ds\n",t2-t1);
+	return 0;
+} 
+
+int isprime(int a){
+	int i;
+	int cnt=0;
+	
+	for(i=2;i<a;i++){
+		if(a%i == 0){
+			cnt=0;
+			break;
+		}
+		else
+			cnt =1;
+	}
+	if(a == 1)
+		cnt=0; 
+	if(a == 2)
+		cnt =1;
+	return cnt;
+}
diff --git a/level1/p06_Goldbach/Goldbach.c b/level1/p06_Goldbach/Goldbach.c
new file mode 100644
index 00000000..5e820f21
--- /dev/null
+++ b/level1/p06_Goldbach/Goldbach.c
@@ -0,0 +1,57 @@
+#include<stdio.h>
+#define MAX 100
+
+int isprime(int a);
+int main(void){
+	int i;
+	int x=0;
+	int a[25]={0,};
+
+	for(i=1;i<MAX;i++){
+		if(isprime(i)){
+			a[x]=i;
+			x++;
+		}
+	} 
+	
+	int j=2;
+	int m,n;
+	
+	for(j=2;j<=MAX;j+=2){
+		int cnt=0;
+		for(m=0;m<25;m++){
+			for(n=0;n<25;n++){
+				if(j == a[m]+a[n]){
+					cnt=1;
+					break;
+				}
+			}
+			if(cnt==1)
+				break;
+		}
+		if(cnt==0){
+			printf("false\n");
+			return 0;
+		}
+	}
+	printf("ture\n");
+	return 0;
+}
+
+int isprime(int a){
+	int i;
+	int cnt=0;
+	
+	for(i=2;i<a;i++){
+		if(a%i == 0){
+			cnt =0;
+			break;
+		}
+			
+		else
+			cnt =1;
+	}
+	if(a == 1 ||a == 2)
+		cnt =1;
+	return cnt;
+}
diff --git a/level1/p08_hanoi/hanoi.c b/level1/p08_hanoi/hanoi.c
new file mode 100644
index 00000000..2452b2c7
--- /dev/null
+++ b/level1/p08_hanoi/hanoi.c
@@ -0,0 +1,29 @@
+#include<stdio.h>
+
+void hanoi(int num,char start,char end,char temp);
+void put(char a,char b);
+
+int main(void){
+	int numOfdisk=0;
+	scanf("%d",&numOfdisk);
+	
+	const char s = 'A', e = 'B' ,t = 'C';
+	hanoi(numOfdisk,s,e,t);
+	
+	return 0;
+}
+
+void hanoi(int num,char start,char end,char temp){
+	if(num == 1){
+		put(start,end);
+	}
+	else{
+		hanoi(num-1,start,temp,end);
+		put(start,end);
+		hanoi(num-1,temp,end,start);
+	}
+}
+
+void put(char a,char b){
+	printf("Move %c to %c\n",a,b);
+}
diff --git a/level1/p09_maze/maze.c b/level1/p09_maze/maze.c
new file mode 100644
index 00000000..649c2dd9
--- /dev/null
+++ b/level1/p09_maze/maze.c
@@ -0,0 +1,121 @@
+#include<stdio.h>
+#include<conio.h>  //kbhit的原型 
+#include<stdlib.h>
+#define WIDE 15
+#define LEN  17
+
+struct COD{
+	int x;
+	int y;
+};
+
+char maze[WIDE][LEN]; 
+void Initmap(void);
+void BuildrBarrier(int st,int end,int row);
+void BuildlBarrier(int st,int end,int line);//辅助造墙函数 
+void PlayerMove(int twd,struct COD* now);
+int GetPlayerCommand(void);
+void Judge(struct COD* now,struct COD* New);
+
+int main(void){
+	struct COD* now;
+	struct COD loc={1,1,}; 
+	now = &loc;
+	
+	Initmap();
+	while(now->y < 16){
+		system("cls");
+		int i,j;
+		for(i=0;i<WIDE;i++){
+			for(j=0;j<LEN;j++){
+				printf("%c",maze[i][j]);
+			}
+			printf("\n");
+		}
+		PlayerMove(GetPlayerCommand(),now);
+	}
+	printf("you win!\n");
+		
+	return 0;
+} 
+
+void BuildlBarrier(int st,int end,int line){
+	int i;
+	for(i=st;i<=end;i++){
+		maze[i][line]='#';
+	}
+}
+
+void BuildrBarrier(int st,int end,int row){
+	int i;
+	for(i=st;i<=end;i++){
+		maze[row][i]='#';
+	}
+}
+
+void Initmap(void){
+	int i,j;
+	for(i=0;i<WIDE;i++){
+		maze[i][0] = '#';
+		maze[0][i] = '#';
+	}
+	for(j=0;j<LEN;j++){
+		maze[j][LEN-1]  = '#';
+		maze[WIDE-1][j] = '#';
+	}                                 //生成边界墙 
+	for(i=1;i<WIDE-1;i++){
+		for(j=1;j<LEN-1;j++){
+			maze[i][j]=' ';
+		}
+	}
+	BuildlBarrier(1,4,3);
+	BuildrBarrier(7,13,3);
+	BuildrBarrier(12,15,5);                           
+	BuildrBarrier(1,6,7);
+	BuildlBarrier(4,8,7);
+	BuildrBarrier(10,15,7);
+	BuildrBarrier(3,10,10);
+	BuildlBarrier(10,13,12);
+	BuildlBarrier(8,10,10);
+	BuildrBarrier(14,15,12);
+	maze[6][12]='#',maze[9][3]='#',maze[10][13]='#';//初始化迷宫地图 
+	maze[1][1]='o';
+	maze[13][16]=' ';
+}
+
+int GetPlayerCommand(void){
+	int c= -1;
+	char ch;
+	if(ch=getch()){
+		switch(ch){
+			case'd':case'D':c=0;break;
+			case's':case'S':c=1;break;
+			case'a':case'A':c=2;break;
+			case'w':case'W':c=3;break;
+			case 27:exit(0);
+		}
+	}
+	return c;
+}
+
+void Judge(struct COD* now,struct COD* New){
+	char temp;
+	if(maze[New->x][New->y] != '#'){
+		temp=maze[now->x][now->y];
+		maze[now->x][now->y]=maze[New->x][New->y];
+		maze[New->x][New->y]=temp;
+		*now= *New;
+	}
+}
+
+void PlayerMove(int twd,struct COD* now){
+	struct COD n =*now;
+	struct COD *New=&n;
+	switch(twd){
+		case -1: break; 
+		case  0: n.y++;Judge(now,New);break;
+		case  1: n.x++;Judge(now,New);break;
+		case  2: n.y--;Judge(now,New);break;
+		case  3: n.x--;Judge(now,New);break;
+	}
+}
diff --git a/level1/p10_pushBoxes/pushBoxes1.3.c b/level1/p10_pushBoxes/pushBoxes1.3.c
new file mode 100644
index 00000000..829b5576
--- /dev/null
+++ b/level1/p10_pushBoxes/pushBoxes1.3.c
@@ -0,0 +1,243 @@
+#include<stdio.h> 
+#include<conio.h>          //getch的原型 
+#include<stdlib.h>
+#include<windows.h>
+#define WIDE 9
+#define LEN  10
+#define ENDJUDGE(c) MAP[end[c].x][end[c].y] != 'B'  //终点判断 
+
+struct COD{                            //指明坐标的结构 
+	int x;
+	int y;
+};
+struct COD end[4];                   //终点数组记录每一关卡的终点 
+int cnt=1;                           //用于异常检测 
+
+char MAP[WIDE][LEN];
+void Initmap(void);                 //将数组全部初始化为空格 
+struct COD Initmap_1(void);
+struct COD Initmap_2(void);
+struct COD Initmap_3(void);
+void BuildrBarrier(int st,int end,int row);
+void BuildlBarrier(int st,int end,int line);//辅助造墙函数 
+void PlayerMove(int twd,struct COD* now);
+int GetPlayerCommand(void);                //读取用户命令 
+void Judge(int twd,struct COD* now,struct COD* New);//判断人的移动 
+void BJudge(struct COD* Bnow,struct COD* BNew);//判断箱子移动 
+void BoxMove(int Btwd,struct COD* Bnow);
+void Put(void);//输出二维数组的当前值 
+
+int main(void){
+	struct COD* now;                         
+	struct COD loc=Initmap_1();
+	now = &loc;
+	
+	while(ENDJUDGE(0) || ENDJUDGE(1) || ENDJUDGE(2) || ENDJUDGE(3) ){
+		Put();
+		PlayerMove(GetPlayerCommand(),now);
+	}
+	Put();
+	printf("you win!,turn to level 2！\n"); 
+	Sleep(1000);
+	
+	system("cls");
+	loc = Initmap_2();
+	now = &loc;
+	while(ENDJUDGE(0) || ENDJUDGE(1) || ENDJUDGE(2) ){
+		Put();
+		PlayerMove(GetPlayerCommand(),now);
+	}
+	Put();
+	printf("you win!,turn to level 3!\n");
+	Sleep(1000);
+	
+	system("cls");
+	loc = Initmap_3();
+	now = &loc;
+	while(ENDJUDGE(0) || ENDJUDGE(1) || ENDJUDGE(2) || ENDJUDGE(3) ){
+		Put();
+		PlayerMove(GetPlayerCommand(),now);
+	}
+	Put();
+	printf("you win!,Here is your score list");
+	
+	return 0;
+} 
+
+void Put(void){
+	system("cls");
+	int i,j;
+		for(i=0;i<WIDE;i++){
+			for(j=0;j<LEN;j++){
+				printf("%c",MAP[i][j]);
+			}
+			printf("\n");
+		}
+}
+
+void BuildlBarrier(int st,int end,int line){
+	int i;
+	for(i=st;i<=end;i++){
+		MAP[i][line]='#';
+	}
+}
+
+void BuildrBarrier(int st,int end,int row){
+	int i;
+	for(i=st;i<=end;i++){
+		MAP[row][i]='#';
+	}
+}
+
+void Initmap(void){
+	int i,j;	
+	for(i=1;i<WIDE;i++){
+		for(j=1;j<LEN;j++){
+			MAP[i][j]=' ';
+		}
+	} 
+}
+
+struct COD Initmap_1(void){                       
+	struct COD start;
+	Initmap();
+	BuildrBarrier(2,4,0);
+	BuildlBarrier(1,3,2);
+	BuildrBarrier(0,1,3);
+	BuildrBarrier(0,3,5);
+	BuildrBarrier(3,5,7);
+	BuildrBarrier(4,7,2);
+	BuildrBarrier(5,7,4);
+	BuildlBarrier(5,6,5);
+	MAP[4][4]='o';
+	MAP[4][0]='#',MAP[6][3]='#',MAP[1][4]='#',MAP[3][7]='#';
+	MAP[4][3]='B',MAP[3][3]='B',MAP[3][5]='B',MAP[5][4]='B';
+	MAP[1][3]='X',MAP[4][1]='X',MAP[3][6]='X',MAP[6][4]='X';
+	end[0]=(struct COD){1,3};
+	end[1]=(struct COD){4,1};
+	end[2]=(struct COD){3,6};
+	end[3]=(struct COD){6,4}; 
+	start =(struct COD){4,4};
+	return start;
+}
+
+struct COD Initmap_2(void){
+	end[3]=(struct COD){0,0};          //此关只有三个箱子 
+	struct COD start;              
+	Initmap();
+	BuildrBarrier(0,4,0);
+	BuildlBarrier(1,4,0);
+	BuildlBarrier(4,8,1);
+	BuildlBarrier(4,5,2);
+	BuildrBarrier(2,5,8);
+	BuildrBarrier(5,8,7);
+	BuildlBarrier(2,6,8);
+	BuildlBarrier(1,4,4);
+	BuildlBarrier(2,4,6);
+	MAP[6][5]='#',MAP[4][5]='#',MAP[2][7]='#';
+	MAP[1][1]='o';
+	MAP[2][2]='B',MAP[2][3]='B',MAP[3][2]='B';
+	MAP[3][7]='X',MAP[4][7]='X',MAP[5][7]='X';
+	end[0]=(struct COD){3,7};
+	end[1]=(struct COD){4,7};
+	end[2]=(struct COD){5,7};
+	start=(struct COD){1,1};
+	return start;
+} 
+
+struct COD Initmap_3(void){
+	struct COD start;
+	Initmap();
+	BuildrBarrier(1,7,0);
+	BuildrBarrier(0,5,2);
+	BuildlBarrier(3,5,0);
+	BuildrBarrier(1,8,6);
+	BuildlBarrier(4,5,4);
+	BuildlBarrier(4,5,8);
+	BuildlBarrier(1,4,9);
+	BuildrBarrier(7,8,1);
+	MAP[1][1]='#',MAP[5][1]='#';
+	MAP[3][2]='o';
+	MAP[2][2]='B',MAP[3][4]='B',MAP[3][7]='B',MAP[4][6]='B';
+	MAP[4][2]='X',MAP[4][3]='X',MAP[5][2]='X',MAP[5][3]='X';
+	end[0]=(struct COD){4,2};
+	end[1]=(struct COD){4,3};
+	end[2]=(struct COD){5,2};
+	end[3]=(struct COD){5,3};
+	start =(struct COD){3,2};
+	return start;
+}
+
+int GetPlayerCommand(void){
+	int c= -1;
+	char ch;
+	if(ch=getch()){
+		switch(ch){
+			case'd':case'D':c=0;break;
+			case's':case'S':c=1;break;
+			case'a':case'A':c=2;break;
+			case'w':case'W':c=3;break;
+			case 27:exit(0);
+		}
+	}
+	return c;
+}
+
+void Judge(int twd,struct COD* now,struct COD* New){                    
+	char temp;
+	if(MAP[New->x][New->y] == ' ' || MAP[New->x][New->y] == 'X' ){
+		MAP[New->x][New->y]='o';
+		MAP[now->x][now->y]=' ';
+		*now = *New;
+	}
+	if(cnt){
+		if(MAP[New->x][New->y] == 'B'){
+			struct COD *Bnow=New;
+			BoxMove(twd,Bnow);
+			PlayerMove(twd,now);
+			cnt=1;
+		}
+	}
+	for(int i=0;i<4;i++){                              //回复X的值 
+		if(MAP[end[i].x][end[i].y] == ' '){
+			MAP[end[i].x][end[i].y] = 'X';
+		}
+	}
+}
+
+void PlayerMove(int twd,struct COD* now){
+	struct COD n =*now;
+	struct COD *New=&n;
+	switch(twd){
+		case -1: break; 
+		case  0: n.y++;Judge(twd,now,New);break;
+		case  1: n.x++;Judge(twd,now,New);break;
+		case  2: n.y--;Judge(twd,now,New);break;
+		case  3: n.x--;Judge(twd,now,New);break;
+	}
+}
+
+void BJudge(struct COD* Bnow,struct COD* BNew){
+	char temp;
+	if(MAP[BNew->x][BNew->y] == 'X' || MAP[BNew->x][BNew->y] == ' '){                              
+		MAP[BNew->x][BNew->y] = 'B';
+		MAP[Bnow->x][Bnow->y] = ' ';
+		*Bnow = *BNew;
+	}
+	if(MAP[BNew->x][BNew->y] == '#' || MAP[BNew->x][BNew->y] == 'B'){
+		cnt = 0;
+	}
+}
+
+void BoxMove(int Btwd,struct COD* Bnow){                        
+	struct COD m =*Bnow;
+	struct COD *BNew=&m;
+	switch(Btwd){
+		case -1: break; 
+		case  0: m.y++;BJudge(Bnow,BNew);break;
+		case  1: m.x++;BJudge(Bnow,BNew);break;
+		case  2: m.y--;BJudge(Bnow,BNew);break;
+		case  3: m.x--;BJudge(Bnow,BNew);break;
+	}
+}
+
diff --git a/level1/p10_pushBoxes/pushboxes.c b/level1/p10_pushBoxes/pushboxes.c
new file mode 100644
index 00000000..a433f4b0
--- /dev/null
+++ b/level1/p10_pushBoxes/pushboxes.c
@@ -0,0 +1,209 @@
+#include<stdio.h>
+#include<conio.h>  
+#include<stdlib.h>
+#include<windows.h>
+#define WIDE 9
+#define LEN  10
+#define Boxpush MAP
+#define ENDJUDGE(c) MAP[end[c].x][end[c].y] != 'B'  //终点判断 
+
+struct COD{
+	int x;
+	int y;
+};
+struct COD end[4];                   //终点数组 
+
+char MAP[WIDE][LEN]; 
+struct COD Initmap_1(void);
+struct COD Initmap_2(void);
+void BuildrBarrier(int st,int end,int row);
+void BuildlBarrier(int st,int end,int line);//辅助造墙函数 
+void PlayerMove(int twd,struct COD* now);
+int GetPlayerCommand(void);
+void Judge(int twd,struct COD* now,struct COD* New);
+void BJudge(struct COD* now,struct COD* New);
+void BoxMove(int Btwd,struct COD* Bnow);
+void Put(void);
+
+int main(void){
+	struct COD* now;
+	struct COD loc=Initmap_1();
+	now = &loc;
+	
+	while(ENDJUDGE(0) || ENDJUDGE(1) || ENDJUDGE(2) || ENDJUDGE(3) ){
+		Put();
+		PlayerMove(GetPlayerCommand(),now);
+	}
+	Put();
+	printf("you win!,turn to level 2\n");
+	Sleep(1000);
+	
+	system("cls");
+	loc=Initmap_2();
+	now = &loc;
+	Put(); 
+	
+	while(ENDJUDGE(0) || ENDJUDGE(1) || ENDJUDGE(2) ){
+		Put();
+		PlayerMove(GetPlayerCommand(),now);
+	}
+	Put();
+	printf("you win!,turn to level 3\n");
+	Sleep(1000);
+	
+		
+	return 0;
+} 
+
+void Put(void){
+	system("cls");
+	int i,j;
+		for(i=0;i<WIDE;i++){
+			for(j=0;j<LEN;j++){
+				printf("%c",MAP[i][j]);
+			}
+			printf("\n");
+		}
+}
+
+void BuildlBarrier(int st,int end,int line){
+	int i;
+	for(i=st;i<=end;i++){
+		MAP[i][line]='#';
+	}
+}
+
+void BuildrBarrier(int st,int end,int row){
+	int i;
+	for(i=st;i<=end;i++){
+		MAP[row][i]='#';
+	}
+}
+
+struct COD Initmap_1(void){                       //初始化第一关地图 
+	int i,j;
+	struct COD start1;
+	for(i=1;i<WIDE;i++){
+		for(j=1;j<LEN;j++){
+			MAP[i][j]=' ';
+		}
+	} 
+	BuildrBarrier(2,4,0);
+	BuildlBarrier(1,3,2);
+	BuildrBarrier(0,1,3);
+	BuildrBarrier(0,3,5);
+	BuildrBarrier(3,5,7);
+	BuildrBarrier(4,7,2);
+	BuildrBarrier(5,7,4);
+	BuildlBarrier(5,6,5);
+	MAP[4][4]='o';
+	MAP[4][0]='#',MAP[6][3]='#',MAP[1][4]='#',MAP[3][7]='#';
+	MAP[4][3]='B',MAP[3][3]='B',MAP[3][5]='B',MAP[5][4]='B';
+	MAP[1][3]='X',MAP[4][1]='X',MAP[3][6]='X',MAP[6][4]='X';
+	end[0]=(struct COD){1,3};
+	end[1]=(struct COD){4,1};
+	end[2]=(struct COD){3,6};
+	end[3]=(struct COD){6,4}; 
+	start1 =(struct COD){4,4};
+	
+	return start1;
+}
+
+struct COD Initmap_2(void){
+	int i,j;
+	struct COD start2;
+	for(i=1;i<WIDE;i++){
+		for(j=1;j<LEN;j++){
+			MAP[i][j]=' ';
+		}
+	} 
+	BuildrBarrier(0,4,0);
+	BuildlBarrier(1,4,0);
+	BuildlBarrier(4,8,1);
+	BuildlBarrier(4,5,2);
+	BuildrBarrier(2,5,8);
+	BuildrBarrier(5,8,7);
+	BuildlBarrier(2,6,8);
+	BuildlBarrier(1,4,4);
+	BuildlBarrier(2,4,6);
+	MAP[6][5]='#',MAP[4][5]='#',MAP[2][7]='#';
+	MAP[1][1]='o';
+	MAP[2][2]='B',MAP[2][3]='B',MAP[3][2]='B';
+	MAP[3][7]='X',MAP[4][7]='X',MAP[5][7]='X';
+	end[0]=(struct COD){3,7};
+	end[1]=(struct COD){4,7};
+	end[2]=(struct COD){5,7};
+	start2=(struct COD){1,1};
+	
+	return start2;
+} 
+
+int GetPlayerCommand(void){
+	int c= -1;
+	char ch;
+	if(ch=getch()){
+		switch(ch){
+			case'd':case'D':c=0;break;
+			case's':case'S':c=1;break;
+			case'a':case'A':c=2;break;
+			case'w':case'W':c=3;break;
+			case 27:exit(0);
+		}
+	}
+	return c;
+}
+
+void Judge(int twd,struct COD* now,struct COD* New){                      //判断人的移动 
+	char temp;
+	if(MAP[New->x][New->y] == ' ' || MAP[New->x][New->y] == 'X' ){
+		temp=MAP[now->x][now->y];
+		MAP[now->x][now->y]=MAP[New->x][New->y];
+		MAP[New->x][New->y]=temp;
+		*now = *New;
+	}
+	if(MAP[New->x][New->y] == 'B'){
+		struct COD *Bnow=New;
+		BoxMove(twd,Bnow);
+		PlayerMove(twd,now);
+	}
+}
+
+void PlayerMove(int twd,struct COD* now){
+	struct COD n =*now;
+	struct COD *New=&n;
+	switch(twd){
+		case -1: break; 
+		case  0: n.y++;Judge(twd,now,New);break;
+		case  1: n.x++;Judge(twd,now,New);break;
+		case  2: n.y--;Judge(twd,now,New);break;
+		case  3: n.x--;Judge(twd,now,New);break;
+	}
+}
+
+void BJudge(struct COD* now,struct COD* New){
+	char temp;
+	if(MAP[New->x][New->y] == ' '){
+		temp=MAP[now->x][now->y];
+		MAP[now->x][now->y]=MAP[New->x][New->y];
+		MAP[New->x][New->y]=temp;
+		*now = *New;
+	}
+	if(MAP[New->x][New->y] == 'X'){                              
+		MAP[New->x][New->y] = 'B';
+		MAP[now->x][now->y] = ' ';
+		*now = *New;
+	}
+}
+
+void BoxMove(int Btwd,struct COD* Bnow){                        //箱子移动 
+	struct COD m =*Bnow;
+	struct COD *BNew=&m;
+	switch(Btwd){
+		case -1: break; 
+		case  0: m.y++;BJudge(Bnow,BNew);break;
+		case  1: m.x++;BJudge(Bnow,BNew);break;
+		case  2: m.y--;BJudge(Bnow,BNew);break;
+		case  3: m.x--;BJudge(Bnow,BNew);break;
+	}
+}
+
diff --git a/level1/p11_linkedList/linkedList.c b/level1/p11_linkedList/linkedList.c
new file mode 100644
index 00000000..c46031c5
--- /dev/null
+++ b/level1/p11_linkedList/linkedList.c
@@ -0,0 +1,83 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+struct numlist{
+	int value;                     
+	struct numlist* next;
+};
+
+struct numlist *relist(struct numlist *head);
+void cleanup(struct numlist *head);
+
+int main(void){
+	struct numlist* head=NULL;
+	struct numlist* prev,*now;
+	int cnt;                                   //暂存value的值 
+	while(1){
+		char c;
+		if ((c=getchar())=='\n'){
+			break;
+		} 
+		cnt=c-'0';
+		while ((c=getchar())!='\n'){
+			cnt=cnt*10+c-'0';
+		} 
+		now=(struct numlist* )malloc(sizeof(struct numlist));
+		if( head == NULL){
+			head = now;
+		}else{
+			prev->next = now;
+		}
+		now->next = NULL;
+		now->value = cnt;
+		prev=now;
+	}
+	
+	struct numlist *temp=relist(head);                 //逆序链表 
+	int num=1;
+	int status=0;
+	now=temp;
+	while(now){
+	if(now->value == 5){
+		status=1;
+		printf("%d ",num);
+	}
+	now=now->next;
+	num++;                                            //计数 
+	}
+	printf("\n");
+	
+	if(status == 1){
+		printf("Above is the order of list which's value equals 5!\n");
+	}else{
+		printf("-1 \n");
+	}
+	cleanup(head);	                                  //清理malloc的内存 
+	return 0;
+}
+
+struct numlist* relist(struct numlist *head){
+	struct numlist *Prev,*Now,*Next;
+	struct numlist *rhead;
+	Prev=NULL;
+	Now=head;
+	Next=head->next;
+	while(Next){
+		Now->next=Prev;
+		Prev=Now;
+		Now=Next;
+		Next=Next->next;
+	}
+	Now->next=Prev;
+	rhead=Now;
+	
+	return rhead;
+}
+
+void cleanup(struct numlist *head){
+	struct numlist *now=head;
+	while(now){
+		free(now);
+		head=now->next;
+	}
+}
diff --git a/level2/GA/GA.c b/level2/GA/GA.c
new file mode 100644
index 00000000..55647734
--- /dev/null
+++ b/level2/GA/GA.c
@@ -0,0 +1,198 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<math.h>
+#include<time.h>
+#define CROSSOVER_RATE 0.7               //交叉概率 
+#define MUTATE_RATE 0.001                //突变概率 
+#define POP_SIZE 120                     //种群大小 
+#define CHROMO_SIZE 60                   //染色体最大长度 
+#define MAXGENERATION 1000               //最大繁衍代数 
+#define MAP_LEN  21
+#define MAP_WIDE 12
+
+struct path{
+	int chromo[CHROMO_SIZE];
+	double fiteness;
+};	 
+struct COD{                    //坐标结构 
+	int x;
+	int y;
+}; 
+char map[MAP_WIDE][MAP_LEN];
+struct path baby[POP_SIZE+1];
+struct path baby1,baby2;
+
+void Initmap(void);
+void coding(int *code); 
+double FitenessJudge(int* chromo);
+void JudgeWall(struct COD* now,struct COD* New);
+int SelectionParents(struct path*);
+void Crossover(struct path,struct path);
+void Mutate(int *code);
+int choosebest(const struct path* pop);
+
+int main(void){
+	Initmap();
+	struct path pop[POP_SIZE];
+	srand((unsigned int) (time(NULL)));
+	int i,j,k;
+	for(i=0;i<POP_SIZE;i++){
+		coding(pop[i].chromo);                       //初代编码 
+	}
+	int generations=1;
+	while(generations<=MAXGENERATION){ 
+		for(j=0;j<POP_SIZE;j++){
+			pop[j].fiteness=FitenessJudge(pop[j].chromo);//得出适应性分数 
+		}
+		int newbabies=0;
+		while(newbabies<POP_SIZE){
+			struct path mum=pop[SelectionParents(pop)]; //选择亲代 
+			struct path dad=pop[SelectionParents(pop)];
+			Crossover(mum,dad);                        //交叉 
+			Mutate(baby1.chromo);                      //突变 
+			Mutate(baby2.chromo);
+			baby[newbabies]  =baby1;
+			baby[newbabies+1]=baby2;
+			newbabies+=2;
+		}
+		generations++;
+		int best=choosebest(pop);
+		pop[0]=pop[best];
+		for(k=1;k<POP_SIZE;k++){
+		pop[k]=baby[k];
+		}
+	}	
+		printf("Lose!\n");
+		for(i=0;i<POP_SIZE;i++){
+			for(j=0;j<CHROMO_SIZE;j++){
+				printf("%d",pop[i].chromo[j]);
+			}
+			printf("\n");
+		} 
+	return 0;
+}
+
+void Initmap(void){
+	int i,j;
+	for(i=1;i<MAP_WIDE;i++){
+		for(j=1;j<MAP_LEN;j++){
+			map[i][j]=' ';
+		}
+	}
+	for(i=0;i<MAP_WIDE;i++){
+		map[i][0]='#';
+		map[i][MAP_LEN-1]='#';
+	}
+	for(i=0;i<MAP_LEN;i++){
+		map[0][i]='#';
+		map[MAP_WIDE-1][i]='#';
+	}                                                  //生成边界墙 
+	for(i=1;i<5;i++){
+		map[i][3]='#';
+	}
+	map[5][7]='#',map[5][8]='#',map[6][12]='#',map[6][13]='#';
+	map[6][7]='#',map[4][8]='#',map[5][12]='#',map[5][13]='#',map[8][17]='#';
+	map[8][20]=' ';
+}
+
+void coding(int *code){
+	int i;
+	for(i=0;i<CHROMO_SIZE;i++){
+		code[i]=rand()%2;
+	}
+}
+
+double FitenessJudge(int* chromo){
+	int twd,i;                 
+	struct COD start={1,1};
+	struct COD end  ={8,20};
+	struct COD *now=&start;
+	struct COD n =*now;
+	struct COD *New=&n;
+	for(i=0;i<CHROMO_SIZE;i+=2){
+		twd=chromo[i]*2+chromo[i+1];         //规划方向 0-east,1-south,2-west,3-north 
+		switch(twd){
+			case  0: n.y++;JudgeWall(now,New);break;
+			case  1: n.x++;JudgeWall(now,New);break;
+			case  2: n.y--;JudgeWall(now,New);break;
+			case  3: n.x--;JudgeWall(now,New);break;
+		}
+	}
+	int diff_x,diff_y,a,b;
+	a=end.x-n.x,b=end.y-n.y;
+	diff_x=abs(a),diff_y=abs(b);
+	if( (diff_x+diff_y) == 0){
+		for(i=0;i<CHROMO_SIZE;i++){
+			printf("%d",chromo[i]);
+		}
+		exit(0);
+	}
+	double score=1/(double)(diff_x+diff_y+1);
+	
+	return score;
+}
+
+void JudgeWall(struct COD* now,struct COD* New){
+	if(map[New->x][New->y] == ' ' ){
+		*now = *New;
+	}
+}
+
+int SelectionParents(struct path *pop){                       //轮盘赌选法
+	int parent=0;
+	int i,j;
+	double total,ctotal=0;
+	for(i=0;i<POP_SIZE;i++){
+		total+=pop[i].fiteness;
+	}
+	double a=rand()/(double)(RAND_MAX/(int)total);
+	for(j=0;j<POP_SIZE;j++){
+		ctotal+=pop[j].fiteness;
+		if(ctotal>a){
+			parent=j;
+			break;
+		}
+	}
+	return parent;
+}
+
+void Crossover(struct path dad,struct path mum){
+	double pro1=rand()/(double)(RAND_MAX);
+	int i,j;
+	if(pro1>CROSSOVER_RATE){
+		baby1=dad;
+		baby2=mum;
+		return ;
+	} 
+	int breakpoint=rand()%(CHROMO_SIZE-1);
+	int temp[CHROMO_SIZE];
+	for(i=0;i<CHROMO_SIZE;i++){
+		baby1.chromo[i]=dad.chromo[i];
+		baby2.chromo[i]=mum.chromo[i];
+	}
+	for(j=breakpoint;j<CHROMO_SIZE;j++){
+		baby1.chromo[j]=mum.chromo[j];
+		baby2.chromo[j]=dad.chromo[j];
+	}
+}
+
+void Mutate(int *code){
+	int i;
+	double pro2=rand()/(double)(RAND_MAX);
+	for(i=0;i<CHROMO_SIZE;i++){
+		if(pro2>MUTATE_RATE){
+			code[i]=!code[i];
+		}
+	}
+}
+
+int choosebest(const struct path* pop){
+	int i;
+	int best=0;
+	for(i=1;i<POP_SIZE;i++){
+		if(pop[best].fiteness<pop[i].fiteness){
+			best=i;
+		}
+	}
+	return best;
+}