diff --git a/TP4-1 b/TP4-1
new file mode 100644
index 0000000000000000000000000000000000000000..d0ad172044002b8a1fbff0c217ae33bbd1897b74
--- /dev/null
+++ b/TP4-1
@@ -0,0 +1,66 @@
+#include<iostream>
+#include<time.h>
+#include<cstdlib>
+using namespace std;
+
+
+//question 1
+
+int uniquePaths(int m, int n){
+	int i=0;
+	int j=0; 
+	//建立储存路径数的二维数组 
+	int chemin[m][n]={0};
+	if((m==1)||(n==1)){
+		return 1;
+	}else{
+		//为边界赋初始值
+	for(i=0;i<n;i++){
+		chemin[0][i]=1;
+	}
+	for(j=0;j<m;j++){
+		chemin[j][0]=1;
+	}
+	for(i=1;i<m;i++){
+		for(j=1;j<n;j++){
+			chemin[i][j]=chemin[i-1][j]+chemin[i][j-1];
+		//	cout<<"i="<<i <<" "<<"j="<<j <<" "<<"chemin="<<chemin[i][j]<<endl; 
+		}
+	}
+	//cout<<"chemin possible est"<<chemin[m][n]<<endl;
+	return chemin[m-1][n-1]; 
+		
+	}
+	
+}
+
+//question 2
+int uniquePathsRe(int m, int n){
+	int k=0;
+	if((m==1)||(n==1))
+	{
+		return 1; 
+	}else{
+		return uniquePathsRe(m-1,n)+uniquePathsRe(m,n-1);
+	}
+}
+
+//question 3
+int uniquePathsSimple(int m, int n){
+	int chemin[m];
+	int k=0;
+	int j=0;
+	//初始化 
+	for(k=0;k<m;k++){
+		chemin[k]=1;
+		//cout<<"chemin["<<k<<"]"<<"="<<chemin[k]<<endl;
+	}
+	for(j=0;j<n-1;j++){
+		for(k=1;k<m;k++){
+		chemin[k]=chemin[k-1]+chemin[k];
+		//cout<<"chemin["<<k<<"]"<<"="<<chemin[k]<<endl;
+		} 
+	}
+	return chemin[m-1];
+
+}
\ No newline at end of file