diff --git a/0.txt b/0.txt
new file mode 100644
index 00000000..baec051b
--- /dev/null
+++ b/0.txt
@@ -0,0 +1,11 @@
+9 9
+0 0 0 0 0 0 0 0 0
+3 1 1 1 1 1 1 1 0
+0 1 1 1 1 1 1 1 0
+0 1 1 1 2 1 1 1 0
+0 1 1 1 1 1 1 1 0
+0 1 1 1 1 1 1 1 0
+0 1 1 1 1 1 1 1 0
+0 1 1 1 1 1 1 1 1
+0 0 0 0 0 0 0 0 0
+
diff --git a/List.txt b/List.txt
new file mode 100644
index 00000000..947c19da
--- /dev/null
+++ b/List.txt
@@ -0,0 +1,4 @@
+3
+a 1444
+b 600
+c 99
diff --git a/p01_runningLetter.cpp b/p01_runningLetter.cpp
new file mode 100644
index 00000000..fa26bb92
--- /dev/null
+++ b/p01_runningLetter.cpp
@@ -0,0 +1,17 @@
+#include<bits/stdc++.h>
+using namespace std;
+int cnt;
+bool flag;
+int main()
+{
+	while(1)
+	{
+		if(cnt==120) flag=1;
+		if(cnt==0) flag=0;
+		cout<<setw(cnt)<<'A';
+		system("cls");
+		if(!flag) cnt++;
+		else cnt--;
+	}
+	return 0;
+}
diff --git a/p02_isPrime.cpp b/p02_isPrime.cpp
new file mode 100644
index 00000000..116b1eea
--- /dev/null
+++ b/p02_isPrime.cpp
@@ -0,0 +1,18 @@
+#include<bits/stdc++.h>
+using namespace std;
+int n;
+int main()
+{
+	cin>>n;
+	int m=(int)sqrt(n)+1;
+	for(int i=2;i<m;i++)
+	{
+		if(n%i==0)
+		{
+			cout<<"NO"<<endl;
+			return 0;
+		}
+	}
+	cout<<"YES"<<endl; 
+	return 0;
+} 
diff --git a/p03_Diophantus.cpp b/p03_Diophantus.cpp
new file mode 100644
index 00000000..212d1754
--- /dev/null
+++ b/p03_Diophantus.cpp
@@ -0,0 +1,14 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	for(float i=1;;i++)
+	{
+		if(i/6+i/12+i/7+5+4==i/2)
+		{
+			cout<<i<<endl;
+			return 0;
+		}
+	}
+	return 0;
+} 
diff --git a/p04_narcissus.cpp b/p04_narcissus.cpp
new file mode 100644
index 00000000..70d914fe
--- /dev/null
+++ b/p04_narcissus.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+int cub(int x)
+{
+	return x*x*x;
+}
+bool nar(int x)
+{
+	int sum=0;
+	int sum0=x;
+	while(x>0)
+	{
+		sum+=cub(x%10);
+		x/=10;
+	}
+	return sum==sum0;
+}
+int main()
+{
+	for(int i=100;i<=999;i++)
+	{
+		if(nar(i)) cout<<i<<" ";
+	}
+	cout<<endl;
+	return 0;
+}
diff --git a/p05_allPrimes.cpp b/p05_allPrimes.cpp
new file mode 100644
index 00000000..a7aecfd5
--- /dev/null
+++ b/p05_allPrimes.cpp
@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+#include<time.h>
+using namespace std;
+int main()
+{
+	int isprime[1000];
+	for(int i=0;i<=1000;i++)
+	{
+		isprime[i]=1;
+	}
+	for(int i=2;i<=1000;i++)
+	{
+		if(isprime[i]==1)
+		{
+			cout<<i<<" ";
+			for(int j=2;i*j<=1000;j++)
+			{
+				isprime[i*j]=0;
+			}
+		}
+	}
+	cout<<endl;
+	printf("Time used = %.4fs\n", (double)clock() / CLOCKS_PER_SEC);//单位秒
+	return 0;
+}
diff --git a/p06_Goldbach.cpp b/p06_Goldbach.cpp
new file mode 100644
index 00000000..586a8fcc
--- /dev/null
+++ b/p06_Goldbach.cpp
@@ -0,0 +1,29 @@
+#include<bits/stdc++.h>
+using namespace std;
+int n,p[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},r[3];
+void dfs(int x,int s)
+{
+	if(s>3) return;
+	else if(x==n && s==3 && r[0]<=r[1] && r[1]<=r[2])
+	{
+		cout<<r[0]<<"+"<<r[1]<<"+"<<r[2]<<"="<<n<<endl;
+	}
+	else
+	{
+		for(int i=0;i<25;i++)
+		{
+			if((x+p[i])<=n)
+			{
+				r[s]=p[i];
+				dfs(x+p[i],s+1);
+			} 
+		}
+	}
+}
+int main()
+{
+	cin>>n;
+	if(n<=5 || n>100) cout<<"error"<<endl;
+	else dfs(0,0);
+	return 0;
+}
diff --git a/p07_encrypt_decrypt.cpp b/p07_encrypt_decrypt.cpp
new file mode 100644
index 00000000..bab7aa9b
--- /dev/null
+++ b/p07_encrypt_decrypt.cpp
@@ -0,0 +1,69 @@
+//本加密器目前仅支持对26个小写英文字母加密 
+#include<bits/stdc++.h>
+#include<windows.h>
+#include<conio.h>
+using namespace std;
+string w,mp="qazxswedcvfrtgbnhyujmkiolp";
+void enc(void)
+{
+	for(int i=0;i<w.length();i++)
+	{
+		w[i]=mp[w[i]-'a'];
+	}
+}
+void dec(void)
+{
+	for(int i=0;i<w.length();i++)
+	{
+		w[i]=mp.find(w[i])+'a';
+	}
+}
+int main()
+{
+	while(1)
+	{
+		int flag=0;
+		cout<<"请输入密文：";
+		cin>>w;
+		for(int i=0;i<w.length();i++)
+		{
+			if(w[i]<97 || w[i]>122)
+			{
+				cout<<endl<<"error";
+				Sleep(100);
+				system("cls");
+				flag=1;
+				break;
+			}
+		} 
+		if(!flag)
+		{
+			system("cls");
+			break;
+		}
+	}
+	while(1)
+	{
+		cout<<"选择加密请按1，选择解密请按2。"<<endl;
+		char t=_getch();
+		if(t=='1')
+		{
+			enc();
+			break;
+		}
+		else if(t=='2')
+		{
+			dec();
+			break;
+		}
+		else
+		{
+			cout<<endl<<"error";
+			Sleep(100);
+			system("cls");
+		}
+	}
+	system("cls");
+	cout<<"结果为："<<w<<endl; 
+	return 0;
+}
diff --git a/p08_hanoi.cpp b/p08_hanoi.cpp
new file mode 100644
index 00000000..52ede50c
--- /dev/null
+++ b/p08_hanoi.cpp
@@ -0,0 +1,17 @@
+#include<bits/stdc++.h>
+using namespace std;
+void hano(int n,char a,char b,char c)//n是准备移动的块数，a是起始柱，b是中间柱，c是目标柱； 
+{
+	if(n==0) return;
+	hano(n-1,a,c,b);//先将第n个盘子上的n-1个盘子从a移到b；
+	printf("将第%d号盘子从%c柱移动到%c柱\n",n,a,c);
+	hano(n-1,b,c,a);//再将n-1个盘子从b移到c，完成任务； 
+}
+int main()
+{
+	cout<<"请输入盘子总数：";
+	int n;
+	cin>>n;
+	hano(n,'A','B','C');
+	return 0;
+} 
diff --git a/p09_maze.cpp b/p09_maze.cpp
new file mode 100644
index 00000000..4888baaa
--- /dev/null
+++ b/p09_maze.cpp
@@ -0,0 +1,110 @@
+//此程序的地图是用深度优先搜素算法（dfs）随机生成的！
+#include<bits/stdc++.h>
+#include <conio.h>
+using namespace std;
+int xx[]={1,-1,0,0},yy[]={0,0,1,-1},v[44][44],mp[44][44];
+struct Node
+{
+	int nx,ny;
+}nod;
+void dfs(int x,int y)
+{
+	mp[x][y]=1;
+	if(x==1 && y==1) return;
+	int s=rand()%4;
+	for(int i=s;i<s+4;i++)
+	{
+		int dx=x+xx[i%4];
+		int dy=y+yy[i%4];
+		if(mp[dx][dy]==0 && dx>0 && dy>0 && dx<43 && dy<43 && v[dx][dy]==0)
+		{
+			int flag=0;
+			for(int k=0;k<4;k++)
+			{
+				int ddx=dx+xx[k];
+				int ddy=dy+yy[k];
+				if(mp[ddx][ddy]==1) flag++;
+			}
+			if(flag==1)//保证不和别的路挖穿，增加迷宫难度； 
+			{
+				v[dx][dy]=1;
+				dfs(dx,dy);
+			}
+		}
+		else v[dx][dy]=1;
+	}
+}
+int main()
+{
+	for(int i=0;i<44;i++)
+	{
+		for(int j=0;j<44;j++) mp[i][j]=0;
+	}
+	dfs(42,42);
+	mp[1][0]=2;
+	mp[42][43]=1; 
+	for(int i=0;i<44;i++)
+	{
+		for(int j=0;j<44;j++) 
+		{
+			if(mp[i][j]==1) cout<<"  ";
+			else if(mp[i][j]==0) cout<<"口";
+			else if(mp[i][j]==2) cout<<"人"; 
+		}
+		cout<<endl; 
+	}
+	nod.nx=1;
+	nod.ny=0;
+	while(1)
+	{
+		int x0=nod.nx;
+		int y0=nod.ny;
+		if(x0==42 && y0==43)
+		{
+			cout<<"恭喜你，通关了！"<<endl;
+			system("pause"); 
+			break;
+		}
+		int x1,y1;
+		char t=_getch();
+		if(t=='w')
+		{
+			x1=x0-1;
+			y1=y0;
+		}
+		else if(t=='s')
+		{
+			x1=x0+1;
+			y1=y0;
+		}
+		else if(t=='a')
+		{
+			x1=x0;
+			y1=y0-1;
+		}
+		else if(t=='d')
+		{
+			x1=x0;
+			y1=y0+1;
+		}
+		if(mp[x1][y1]==1)
+		{
+			nod.nx=x1;
+			nod.ny=y1;
+			mp[x0][y0]=1;
+			mp[x1][y1]=2;
+			system("cls");
+			for(int i=0;i<44;i++)
+			{
+				for(int j=0;j<44;j++) 
+				{
+					if(mp[i][j]==1) cout<<"  ";
+					else if(mp[i][j]==0) cout<<"口";
+					else if(mp[i][j]==2) cout<<"人"; 
+				}
+				cout<<endl; 
+			}
+		}
+	}
+	return 0;
+} 
diff --git a/p10_pushboxs.cpp b/p10_pushboxs.cpp
new file mode 100644
index 00000000..49d6540f
--- /dev/null
+++ b/p10_pushboxs.cpp
@@ -0,0 +1,142 @@
+#include<bits/stdc++.h>
+#include<conio.h>
+#include<windows.h>
+using namespace std;
+char c; 
+int n,m,mp[50][50],cnt,xx[]={1,-1,0,0},yy[]={0,0,1,-1};
+struct Node
+{
+	int nx,ny;
+}nod;
+int main()
+{
+	while(1)
+	{
+		cout<<"欢迎来到推箱子小游戏"<<endl<<"请选择游戏难度等级（0-9）"<<endl;
+		c=_getch();//_getch()函数用法比较奇特，需特殊记忆一下； 
+		if(c>='0' && c<='9')
+		{
+			system("cls");
+			break;
+		}
+		else cout<<"error"<<endl;
+		Sleep(100);
+		system("cls");
+	}
+	FILE*fp;
+	char s[6]="x.txt";
+	s[0]=c;
+	fp=fopen(s,"r");
+	if(fp==NULL)
+	{
+		cout<<"地图读取失败！"<<endl;
+		return 0; 
+	}
+	else
+	{
+		fscanf(fp,"%d%d",&n,&m);
+		for(int i=0;i<n;i++)
+		{
+			for(int j=0;j<m;j++) fscanf(fp,"%d",&mp[i][j]);//fscanf函数是以空格或回车为结束标志的，所以在绘制地图的时候要记得加空格！
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<m;j++) 
+		{
+			if(mp[i][j]==1) cout<<" ";
+			else if(mp[i][j]==0) cout<<"#";
+			else if(mp[i][j]==2) cout<<"@";
+			else if(mp[i][j]==3) cout<<"^";
+		} 
+		cout<<endl;
+	}
+	cout<<"当前移动步数为："<<cnt<<endl;
+	nod.nx=1;
+	nod.ny=0;
+	while(1)
+	{
+		int x0=nod.nx;
+		int y0=nod.ny;
+		if(mp[n-2][m-1]==2)
+		{
+			cout<<"恭喜你，通关了！"<<endl<<"最终使用步数："<<cnt<<endl; 
+			system("pause"); 
+			break;
+		}
+		int x1,y1;
+		char t=_getch();
+		if(t=='w')
+		{
+			x1=x0-1;
+			y1=y0;
+		}
+		else if(t=='s')
+		{
+			x1=x0+1;
+			y1=y0;
+		}
+		else if(t=='a')
+		{
+			x1=x0;
+			y1=y0-1;
+		}
+		else if(t=='d')
+		{
+			x1=x0;
+			y1=y0+1;
+		}
+		if(mp[x1][y1]==1)
+		{
+			nod.nx=x1;
+			nod.ny=y1;
+			mp[x0][y0]=1;
+			mp[x1][y1]=3;
+			system("cls");
+			for(int i=0;i<n;i++)
+			{
+				for(int j=0;j<m;j++) 
+				{
+					if(mp[i][j]==1) cout<<" ";
+					else if(mp[i][j]==0) cout<<"#";
+					else if(mp[i][j]==2) cout<<"@";
+					else if(mp[i][j]==3) cout<<"^";
+				}
+				cout<<endl;
+			}
+			cout<<"当前移动步数为:"<< ++cnt <<endl; 
+		}
+		if(mp[x1][y1]==2 && mp[2*x1-x0][2*y1-y0]==1)
+		{
+			int con=0;
+			for(int i=0;i<4;i++)
+			{
+				int dx=2*x1-x0+xx[i];
+				int dy=2*y1-y0+yy[i];
+				if(dx>=0 && dy>=0 && dx<n && dy<m && mp[dx][dy]==0) con++; 
+			}
+			if(con<=1 || nod.nx==n-2)
+			{
+				nod.nx=x1;
+				nod.ny=y1;
+				mp[x0][y0]=1;
+				mp[x1][y1]=3;
+				mp[2*x1-x0][2*y1-y0]=2;
+				system("cls");
+				for(int i=0;i<n;i++)
+				{
+					for(int j=0;j<m;j++) 
+					{
+						if(mp[i][j]==1) cout<<" ";
+						else if(mp[i][j]==0) cout<<"#";
+						else if(mp[i][j]==2) cout<<"@";
+						else if(mp[i][j]==3) cout<<"^";
+					}
+					cout<<endl;
+				}
+				cout<<"当前移动步数为:"<< ++cnt <<endl; 
+			}
+		}
+	}
+	return 0;
+} 
diff --git a/p11_linkedList.cpp b/p11_linkedList.cpp
new file mode 100644
index 00000000..08525df2
--- /dev/null
+++ b/p11_linkedList.cpp
@@ -0,0 +1,156 @@
+#include<bits/stdc++.h>
+using namespace std;
+struct Node
+{
+	int key;
+	Node*next;
+};
+void append(Node*head,Node*newnode)
+{
+	Node*p;
+	p=head;
+	while(1)
+	{
+		if(p->next==NULL)
+		{
+			p->next=newnode;
+			break;
+		}
+		p=p->next;
+	}
+}
+void _delete(int n,Node*head)
+{
+	Node*p,*q;
+	p=q=head;//不要忘记初始化； 
+	for(int i=1;i<n;i++)
+	{
+		if(p==NULL)
+		{
+			cout<<"error"<<endl;
+			return;
+		}
+		p=p->next;
+		if(i<n-1) q=q->next;
+	}
+	q->next=p->next;
+	free(p);
+}
+void insert(int n,Node*head,Node*newone)//指插入在第n位的后面 ;
+{
+	Node*p=head;
+	for(int i=1;i<n;i++)
+	{
+		p=p->next;
+	}
+	newone->next=p->next;
+	p->next=newone;
+}
+Node*reverse(Node*head)
+{
+	Node*n,*p,*q;
+	n=head;
+	p=head->next;
+	if(p==NULL) return head;
+	q=p->next;
+	while(p!=NULL)
+	{
+		p->next=n;
+		n=p;
+		p=q;
+		if(q!=NULL) q=q->next; //不能让q“越界”； 
+	}
+	head->next=NULL;
+	return n;
+} 
+int main()
+{
+	Node*head;
+	head=(Node*)malloc(sizeof(Node));
+	if(head==NULL)
+	{
+		cout<<"error"<<endl;
+		return 0;
+	}
+	
+	int v;
+	cin>>v;
+	*head=(Node){v,NULL};
+	while(1)
+	{
+		cin>>v;
+		if(v==-1) break;
+		Node*p;
+		p=(Node*)malloc(sizeof(Node));
+		if(p==NULL)
+		{
+			cout<<"error"<<endl;
+			return 0;
+		}
+		*p=(Node){v,NULL};
+		append(head,p);
+	}
+	
+	Node*p=head;
+    while(p!=NULL)
+	{
+		cout<<p->key<<" ";
+		p=p->next;
+	}
+	cout<<endl;
+	
+	head=reverse(head);
+	p=head;
+	while(p!=NULL)
+	{
+		cout<<p->key<<" ";
+		p=p->next;
+	}
+	cout<<endl;
+	
+	p=head;
+	int flag=0;
+	for(int i=1;p!=NULL;i++)
+	{
+		if(p->key==5)
+		{
+			cout<<i<<endl;
+			flag=1;
+		}
+		p=p->next;
+	}
+	if(flag==0) cout<<-1<<endl;
+	
+/*用于测试_delete函数	
+	_delete(2,head);
+	p=head;
+	while(p!=NULL)
+	{
+		cout<<p->key<<endl;
+		p=p->next;
+	} */
+	
+/*用于测试insert函数 
+	Node*t;
+	int m;
+	t=(Node*)malloc(sizeof(Node));//不要忘了用malloc给t分配内存！ 
+	cin>>m>>v;
+	*t=(Node){v,NULL};
+	insert(m,head,t);
+	p=head;
+	while(p!=NULL)
+	{
+		cout<<p->key<<endl;
+		p=p->next;
+	} */
+	
+//接下来是释放所有用malloc请求的内存 
+	p=head;
+	while(p!=NULL)
+	{
+		Node*q=p->next;
+		free(p);
+		p=q;
+	}
+	return 0;
+}
diff --git a/p12_warehouse.cpp b/p12_warehouse.cpp
new file mode 100644
index 00000000..75a10b8b
--- /dev/null
+++ b/p12_warehouse.cpp
@@ -0,0 +1,135 @@
+#include<bits/stdc++.h>
+#include<conio.h>
+#include<windows.h>
+using namespace std;
+int n;
+struct stuff
+{
+	char name[21];
+	int num;
+}a[10001];
+void dispaly()
+{
+	printf("���ڿⷿ�ڹ���%d�ֻ���\n",n);
+	for(int i=0;i<n;i++) cout<<a[i].name<<" "<<a[i].num<<endl;
+	cout<<endl;
+	system("pause");
+	system("cls");
+}
+void _in()
+{
+	cout<<"���������������Ϣ��"<<endl;
+	stuff newone;
+	int flag=0;
+	scanf("%s %d",&newone.name,&newone.num);
+	for(int i=0;i<n;i++)
+	{
+		if(strcmp(newone.name,a[i].name)==0)//���ﲻ��ֱ����==�ж������ַ����Ƿ���ȣ���Ҫ���ַ����ȽϺ���strcmp���ú������a��b��ÿ���ַ�������ascii��ֵ�Ƚϣ����������ȫ��ͬ����0�����a��ascii��ֵ�ȳ��ֽϴ��ߣ��᷵��1�����򷵻�-1�� 
+		{
+			a[i].num+=newone.num;
+			flag=1;
+			break;
+		}
+	}
+	if(flag==0) a[n++]=newone;
+	cout<<"¼��ɹ���"<<endl; 
+	system("pause");
+	system("cls");
+}
+void _out()
+{
+	cout<<"���������������Ϣ��"<<endl;
+	stuff newone;
+	int flag=0;
+	scanf("%s %d",&newone.name,&newone.num);
+	for(int i=0;i<n;i++)
+	{
+		if(strcmp(newone.name,a[i].name)==0)
+/*���ﲻ��ֱ����==�ж������ַ����Ƿ���ȣ���Ҫ���ַ����ȽϺ���strcmp;
+�ú������a��b��ÿ���ַ�������ascii��ֵ�Ƚϣ�
+���������ȫ��ͬ����0�����a��ascii��ֵ�ȳ��ֽϴ��ߣ��᷵��1�����򷵻�-1��*/ 
+		{
+			a[i].num-=newone.num;
+			if(a[i].num<0)
+			{
+				a[i].num+=newone.num;
+				cout<<"��治�㣬�޷�����"<<endl; 
+			}
+			else cout<<"����ɹ�"<<endl; 
+			flag=1;
+			break;
+		}
+	}
+	if(flag==0) cout<<"δ�ҵ��û���޷�����"<<endl;  
+	system("pause");
+	system("cls");
+
+}
+int main()
+{
+	FILE*List;
+	if((List=fopen("List.txt","r+"))==NULL)//����r+��ʾ�򿪵��ļ��ɶ�; 
+	{
+		cout<<"����ļ���ȡʧ�ܣ�";
+		return 0;
+	}
+	else
+	{
+		fscanf(List,"%d",&n);
+		for(int i=0;i<n;i++) fscanf(List,"%s %d",&a[i].name,&a[i].num);
+	}
+	while(1)
+	{
+		cout<<"1.��ʾ����б�"<<endl<<"2.���"<<endl<<"3.����"<<endl<<"4.�˳�����"<<endl<<"��������ѡ��˵����ܣ�"<<endl; 
+		char t=_getch();
+		system("cls");
+		int flag=0;
+		switch(t)
+		{
+			case '1':
+			{
+				dispaly();
+				break;//Ҫ��break���������ִ����case '1'����ȥִ�к��漸��case������ 
+			}
+			case '2':
+			{
+				_in();
+				break;
+			}
+			case '3':
+			{
+				_out();
+				break;
+			}
+			case '4':
+			{
+				fclose(List);
+				FILE*fp;
+				if((fp=fopen("List.txt","w+"))==NULL)//����ֻ��дw+����д�� 
+				{
+					cout<<"����ļ���ȡʧ�ܣ�";
+					return 0;
+				}
+				else
+				{
+					fprintf(fp,"%d\n",n);//֮ǰ���еIJ������Խṹ��������У�ֻ�����Ҫ��������ǰ������д�ļ��� 
+					for(int i=0;i<n;i++) fprintf(fp,"%s %d\n",a[i].name,a[i].num);
+					fclose(List);
+				}
+				return 0;
+			}
+			default:
+			{
+				flag=1;
+				break;
+			}
+		}
+		if(flag)
+		{
+			cout<<"error"<<endl;
+			Sleep(100);
+			system("cls");
+		}
+	}
+	return 0;
+}