diff --git a/level1/p02_isPrime/p02_isPrime.cpp b/level1/p02_isPrime/p02_isPrime.cpp
new file mode 100644
index 00000000..953e3f93
--- /dev/null
+++ b/level1/p02_isPrime/p02_isPrime.cpp
@@ -0,0 +1,40 @@
+#include <cmath>
+#include <cstdio>
+#define ll long long 
+using namespace std;
+const int maxn=100000,N1=maxn+5;
+
+int pr[N1],cnt;
+bool vis[N1];
+void get_prime()
+{
+    for(int i=2;i<=maxn;i++)
+    {
+        if(!vis[i]) pr[++cnt]=i;
+        for(int j=1;j<=cnt&&i*pr[j]<=maxn;j++)
+        {
+            vis[i*pr[j]]=1;
+            if(i%pr[j]==0) break;
+        }
+    }
+}
+int check(ll x)
+{
+    ll m=sqrt(x);
+    for(int j=1;pr[j]<=m&&j<=cnt;j++)
+        if(x%pr[j]==0) return 0;
+    return 1;
+}
+
+ll n;
+
+int main()
+{
+    scanf("%lld",&n);
+    if(n<=1){ puts("bad input"); return 0; }
+    get_prime();
+    int flag=check(n);
+    if(!flag) puts("NO"); else puts("YES");
+    return 0;
+}
+
diff --git a/level1/p03_Diophantus/p03_Diophantus.cpp b/level1/p03_Diophantus/p03_Diophantus.cpp
new file mode 100644
index 00000000..95f4ae68
--- /dev/null
+++ b/level1/p03_Diophantus/p03_Diophantus.cpp
@@ -0,0 +1,16 @@
+#include <cmath>
+#include <cstdio>
+#define dd double
+#define ll long long 
+using namespace std;
+const int maxn=100000,N1=maxn+5;
+
+
+int main()
+{
+    //(1/6+1/12+1/7)x+5+1/2x+4=x
+    dd x=(5.0+4.0)/(1.0-1.0/2-1.0/6-1.0/7-1.0/12);
+    printf("%.0lf\n",x); 
+    return 0;
+}
+
diff --git a/level1/p04_ narcissus/p04_narcissus.cpp b/level1/p04_ narcissus/p04_narcissus.cpp
new file mode 100644
index 00000000..9ebe8c46
--- /dev/null
+++ b/level1/p04_ narcissus/p04_narcissus.cpp	
@@ -0,0 +1,28 @@
+#include <cmath>
+#include <cstdio>
+#define dd double
+#define ll long long 
+using namespace std;
+const int maxn=100000,N1=maxn+5;
+
+int a[2];
+void check(int x)
+{
+    int tx=x,tot=0;
+    for(int i=0;i<=2;i++)
+    {
+        a[i]=tx%10, tx/=10;
+        tot+=a[i]*a[i]*a[i];
+    }
+    if(tot==x) printf("%d\n",x);
+}
+
+int main()
+{
+    for(int i=100;i<=999;i++)
+    {
+        check(i);
+    }
+    return 0;
+}
+
diff --git a/level1/p05_allPrimes/p05_allPrimes.cpp b/level1/p05_allPrimes/p05_allPrimes.cpp
new file mode 100644
index 00000000..666a1f49
--- /dev/null
+++ b/level1/p05_allPrimes/p05_allPrimes.cpp
@@ -0,0 +1,35 @@
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#define dd double
+#define ll long long 
+using namespace std;
+const int maxn=1000,N1=maxn+5;
+
+clock_t st,ed;
+int pr[N1],cnt;
+bool vis[N1];
+void get_prime()
+{
+    for(int i=2;i<=maxn;i++)
+    {
+        if(!vis[i]) pr[++cnt]=i, printf("%d ",i);
+        for(int j=1;j<=cnt&&i*pr[j]<=maxn;j++)
+        {
+            vis[i*pr[j]]=1;
+            if(i%pr[j]==0) break;
+        }
+    }
+    puts("");
+}
+
+int main()
+{
+    st=clock();
+    get_prime();
+    ed=clock();
+    printf("%.7lfs\n",(double)(ed-st)/CLOCKS_PER_SEC);
+    //Time complexity:O(n)
+    return 0;
+}
+
diff --git a/level1/p06_Goldbach/p06_Goldbach.cpp b/level1/p06_Goldbach/p06_Goldbach.cpp
new file mode 100644
index 00000000..034175c2
--- /dev/null
+++ b/level1/p06_Goldbach/p06_Goldbach.cpp
@@ -0,0 +1,41 @@
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#define dd double
+#define ll long long 
+using namespace std;
+const int maxn=100,N1=maxn+5;
+
+clock_t st,ed;
+int pr[N1],cnt;
+bool vis[N1];
+void get_prime()
+{
+    for(int i=2;i<=maxn;i++)
+    {
+        if(!vis[i]) pr[++cnt]=i; //printf("%d ",i);
+        for(int j=1;j<=cnt&&i*pr[j]<=maxn;j++)
+        {
+            vis[i*pr[j]]=1;
+            if(i%pr[j]==0) break;
+        }
+    }
+    // puts("");
+}
+void check(int x)
+{
+    for(int i=2;i+2<=x;i++) if(!vis[i]&&!vis[x-i])
+        { printf("%d:%d %d\n",x,i,x-i); return; }
+    printf("%d:failed\n",x);
+}
+
+int main()
+{
+    // Goldbach conjecture:
+    // every even number greater than 2 is able to be represented as the sum of two primes
+    get_prime();
+    for(int i=4;i<=maxn;i+=2) check(i);
+    // Time complexity : O(n^2)
+    return 0;
+}
+
diff --git a/level1/p07_encrypt_decrypt/p07_encrypt_decrypt.cpp b/level1/p07_encrypt_decrypt/p07_encrypt_decrypt.cpp
new file mode 100644
index 00000000..9cc1960b
--- /dev/null
+++ b/level1/p07_encrypt_decrypt/p07_encrypt_decrypt.cpp
@@ -0,0 +1,68 @@
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cstring>
+#define dd double
+#define ll long long 
+using namespace std;
+const int maxn=100,N1=maxn+5,base=63;
+
+// base64:
+char encx(int x)
+{
+    x=x&base;
+    if(0<=x&&x<=25) return x+'A';
+    if(26<=x&&x<=51) return x-26+'a';
+    if(52<=x&&x<=61) return x-52+'0';
+    if(x==62) return '+'; else return '/';
+}
+int decx(char x)
+{
+    if('A'<=x&&x<='Z') return x-'A';
+    if('a'<=x&&x<='z') return x-'a'+26;
+    if('0'<=x&&x<='9') return x-'0'+52;
+    if(x=='+') return 62; else return 63;
+}
+int encrypt(char *s,char *enc,int len)
+{
+    int n=0,tmp,i;
+    for(i=0;i<len;i+=3)
+    {
+        tmp=(*(int*)(s+i))&0xffffff; 
+        enc[n++]=encx(tmp); tmp>>=6;
+        enc[n++]=encx(tmp); tmp>>=6;
+        enc[n++]=encx(tmp); tmp>>=6;
+        enc[n++]=encx(tmp);
+    }
+    if(len%3==1) enc[n-1]='=', enc[n-2]='=';
+    else if(len%3==2) enc[n-1]='='; 
+    return n;
+}
+void decrypt(char *enc,char *s)
+{
+    int tmp,y,len=strlen(enc);
+    if(enc[len-1]=='=') enc[len-1]='A'; if(enc[len-2]=='=') enc[len-2]='A';
+    for(int i=0,j;i<len;i+=4)
+    {
+        j=i/4; tmp=0;
+        y=decx(enc[i+3]); tmp|=y; tmp<<=6;
+        y=decx(enc[i+2]); tmp|=y; tmp<<=6;
+        y=decx(enc[i+1]); tmp|=y; tmp<<=6;
+        y=decx(enc[i]); tmp|=y;
+        *(int*)(s+j*3)=tmp;
+    }
+}
+
+char origin[N1],ency[N1],decy[N1];
+
+int main()
+{
+    freopen("a.in","r",stdin);
+    scanf("%s",origin); int len=strlen(origin);
+    int lene=encrypt(origin,ency,len);
+    for(int i=0;i<lene;i++) printf("%c",ency[i]); puts("");
+    decrypt(ency,decy);
+    for(int i=0;i<lene;i++) printf("%c",decy[i]); puts("");
+    return 0;
+}
+
diff --git a/level1/p08_hanoi/p08_hanoi.cpp b/level1/p08_hanoi/p08_hanoi.cpp
new file mode 100644
index 00000000..1ae23768
--- /dev/null
+++ b/level1/p08_hanoi/p08_hanoi.cpp
@@ -0,0 +1,39 @@
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+#define dd double
+#define ll long long 
+#define ull unsigned long long 
+using namespace std;
+const int maxn=100,N1=maxn+5,base=63;
+
+int n;
+int tot=0;
+void mov(int dep,int st,int via,int ed)
+{
+    if(dep>1) mov(dep-1,st,ed,via);
+    printf("step %d: %d %d -> %d\n",++tot,dep,st,ed);
+    if(dep>1) mov(dep-1,via,st,ed);
+}
+
+int main()
+{
+    freopen("a.out","w",stdout);
+    scanf("%d",&n);
+    int A=1,B=2,C=3; 
+    mov(n,A,B,C);
+    return 0;
+}
+
+
+// ull f[N1];
+
+// 题解：
+// 1. 考虑递推（或归纳）， 设A柱子为起始柱，B柱子为辅助柱，C柱子为目标柱
+//     假设我们已经求解出A柱子上有i个圆盘时的答案，现在需要求解有i+1个圆盘时的答案；
+//     第i+1个圆盘在移动前必须保证如下条件：A中最上面的圆盘是i+1，B应该放置1~i的所有圆盘，C是空柱子
+//     然后再把B当做起始柱，A当做辅助柱，把放置在B上的1~i的所有圆盘依次挪到C
+//     可得递推式：f[i]=f[i-1]*2+1, f[1]=1
+//     n=64可以用递推轻松求解(注意要使用unsigned long long)
diff --git a/level1/p09_maze/p09_maze.cpp b/level1/p09_maze/p09_maze.cpp
new file mode 100644
index 00000000..b770806a
--- /dev/null
+++ b/level1/p09_maze/p09_maze.cpp
@@ -0,0 +1,256 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <conio.h>
+#include <time.h>
+#include <windows.h>
+#include <queue>
+#include <algorithm>
+#define dd double
+#define ll long long 
+#define ull unsigned long long 
+using namespace std;
+
+// // 生成迷宫：生成树算法
+// // 我的做法：随机边权然后最小生成树
+int n,m,cte;
+struct EDGE{ 
+int x,y,w; 
+friend bool operator < (const EDGE &s1,const EDGE &s2)
+{
+    return s1.w<s2.w;
+}
+}e[1500*4+5]; 
+
+
+HANDLE output[2];
+COORD coord = {0,0};
+DWORD bytes = 0;
+int cmp(EDGE aa,EDGE bb)
+{
+    return aa.w<bb.w;
+}
+int checkx(int x,int y)
+{
+    if(x>=1 && x<n && y>=1 && y<m) return 1;
+    return 0;
+}
+int id(int x,int y){ return m*x+y; }
+char data[32][52];
+int fx[5] = {0,-1,1,0,0}, fy[5] = {0,0,0,-1,1}; //*wsad
+
+void init_hard_version()
+{
+    puts("Plz choose difficulty:");
+    puts("press [1] to choose easy difficulty");
+    puts("press [2] to choose standard difficulty");
+    puts("press [3] to choose hard difficulty");
+    puts("press [4] to choose customized difficulty");
+    int input=getch();
+    switch(input)
+    {
+        case '1': n=10,m=10; break;
+        case '2': n=20,m=20; break;
+        case '3': n=26,m=50; break;
+        case '4': 
+        {
+            puts("Plz input game map size:");
+            printf("Number of Rows:"); scanf("%d",&n);
+            printf("Number of Columns:"); scanf("%d",&m);
+            n=min(n,26); m=min(m,50);
+            break;
+        }
+    }
+}
+
+struct node{ int x,y; };
+int fa[2005];
+int idx(int x,int y){ return (x-1)*m+y; }
+int findfa(int x)
+{
+    int y=x,tmp;
+    while(y!=fa[y]) y=fa[y];
+    while(fa[x]!=x){
+        tmp=fa[x]; fa[x]=y, x=tmp;
+    }
+    return y;
+}
+void printmap()
+{
+    system("cls");
+    for(int i=0;i<=n;i++,puts("")) for(int j=0;j<=m;j++) 
+        if(data[i][j]) printf("%c",data[i][j]);
+        else printf(" ");
+}
+void build_puzzle()
+{
+    for(int i=1;i<n;i++) for(int j=1;j<m;j++) 
+    {
+        fa[idx(i,j)]=idx(i,j);
+        if((i&1)^(j&1))
+            e[++cte]=(EDGE){i,j,rand()*rand()%1000000};
+        else if(i&1) data[i][j]=0; 
+    }
+    sort(e+1,e+cte+1);
+    int x,y,ia,ib;
+    for(int j=1;j<=cte;j++)
+    {
+        x=e[j].x; y=e[j].y; //id=idx(x,y);
+        if(x&1){
+            if(checkx(x,y-1)&&checkx(x,y+1))
+            {
+                ia=idx(x,y-1); ib=idx(x,y+1);
+                ia=findfa(ia); ib=findfa(ib);
+                if(ia!=ib){ 
+                    fa[ia]=ib; data[x][y]=0; }
+                else{
+                    // data[x][y]='$';
+                }
+            }
+        }else{
+            if(checkx(x+1,y)&&checkx(x-1,y))
+            {
+                ia=idx(x+1,y); ib=idx(x-1,y);
+                ia=findfa(ia); ib=findfa(ib);
+                if(ia!=ib){ 
+                    fa[ia]=ib; data[x][y]=0; }
+                else{
+                    // data[x][y]='$';
+                }
+            }
+        }
+    }
+    // printmap();
+}
+
+//以下为部分借鉴的模板
+//双缓冲解决闪屏问题
+void initconsolveScreenBuffer();
+int show(HANDLE hout,int &x,int &y,int to);
+int get_toward();
+int cnt=0;
+
+void setcolor(HANDLE hCon,unsigned short ForeColor,unsigned short BackGroundColor)
+{
+    // HANDLE hCon = GetStdHandle(STD_OUTPUT_HANDLE); //获得缓冲区句柄
+    bool flag=SetConsoleTextAttribute(hCon,ForeColor|BackGroundColor); //设置文本及背景颜色
+    flag=flag^1; flag=flag^1;
+    // SetConsoleTextAttribute(hCon,FOREGROUND_RED | FOREGROUND_INTENSITY | BACKGROUND_GREEN); //设置文本及背景颜色
+}
+void initconsolveScreenBuffer()
+{
+    output[0] = CreateConsoleScreenBuffer(
+        GENERIC_WRITE|GENERIC_READ,
+        FILE_SHARE_WRITE|FILE_SHARE_READ,
+        NULL,
+        CONSOLE_TEXTMODE_BUFFER,
+        NULL
+    );
+    output[1] = CreateConsoleScreenBuffer(
+        GENERIC_WRITE|GENERIC_READ,
+        FILE_SHARE_WRITE|FILE_SHARE_READ,
+        NULL,
+        CONSOLE_TEXTMODE_BUFFER,
+        NULL
+    );
+    CONSOLE_CURSOR_INFO cci; //创建光标
+    cci.bVisible = 0; //光标可见度
+    cci.dwSize = 1; //光标大小
+    SetConsoleCursorInfo(output[0],&cci);
+    SetConsoleCursorInfo(output[1],&cci);
+    //start data
+    for(int i=0;i<=n;i++) for(int j=0;j<=m;j++) data[i][j]='#';
+    build_puzzle();
+    data[0][1]='W';
+}
+int get_toward()
+{
+    int input=getch(),to;
+    switch(input)
+    {
+        case 'w': to=1; break;
+        case 's': to=2; break;
+        case 'a': to=3; break;
+        case 'd': to=4; break;
+        case '0': to=0; break; //退出程序
+        case 224:
+        {
+            input=getch();
+            switch(input)
+            {
+                case 72: to=1; break;
+                case 80: to=2; break;
+                case 75: to=3; break;
+                case 77: to=4; break;
+            }
+            break; 
+        }
+        default : to=-1; break; 
+    }
+    return to;
+}
+int is_start;
+int show(HANDLE hout,int &x,int &y,int to)
+{
+    if(!to) return 0; if(to==-1) return 1;
+    if(x+fx[to]>=1 && x+fx[to]<n && y+fy[to]>=1 && y+fy[to]<m && !data[x+fx[to]][y+fy[to]]) //&& 
+    {
+        swap(data[x][y],data[x+fx[to]][y+fy[to]]);
+        x+=fx[to]; y+=fy[to];
+    }
+    if(is_start) data[0][1]='#';
+    
+    CONSOLE_SCREEN_BUFFER_INFO csbiInfo;
+    setcolor(hout,FOREGROUND_GREEN|FOREGROUND_INTENSITY,0); //|BACKGROUND_RED |FOREGROUND_INTENSITY
+    
+	GetConsoleScreenBufferInfo(hout, &csbiInfo); //未改变？？？？
+    csbiInfo.dwCursorPosition=coord;
+	// wOldColorAttrs = csbiInfo.wAttributes;
+    
+    if(cnt==2)
+        bytes=0;
+    LPDWORD num=0;
+    SetConsoleCursorPosition(hout,coord);
+    for(int i=0;i<=n;i++) 
+    {
+        coord.Y=i;
+        data[i][m+1]='\n';
+        WriteConsoleA(hout,data[i],m+2,num,NULL);
+        GetConsoleScreenBufferInfo(hout, &csbiInfo); 
+    }
+    coord.Y=0;
+    SetConsoleActiveScreenBuffer(hout); //把缓冲区作为显示的缓冲区
+    
+    cnt++;
+    return 1;
+}
+
+
+
+int main()
+{
+    // scanf("%d",&n);
+    srand(time(NULL));
+    // system("color 0E");
+    init_hard_version();
+    initconsolveScreenBuffer();
+    int to=2,now=1,x=0,y=1; //初始化输出一次
+    is_start=1; show(output[now],x,y,to); is_start=0; now^=1;
+    while(to=get_toward())
+    {
+        show(output[now],x,y,to);
+        if(x==n-1 && y==m-1) 
+            { n=n; break; }
+        now^=1;
+    }
+    LPDWORD num=0;
+    // coord.Y=n+3;
+    WriteConsoleA(output[now],"\n",1,num,NULL);
+    WriteConsoleA(output[now],"Congratulations!\n",17,num,NULL);
+    SetConsoleActiveScreenBuffer(output[now]); //把缓冲区作为显示的缓冲区
+    // puts("YOU WIN!");
+    Sleep(1000000);
+    return 0;
+}
+
+
diff --git a/p01_runningLetter.cpp b/p01_runningLetter.cpp
new file mode 100644
index 00000000..38ad5da8
--- /dev/null
+++ b/p01_runningLetter.cpp
@@ -0,0 +1,24 @@
+#include <cstdio>
+#include <cstring>
+#include <windows.h>
+#include <algorithm>
+using namespace std;
+
+
+char str[]="sto NamelessOIer orz";
+
+int main()
+{
+    int now=0,len=20,type=1;
+    while(1)
+    {
+        system("cls");
+        for(int i=1;i<=now;i++) printf(" ");
+        for(int i=0;i<len;i++) printf("%c",str[i]);
+        if(now==80) type=-1;
+        now+=type;
+        if(!now) type=1;
+        Sleep(10);
+    }
+    return 0;
+}
diff --git a/p10_push.cpp b/p10_push.cpp
new file mode 100644
index 00000000..9e118d40
--- /dev/null
+++ b/p10_push.cpp
@@ -0,0 +1,190 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <conio.h>
+#include <time.h>
+#include <windows.h>
+#include <queue>
+#include <algorithm>
+#define FG FOREGROUND_GREEN
+#define FR FOREGROUND_RED
+#define FB FOREGROUND_BLUE
+#define FI FOREGROUND_INTENSITY
+#define dd double
+#define ll long long 
+#define ull unsigned long long 
+using namespace std;
+
+int n,m,Score,End,step;
+HANDLE output[2];
+COORD coord = {0,0};
+DWORD bytes = 0;
+int checkx(int x,int y)
+{
+    if(x>=1 && x<n && y>=1 && y<m) return 1;
+    return 0;
+}
+int id(int x,int y){ return m*x+y; }
+char data[32][102];
+int fx[6] = {0,-1,1,0,0,0}, fy[6] = {0,0,0,-1,1,0}; //*wsad
+
+//以下为部分借鉴的模板
+//双缓冲解决闪屏问题
+int cnt=0;
+
+int checkok(int x,int y)
+{
+    return x>=1 && x<n && y>=1 && y<m;
+}
+void setcolor(HANDLE hCon,unsigned short ForeColor,unsigned short BackGroundColor)
+{
+    bool flag=SetConsoleTextAttribute(hCon,ForeColor|BackGroundColor); //设置文本及背景颜色
+}
+void initconsolveScreenBuffer(int &x,int &y)
+{
+    output[0] = CreateConsoleScreenBuffer(
+        GENERIC_WRITE|GENERIC_READ,
+        FILE_SHARE_WRITE|FILE_SHARE_READ,
+        NULL,
+        CONSOLE_TEXTMODE_BUFFER,
+        NULL
+    );
+    output[1] = CreateConsoleScreenBuffer(
+        GENERIC_WRITE|GENERIC_READ,
+        FILE_SHARE_WRITE|FILE_SHARE_READ,
+        NULL,
+        CONSOLE_TEXTMODE_BUFFER,
+        NULL
+    );
+    CONSOLE_CURSOR_INFO cci; //创建光标
+    cci.bVisible = 0; //光标可见度
+    cci.dwSize = 1; //光标大小
+    SetConsoleCursorInfo(output[0],&cci);
+    SetConsoleCursorInfo(output[1],&cci);
+    //start data
+    memset(data,0,sizeof(data));
+    scanf("%d%d%d\n",&n,&m,&End);
+    for(int i=0;i<=n;i++)
+    {
+        gets(data[i]); data[i][m+2]='\n';
+        for(int j=0;j<=m;j++) if(data[i][j]=='@') 
+            x=i, y=j;
+    }
+}
+int get_toward()
+{
+    int input=getch(),to;
+    switch(input)
+    {
+        case 'w': to=1; break;
+        case 's': to=2; break;
+        case 'a': to=3; break;
+        case 'd': to=4; break;
+        case '0': to=0; break; //退出程序
+        case 224:
+        {
+            input=getch();
+            switch(input)
+            {
+                case 72: to=1; break;
+                case 80: to=2; break;
+                case 75: to=3; break;
+                case 77: to=4; break;
+            }
+            break; 
+        }
+        default : to=-1; break; 
+    }
+    return to;
+}
+void print_unique(HANDLE hout,int i,int y,int color)
+{
+    LPDWORD num=0;
+    setcolor(hout,color,0); //|BACKGROUND_RED |FOREGROUND_INTENSITY
+    WriteConsoleA(hout,data[i]+y,1,num,NULL);
+}
+void put_str(HANDLE hout,int color,char *s,int type)
+{
+    LPDWORD num=0;
+    setcolor(hout,color,0);
+    WriteConsoleA(hout,s,strlen(s),num,NULL);
+    if(type) SetConsoleActiveScreenBuffer(hout); //把缓冲区作为显示的缓冲区
+}
+
+int is_start,task=1;
+char str[100];
+int show(HANDLE hout,int &x,int &y,int to)
+{
+    
+    if(!to) return 0; if(to==-1) return 1; char c;
+    if(checkok(x+fx[to],y+fy[to])) //&& 
+    {
+        c=data[x+fx[to]][y+fy[to]];
+        if(c==' '||c=='@'){ //目标是空
+            swap(data[x][y],data[x+fx[to]][y+fy[to]]);
+            x+=fx[to]; y+=fy[to];
+            if(c!='@') step++;
+        }else if(c=='$'){ //目标是箱子
+            if(checkok(x+2*fx[to],y+2*fy[to]))
+            {
+                if(data[x+2*fx[to]][y+2*fy[to]]=='?'){
+                    data[x+fx[to]][y+fy[to]]=data[x][y]; data[x][y]=' '; 
+                    data[x+2*fx[to]][y+2*fy[to]]='&';
+                    Score++;
+                    x+=fx[to]; y+=fy[to];
+                    step++;
+                }else if(data[x+2*fx[to]][y+2*fy[to]]==' '){
+                    swap(data[x+fx[to]][y+fy[to]],data[x+2*fx[to]][y+2*fy[to]]);
+                    swap(data[x+fx[to]][y+fy[to]],data[x][y]);
+                    x+=fx[to]; y+=fy[to];
+                    step++;
+                }
+            }
+        }
+    }
+    
+    CONSOLE_SCREEN_BUFFER_INFO csbiInfo;
+    // setcolor(hout,FOREGROUND_GREEN|FOREGROUND_INTENSITY,0); //|BACKGROUND_RED |FOREGROUND_INTENSITY
+    
+    LPDWORD num=0;
+    SetConsoleCursorPosition(hout,coord);
+    sprintf(str,"LEVEL:%d\11\11",task);
+    put_str(hout,FG|FB|FI,str,0);
+    sprintf(str,"@:Player  "); 
+    put_str(hout,FR|FI,str,0);
+    sprintf(str,"#:Wall    \n"); 
+    put_str(hout,FG|FI,str,0);
+    
+    sprintf(str,"Score:%d \11",step);
+    put_str(hout,FG|FB|FI,str,0);
+    sprintf(str,"$:Box     "); 
+    put_str(hout,FG|FR|FI,str,0);
+    sprintf(str,"?:Target  \n"); 
+    put_str(hout,FR|FB|FI,str,0);
+    sprintf(str,"\11\11&:Obtained\n"); 
+    put_str(hout,FB|FI,str,0);
+    
+    for(int i=0;i<=n;i++) 
+    {
+        data[i][m+1]='\n'; //coord.Y=i; 
+        for(int j=0;j<=m+1;j++)
+        {
+            switch(data[i][j])
+            {
+                case '@': print_unique(hout,i,j,FR|FI); break;
+                case '#': print_unique(hout,i,j,FG|FI); break;
+                case '$': print_unique(hout,i,j,FG|FR|FI); break;
+                case '?': print_unique(hout,i,j,FR|FB|FI); break;
+                case '&': print_unique(hout,i,j,FB|FI); break;
+                default: print_unique(hout,i,j,0); break;
+                // case ' ': print_unique(hout,i,j,0);
+            }
+        }
+    }
+    coord.Y=0;
+    // h = GetStdHandle(STD_OUTPUT_HANDLE);
+    SetConsoleActiveScreenBuffer(hout); //把缓冲区作为显示的缓冲区
+    // Sleep(2000);
+    cnt++;
+    return 1;
+}
diff --git a/p10_pushBoxes.cpp b/p10_pushBoxes.cpp
new file mode 100644
index 00000000..3288dc92
--- /dev/null
+++ b/p10_pushBoxes.cpp
@@ -0,0 +1,44 @@
+#include "p10_push.h"
+
+int main()
+{
+    // init_hard_version();
+    int to=0,now=1,x,y; //初始化输出一次
+    while(task<=4)
+    {
+        switch(task)
+        {
+            case 1: freopen("round1.in","r",stdin); break;
+            case 2: freopen("round2.in","r",stdin); break;
+            case 3: freopen("round3.in","r",stdin); break;
+            case 4: freopen("round4.in","r",stdin); break;
+        }
+        initconsolveScreenBuffer(x,y); Score=0;
+        fclose(stdin); 
+        now=1; to=5; show(output[now],x,y,to); now^=1;
+        while(to=get_toward())
+        {
+            show(output[now],x,y,to);
+            if(Score==End) 
+                { n=n; break; }
+            now^=1;
+        }
+        LPDWORD num=0;
+        // coord.Y=n+3;
+        WriteConsoleA(output[now],"\n",1,num,NULL);
+        put_str(output[now],FG|FB|FI,"Congratulations!\n",1);
+        if(task==4) break;
+        Sleep(3000);
+        task++;
+    }
+    put_str(output[now],FG|FB|FI,"YOU WIN!!!\n",1);
+    Sleep(1000000);
+    return 0;
+}
+
+// #：墙
+// @：玩家位置
+// $：箱子
+// ?：目标地点
+// %：已经得分
+
diff --git a/p10_pushBoxes.h b/p10_pushBoxes.h
new file mode 100644
index 00000000..02d8f927
--- /dev/null
+++ b/p10_pushBoxes.h
@@ -0,0 +1,14 @@
+#include "p10_push.cpp"
+
+int checkx(int x,int y);
+int id(int x,int y);
+int checkok(int x,int y);
+void initconsolveScreenBuffer();
+int show(HANDLE hout,int &x,int &y,int to);
+int get_toward();
+void setcolor(HANDLE hCon,unsigned short ForeColor,unsigned short BackGroundColor);
+void initconsolveScreenBuffer(int &x,int &y);
+void print_unique(HANDLE hout,int i,int y,int color);
+void put_str(HANDLE hout,int color,char *s,int type);
+
+
diff --git a/p11_linkedList.cpp b/p11_linkedList.cpp
new file mode 100644
index 00000000..047d63c5
--- /dev/null
+++ b/p11_linkedList.cpp
@@ -0,0 +1,223 @@
+#include <conio.h>
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+#define dd double
+#define ll long long 
+#define ull unsigned long long 
+// #include "p11_linkedList.h"
+using namespace std;
+const int N1=105;
+
+int n, tot;
+struct node{
+int val; node *nxt;
+};
+node *head;
+
+int get_command();
+node* createnode(int x);
+void releasenode(node* now);
+node* insert(int pos,int x);
+void del();
+void DEL(int pos);
+void print(int type);
+node* inverse();
+int find_first(int w);
+int find_nxt(int pos,int w);
+
+void ins()
+{
+    system("cls");
+    print(0);
+    puts("Please input new point's position and its value.");
+    int pos, w;
+    scanf("%d %d",&pos,&w);
+    insert(pos,w);
+}
+void del()
+{
+    system("cls");
+    print(0);
+    puts("Please input the position where you want to delete.");
+    int pos;
+    scanf("%d",&pos);
+    DEL(pos);
+}
+void abnor()
+{
+    puts("");
+    puts("Press [0] to continue...");
+    int to;
+    while(1)
+    {
+        to=get_command();
+        if(to==0) break;
+    }
+}
+int find1()
+{
+    system("cls");
+    puts("Please input the value you want to find.");
+    int pos,w; scanf("%d",&w);
+    pos = find_first(w);
+    printf("%d",pos);
+    abnor();
+    return pos;
+}
+int now_w;
+int findn(int st)
+{
+    system("cls");
+    puts("Please input the value you want to find.");
+    int pos,w; 
+    if(st==-1){
+        pos=-1; puts("Please redirect the start position by press [5] in your next command.");
+        // if(now_w == w) pos=-1; else { scanf("%d",&w); pos = find_nxt(st,w); now_w = w; }
+    }else{ scanf("%d",&w); pos = find_nxt(st,w); now_w = w; }
+    printf("%d",pos); 
+    abnor();
+    return pos;
+}
+
+int main()
+{
+    // freopen("a.in","r",stdin);
+    printf("Plz input the size of your linkedlist:");
+    scanf("%d",&n);
+    puts("Plz input the elements in order in your linkedlist:");
+    puts("The last element will be linked with the first element.");
+    head = new node ((node){0,NULL}); 
+    for(int i=0;i<n;i++) 
+    {
+        int x;
+        scanf("%d",&x);
+        insert(i,x);
+    }
+    while(1)
+    {
+        system("cls");
+        puts("Press [1] to insert a point.");
+        puts("Press [2] to delete a point.");
+        puts("Press [3] to print the linkedlist.");
+        puts("Press [4] to inverse the linkedlist.");
+        puts("Press [5] to find the first position of the w.");
+        puts("Press [6] to find the next position of the w.");
+        puts("Press [/] to quit");
+        int to=get_command(), st;
+        switch(to)
+        {
+            case 1: ins(); break;
+            case 2: del(); break;
+            case 3: print(1); break;
+            case 4: inverse(); break;
+            case 5: st=find1(); break;
+            case 6: st=findn(st); break;
+        }
+        if(to==7) break;
+    }
+    return 0;
+}
+
+int get_command()
+{
+    int input=getch(),to;
+    switch(input)
+    {
+        case '1': to=1; break;
+        case '2': to=2; break;
+        case '3': to=3; break;
+        case '4': to=4; break;
+        case '5': to=5; break;
+        case '6': to=6; break;
+        case '/': to=7; break;
+        case '0': to=0; break;
+        default : to=-1; break; 
+    }
+    return to;
+}
+void releasenode(node* now)
+{
+    int cnt=tot; node *nxt;
+    for(;cnt;cnt--)
+    {
+        nxt = (*now).nxt;
+        delete now;
+        if(cnt>1) now = nxt;
+    }
+}
+node* createnode(int x)
+{
+    node *buf = new node ((node){x,NULL});
+    return buf;
+}
+node* insert(int pos,int x)
+{
+    node* now=head; 
+    if((*now).nxt==NULL){ (*now).val=x; (*now).nxt=now; tot++; return now; } //原链表没有元素
+    pos--;
+    for(;pos;now=(*now).nxt,pos--);
+    node *nxt = (*now).nxt, *cur = createnode(x);
+    (*now).nxt = cur; (*cur).nxt = nxt;
+    tot++;
+    return cur;
+}
+void DEL(int pos)
+{
+    node* now=head; 
+    if(pos==1) pos=tot; else pos--;
+    for(;pos>1;now=(*now).nxt,pos--);
+    node *cur = (*now).nxt;
+    (*now).nxt = (*cur).nxt; 
+    delete cur;
+    tot--;
+}
+void print(int type)
+{
+    node *now; now=head; int cnt=tot;
+    for(;cnt;cnt--,now=(*now).nxt)
+    {
+        printf("%d ",(*now).val);
+    }
+    if(type==0) puts("");
+    if(type==1) abnor();
+}
+node* inverse()
+{
+    node *cur = createnode((*head).val), *now, *tmp, *nxt, *st; 
+    (*cur).nxt = cur;
+    now = head; st = cur;
+    int cnt = tot;
+    for(;cnt;cnt--,now=(*now).nxt)
+    {
+        nxt = (*now).nxt;
+        if(cnt!=1) tmp = createnode((*nxt).val); else tmp = st;
+        (*tmp).nxt = cur;
+        cur = tmp;
+    }
+    releasenode(head);
+    head = cur;
+    print(1); 
+    return cur;
+}
+int find_first(int w)
+{
+    node* now = head; int cnt=1;
+    for(;cnt<=tot;cnt++,now=(*now).nxt)
+    {
+        if((*now).val==w) break;
+    }
+    if(cnt==tot+1) return -1;
+    return cnt;
+}
+int find_nxt(int pos,int w) //pos之后的第一个w值
+{
+    node* now = head; int cnt=pos;
+    for(;cnt;now=(*now).nxt,cnt--); cnt=pos+1;
+    for(;cnt<=tot;cnt++,now=(*now).nxt)
+    {
+        if((*now).val==w) break;
+    }
+    if(cnt==tot+1) return -1;
+    return cnt;
+}
diff --git a/p12_warehouse.cpp b/p12_warehouse.cpp
new file mode 100644
index 00000000..7129c06b
--- /dev/null
+++ b/p12_warehouse.cpp
@@ -0,0 +1,165 @@
+#include <conio.h>
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+#define dd double
+#define ll long long 
+#define ull unsigned long long 
+using namespace std;
+const int N1=10005;
+
+int n,m;
+struct Ware{
+char name[40];
+int len,num;
+}a[N1];
+
+// 1. 实现如下的菜单（按数字选择菜单功能）：
+// 	- 显示存货列表 // 1
+// 	- 入库 // 2
+// 	- 出库 // 3
+// 	- 退出程序 // 0 
+// 1. 实现菜单对应功能（需记录货物的型号、数量等信息）；
+// 1. 程序启动时从文件中读取当前库存数据，退出时保存库存数据；
+
+int get_command()
+{
+    int input=getch(),to;
+    switch(input)
+    {
+        case '1': to=1; break;
+        case '2': to=2; break;
+        case '3': to=3; break;
+        case '0': to=4; break;
+        default : to=-1; break; 
+    }
+    return to;
+}
+
+int idx(char c){ 
+    if(c=='-') return 0; if(c=='.') return 1;
+    if('A'<=c&&c<='Z') return c-'A'+2;
+    if('a'<=c&&c<='z') return c-'a'+28;
+    if('0'<=c&&c<='9') return c-'0'+55;
+} //' '之后的
+int id[N1];
+struct Trie{
+int ch[N1*40][64],id[N1],tot;
+int findx(char *s,int len)
+{
+    int x=0,c;
+    for(int i=0;i<len;i++)
+    {
+        c=idx(s[i]);
+        if(ch[x][c]) x=ch[x][c];
+        else ch[x][c]=++tot, x=tot;
+    }
+    return x;
+}
+int upd(char *s,int len,int w)
+{
+    int x=findx(s,len);
+    if(!id[x]) 
+    {
+        id[x]=++n; a[n].len=len;
+        for(int j=0;j<len;j++) a[n].name[j]=s[j];
+        a[n].name[len]=' ';
+    }
+    if(a[id[x]].num+w<0) return 0;
+    a[id[x]].num+=w;
+    return 1;
+}
+}tr;
+void list();
+void stock();
+void ship();
+void save();
+
+int main()
+{
+    freopen("ware.txt","r",stdin);
+    // fopen("ware.txt","r");
+    scanf("%d",&m);
+    char tmp[N1];
+    for(int i=1;i<=m;i++) 
+    {
+        scanf("%s",tmp); int l=strlen(tmp); a[i].len=l;
+        for(int j=0;j<l;j++) a[i].name[j]=tmp[j];
+        scanf("%d",&a[i].num);
+        tr.upd(a[i].name,l,0);
+    }
+    // fclose(stdin); fflush(stdin);
+    freopen( "CON", "r", stdin );
+    int to;
+    while(1)
+    {
+        system("cls");
+        puts("Press [1] to list");
+        puts("Press [2] to stock");
+        puts("Press [3] to ship");
+        puts("Press [0] to quit");
+        to=get_command();
+        switch(to)
+        {
+            case 1: list(); break;
+            case 2: stock(); break;
+            case 3: ship(); break;
+            case 4: save(); break;
+        }
+        if(to==4) break;
+    }
+    return 0;
+}
+
+void abnor()
+{
+    puts("");
+    puts("Press [0] to continue...");
+    int to;
+    while(1)
+    {
+        to=get_command();
+        if(to==4) break;
+    }
+}
+void list()
+{
+    system("cls");
+    int lmax=0;
+    for(int i=1;i<=n;i++) lmax=max(lmax,a[i].len);
+    for(int i=1;i<=n;i++)
+    {
+        printf("%s",a[i].name);
+        for(int j=a[i].len;j<lmax;j++) putchar(' ');
+        printf(": %d\n",a[i].num);
+    }
+    abnor();
+}
+char str[40];
+void stock()
+{
+    system("cls");
+    puts("Please input the goods' name and how much do you want to stock:");
+    scanf("%s",str); int len=strlen(str),w; scanf("%d",&w);
+    int fl=tr.upd(str,len,w);
+    if(!fl) printf("Invalid stock! The number of remaining boxes will be negative\n"), abnor();
+}
+void ship()
+{
+    system("cls");
+    puts("Please input the goods' name and how much do you want to ship:");
+    scanf("%s",str); int len=strlen(str),w; scanf("%d",&w);
+    int fl=tr.upd(str,len,-w);
+    if(!fl) printf("Invalid shipment! The number of remaining boxes will be negative\n"), abnor();
+}
+void save()
+{
+    freopen("ware.txt","w",stdout);
+    printf("%d\n",n);
+    for(int i=1;i<=n;i++) 
+    {
+        printf("%s",a[i].name);
+        printf(" %d\n",a[i].num);
+    }
+    fclose(stdout);
+}