diff --git a/#121. 特殊 a 串数列和.cpp b/#121. 特殊 a 串数列和.cpp
new file mode 100644
index 0000000..6ad3acec
--- /dev/null
+++ b/#121. 特殊 a 串数列和.cpp	
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int sum1=0,sum2=0;
+	int a,n;
+	cin >>n>>a;
+	for(int i=0;i<n;i++){
+		sum1=sum1*10+a;
+		sum2+=sum1;
+	}
+	cout <<sum2;
+	return 0;
+}
+
+
diff --git a/#127. 分离整数的各个数.cpp b/#127. 分离整数的各个数.cpp
new file mode 100644
index 0000000..6ad3ace7
--- /dev/null
+++ b/#127. 分离整数的各个数.cpp	
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c=0,d[10000],i=0;
+	cin >>a;
+	b=a;
+	while(a){
+		a/=10;
+		c++;
+	}
+	while(b){
+		d[i]=b%10;
+		b/=10;
+		i++;
+	}
+	for(int i=0;i<c;i++){
+		cout <<d[i]<<" ";
+	}
+	return 0;
+}
+
+
diff --git a/#146. 回文数.cpp b/#146. 回文数.cpp
new file mode 100644
index 0000000..0bc0118
--- /dev/null
+++ b/#146. 回文数.cpp	
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	int sum=0;
+	cin >>a;
+	b=a; 
+	while(a){
+		sum=sum*10+a%10;
+		a/=10;
+	}
+	if(b==sum){
+		cout <<"yes";
+	}
+	else{
+		cout <<"no";
+	}
+	return 0;
+}
+
+
diff --git a/#153. 统计满足条件的4位数.cpp b/#153. 统计满足条件的4位数.cpp
new file mode 100644
index 0000000..8934fa2
--- /dev/null
+++ b/#153. 统计满足条件的4位数.cpp	
@@ -0,0 +1,29 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[10000],b,c,d,e,f,g=0;
+	cin >>b;
+	for(int i=0;i<b;i++){
+		cin >>a[i];
+	}
+	for(int i=0;i<b;i++){
+		c=a[i]%10;
+		a[i]/=10;
+		d=a[i]%10;
+		a[i]/=10;
+		e=a[i]%10;
+		a[i]/=10;
+		f=a[i]%10;
+		a[i]/=10;
+		if((c-d-e-f)>0){
+			g++;
+		}
+	}
+	cout <<g;
+	return 0;
+}
+
+
diff --git a/#209. 矩阵交换行.cpp b/#209. 矩阵交换行.cpp
new file mode 100644
index 0000000..1d7a056
--- /dev/null
+++ b/#209. 矩阵交换行.cpp	
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[100][100],b[100][100],c,d;
+	for(int i=0;i<5;i++){
+		for(int j=0;j<5;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=0;i<5;i++){
+		for(int j=0;j<5;j++){
+			b[i][j]=a[i][j];
+		}
+	}
+	cin >>c>>d;
+	for(int i=0;i<5;i++){
+		a[c-1][i]=a[d-1][i];
+	}
+	for(int i=0;i<5;i++){
+		a[d-1][i]=b[c-1][i];
+	}
+	for(int i=0;i<5;i++){
+		for(int j=0;j<5;j++){
+			cout <<a[i][j]<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
+
+
diff --git a/#228. 统计数字字符个数.cpp b/#228. 统计数字字符个数.cpp
new file mode 100644
index 0000000..7ca516f
--- /dev/null
+++ b/#228. 统计数字字符个数.cpp	
@@ -0,0 +1,19 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a[10000];
+	int b=0;
+	gets(a);
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]>='0' && a[i]<='9'){
+			b++;
+		}
+	}
+	cout <<b;
+	return 0;
+}
+
+
diff --git a/#248. 字符串小手术.cpp b/#248. 字符串小手术.cpp
new file mode 100644
index 0000000..8878d13
--- /dev/null
+++ b/#248. 字符串小手术.cpp	
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a[10000];
+	char b;
+	cin >>a>>b;
+	cout <<a[0];
+	for(int i=1;i<strlen(a);i++){
+		cout <<b<<a[i];
+	}
+	return 0;
+}
+
+
diff --git a/#249. 字符串假肢手术1.cpp b/#249. 字符串假肢手术1.cpp
new file mode 100644
index 0000000..525634c
--- /dev/null
+++ b/#249. 字符串假肢手术1.cpp	
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a[10000],c;
+	int b;
+	cin >>a>>b>>c;
+	for(int i=0;i<strlen(a);i++){
+		if(i==(b-1)){
+			cout <<c;
+		}
+		else{
+			cout <<a[i];
+		}
+	}
+	return 0;
+}
+
+
diff --git a/#264. 小码君统计人名字母数.cpp b/#264. 小码君统计人名字母数.cpp
new file mode 100644
index 0000000..31d19e3
--- /dev/null
+++ b/#264. 小码君统计人名字母数.cpp	
@@ -0,0 +1,23 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a[10000];
+	int b=0;
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]==','){
+			cout <<b<<" ";
+			b=0;
+		}
+		else{
+			b++;
+		}
+	}
+	cout <<b;
+	return 0;
+}
+
+
diff --git a/#278. 小码君的回文字符串.cpp b/#278. 小码君的回文字符串.cpp
new file mode 100644
index 0000000..745d327
--- /dev/null
+++ b/#278. 小码君的回文字符串.cpp	
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a[10000];
+	cin >>a;
+	int b;
+	int flag=1;
+	for(int i=strlen(a)-1;i>=0;i--){
+		b=strlen(a)-i-1;
+		if(a[i]!=a[b]){
+			flag=0;
+			break;
+		}
+	}
+	if(flag==1){
+		cout <<"Yes";
+	}
+	else{
+		cout <<"No";
+	}
+	return 0;
+}
+
+
diff --git a/2个数字的排列.cpp b/2个数字的排列.cpp
new file mode 100644
index 0000000..df86668
--- /dev/null
+++ b/2个数字的排列.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=a;j++){
+			if(i!=j){
+				cout <<i<<" "<<j<<endl; 
+			}
+		}
+	}
+	return 0;
+}
diff --git a/2个数字的组合.cpp b/2个数字的组合.cpp
new file mode 100644
index 0000000..313d5ea
--- /dev/null
+++ b/2个数字的组合.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		for(int j=i+1;j<=a;j++){
+			cout <<i<<" "<<j<<endl; 
+		}
+	}
+	return 0;
+}
diff --git a/3n＋1问题.cpp b/3n＋1问题.cpp
new file mode 100644
index 0000000..9f1bb8c
--- /dev/null
+++ b/3n＋1问题.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <cmath>
+#include <cstdlib>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	int b=0;
+	cin >>a;
+	while(a>1){
+		if(a%2==1){
+			a=a*3+1;
+			b++;
+		}
+		if(a%2==0){
+			a=a/2;
+			b++;
+		}
+	}
+	cout <<b;
+	return 0;
+}
+
+
diff --git a/5新冠病毒初步筛查.cpp b/5新冠病毒初步筛查.cpp
new file mode 100644
index 0000000..89de1ce
--- /dev/null
+++ b/5新冠病毒初步筛查.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	string name;
+	d tw;
+	l ks;
+}arr[10000];
+int main(){
+	l cnt=0;
+	l a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].tw>>arr[i].ks;
+	}
+	for(int i=0;i<a;i++){
+		if(arr[i].tw>=37.5 && arr[i].ks==1){
+			cout <<arr[i].name<<endl;
+			cnt++;
+		}
+	}
+	cout <<cnt;
+	return 0;
+}
diff --git a/B2044 有一门课不及格的学生.cpp b/B2044 有一门课不及格的学生.cpp
new file mode 100644
index 0000000..b49ad18
--- /dev/null
+++ b/B2044 有一门课不及格的学生.cpp	
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a,b,c,d=0;
+	cin >>a>>b>>c;
+	if(a>=60){
+		d++;
+	}
+	if(b>=60){
+		d++;
+	}
+	if(c>=60){
+		d++;
+	}
+	if(d==2){
+		cout <<1;
+	}
+	else{
+		cout <<0;
+	}
+	return 0;
+}
diff --git a/Hello World.cpp b/Hello World.cpp
new file mode 100644
index 0000000..7acfcb7
--- /dev/null
+++ b/Hello World.cpp	
@@ -0,0 +1,6 @@
+#include <iostream>
+using namespace std;
+int main(){
+	cout <<"Hello World";
+	return 0;
+} 
diff --git a/TeX中的引号.cpp b/TeX中的引号.cpp
new file mode 100644
index 0000000..8351a9b
--- /dev/null
+++ b/TeX中的引号.cpp
@@ -0,0 +1,29 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[1000];
+	l cnt=0;
+	cin.getline(a,1000);
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='"' && cnt%2==0){
+			cout <<"``";
+			cnt++;
+		}
+		else if(a[i]=='"' && cnt%2==1){
+			cout <<"''";
+			cnt++;
+		}
+		else{
+			cout <<a[i];
+		}	
+	}
+	return 0;
+}
diff --git a/hanoi(汉诺塔).cpp b/hanoi(汉诺塔).cpp
new file mode 100644
index 0000000..9fed53f
--- /dev/null
+++ b/hanoi(汉诺塔).cpp
@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+void s(char a,char b,char c,int n){
+	//������a��ʾ��ʼ����b��ʾ��������c��ʾĿ������n��ʾ����
+	if(n==1){
+		printf("%c->%c\n",a,c);//�ݹ鵽1�����ӣ�ֱ�Ӵ���ʼ����Ŀ���� 
+		return; 
+	} 
+	s(a,c,b,n-1);//�Ƚ�n-1��  ��A��B
+	printf("%c->%c\n",a,c);
+	s(b,a,c,n-1);//�ٽ�n-1��  ��B��C 
+} 
+int main(){
+	char a,b,c;
+	int d;
+	cin >>d>>a>>b>>c;
+	s(a,b,c,d);
+	return 0;
+}
diff --git a/sssss...n 的积.cpp b/sssss...n 的积.cpp
new file mode 100644
index 0000000..b83901e
--- /dev/null
+++ b/sssss...n 的积.cpp	
@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	int sum;
+	cin >>a;
+	for(sum=1;a>0;a--){
+		sum*=a;
+	}
+	cout <<sum;
+	return 0;
+}
+
+
diff --git a/「7-1」A、队列的基本操作.cpp b/「7-1」A、队列的基本操作.cpp
new file mode 100644
index 0000000..082bcdd
--- /dev/null
+++ b/「7-1」A、队列的基本操作.cpp
@@ -0,0 +1,55 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+string b;
+queue<int> que;
+int main(){
+	freopen("A.in","r",stdin);
+	freopen("A.out","w",stdout);
+	int a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>b;
+		if(b=="push"){
+			int x;
+			cin >>x;
+			que.push(x); 
+		}
+		else if(b=="front" && que.empty()==0){
+			cout <<que.front()<<endl;
+		}
+		else if(b=="front" && que.empty()==1){
+			cout <<"error"<<endl;
+		}
+		else if(b=="pop" && que.empty()==0){
+			que.pop();
+		}
+		else if(b=="pop" && que.empty()==1){
+			cout <<"error"<<endl;
+		}
+		else if(b=="empty"){
+			if(que.empty()==1){
+				cout <<"empty"<<endl;
+			}
+			if(que.empty()==0){
+				cout <<"not empty"<<endl;
+			}
+		}
+		else if(b=="clear"){
+			while(que.empty()!=true){
+				que.pop();
+			}
+		} 
+	}
+	return 0;
+}
diff --git a/「NOIP 2002 普及组」级数求和.cpp b/「NOIP 2002 普及组」级数求和.cpp
new file mode 100644
index 0000000..8eaf45c
--- /dev/null
+++ b/「NOIP 2002 普及组」级数求和.cpp	
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	double a,sum=0;
+	int b=0;
+	scanf("%lf",&a);
+	while(sum<=a){
+		b++;
+		sum+=1*1.0/b;
+	}
+	printf("%d",b);
+	return 0;
+}
diff --git a/「NOIP 2010 普及组」数字统计.cpp b/「NOIP 2010 普及组」数字统计.cpp
new file mode 100644
index 0000000..6532114
--- /dev/null
+++ b/「NOIP 2010 普及组」数字统计.cpp	
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,sum=0;
+	scanf("%d%d",&a,&b);
+	for(int i=a;i<=b;i++){
+		int c=i;
+		while(c){
+			if(c%10==2){
+				sum++;
+			}
+			c/=10;
+		}
+	}
+	printf("%d",sum);
+	return 0;
+}
diff --git a/「NOIP 2011 Day 1」铺地毯.cpp b/「NOIP 2011 Day 1」铺地毯.cpp
new file mode 100644
index 0000000..01bef35
--- /dev/null
+++ b/「NOIP 2011 Day 1」铺地毯.cpp	
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+int n,x,y;
+int a[10005];
+int b[10005];
+int g[10005];
+int k[10005];
+using namespace std;
+int main(){
+	cin >>n;
+	for(int i=0;i<n;i++){
+		cin >>a[i]>>b[i]>>g[i]>>k[i];
+	}
+	cin >>x>>y;
+	for(int i=n-1;i>=0;i--){
+		if(x>=a[i] && x<=a[i]+g[i] && y>=b[i] && y<=b[i]+k[i]){
+			cout <<i+1;
+			return 0;
+		}
+	}
+	cout <<"-1";
+	return 0;
+}
diff --git a/「NOIP 2015普及组」金币.cpp b/「NOIP 2015普及组」金币.cpp
new file mode 100644
index 0000000..0c0abf9
--- /dev/null
+++ b/「NOIP 2015普及组」金币.cpp	
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b=1,sum=0;
+	cin >>a;
+	while(a>b){
+		sum+=b*b;
+		a-=b;
+		b++;
+	}
+	sum+=b*a;
+	cout <<sum;
+	return 0;
+}
+
+
diff --git a/「例题1-4」鸡兔同笼.cpp b/「例题1-4」鸡兔同笼.cpp
new file mode 100644
index 0000000..e43f47e
--- /dev/null
+++ b/「例题1-4」鸡兔同笼.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	long long flag=0;
+	for(int i=0;i<=a;i++){
+		for(int j=0;j<=a;j++){
+			if(i*2+j*4==b && i+j==a){
+				cout <<i<<" "<<j;
+			}
+			else{
+				flag++;
+			}
+		}
+	}
+	if(flag==(a+1)*(a+1)){
+		cout <<"No answer";
+	}
+	return 0;
+}
diff --git a/「程序3-2」开灯问题.cpp b/「程序3-2」开灯问题.cpp
new file mode 100644
index 0000000..6cb42b6
--- /dev/null
+++ b/「程序3-2」开灯问题.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a,b,c[100000];
+	cin >>a>>b;
+	for(int i=1;i<=a;i++){
+		c[i]=0;
+	}
+	for(int i=2;i<=b;i++){
+		for(int j=1;j<=a;j++){
+			if(j%i==0){
+				c[j]++;
+			}
+		}
+	}
+	for(int i=1;i<=a;i++){
+		if(c[i]%2==0){
+			cout <<i<<" ";
+		}
+	}
+	return 0;
+}
diff --git a/【模板】快速排序.cpp b/【模板】快速排序.cpp
new file mode 100644
index 0000000..e0b597f
--- /dev/null
+++ b/【模板】快速排序.cpp
@@ -0,0 +1,24 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+int arr[10000000];
+using namespace std;
+int main(){
+	int a; 
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i];
+	}
+	sort(arr,arr+a);
+	for(int i=0;i<a;i++){
+		cout <<arr[i]<<" ";
+	}
+	return 0;
+}
diff --git a/不及格的人（结构体）.cpp b/不及格的人（结构体）.cpp
new file mode 100644
index 0000000..2846cc5
--- /dev/null
+++ b/不及格的人（结构体）.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	string name;
+	int score;																																																																			
+}arr[10000]; 
+int main(){
+	int a;
+	int flag=0;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].score;
+	}
+	for(int i=0;i<a;i++){
+		if(arr[i].score>=60){
+			
+		}
+		else{
+			cout <<arr[i].name<<endl;
+			flag=1;
+		}
+	}
+	if(flag==0){
+		cout <<"Good!";
+	} 
+	return 0;
+}
diff --git a/按位与或非.cpp b/按位与或非.cpp
new file mode 100644
index 0000000..3b6b518
--- /dev/null
+++ b/按位与或非.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c,d,e;
+	cin >>a>>b;
+	c=a&b;
+	d=a|b;
+	e=~a;
+	cout <<c<<endl;
+	cout <<d<<endl;
+	cout <<e;
+	return 0;
+}
diff --git a/标记门牌号.cpp b/标记门牌号.cpp
new file mode 100644
index 0000000..d4bf8cd
--- /dev/null
+++ b/标记门牌号.cpp
@@ -0,0 +1,47 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,g=0;
+	cin >>a>>b;
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=b;j++){
+			int k=i*100+j;
+			int c[1000]={0,0};
+			int d=0;
+			while(k){
+				c[d]=k%10;
+				k/=10;
+				d++;
+			}
+			int p[10000];
+			for(int i=d-1;i>=0;i--){
+				p[d-1-i]=c[i];
+			}
+			for(int i=0;i<d;i++){
+				if(c[i]==6){
+					c[i]=9;
+				}
+				else if(c[i]==9){
+					c[i]=6;
+				}
+			}
+			int flag=1;
+			for(int i=0;i<d;i++){                   
+				if(c[i]!=p[i] || (c[i]!=6 && c[i]!=0 && c[i]!=1 && c[i]!=8 && c[i]!=9)){
+					flag=0;
+					break;
+				}
+			}
+			if(flag==1){
+				g++;
+			}
+		}
+	}
+	cout <<g;
+	return 0;
+}
diff --git a/百元百鸡问题.cpp b/百元百鸡问题.cpp
new file mode 100644
index 0000000..c471c18
--- /dev/null
+++ b/百元百鸡问题.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=0;i<=a;i++){
+		for(int j=0;j<=a;j++){
+			for(int k=0;k<=a;k++){
+				if(i+j+k==a && 5*i+3*j+k*1.0/3==a && k%3==0){
+					cout <<i<<" "<<j<<" "<<k<<endl;
+				}
+			}
+		}
+	}
+	return 0;
+}
diff --git a/阿克曼函数.cpp b/阿克曼函数.cpp
new file mode 100644
index 0000000..89cbcf0
--- /dev/null
+++ b/阿克曼函数.cpp
@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int wjh(int a,int b){
+	if(a==0){
+		b++;
+	}
+	if(a>0 && b==0){
+		return wjh(a-1,1);
+	}
+	if(a>0 && b>0){
+		return wjh(a-1,wjh(a,b-1));
+	}
+}
+int main(){
+	int a,b;
+	cin >>a>>b;
+	cout <<wjh(a,b);
+	return 0;
+}