#include<bits/stdc++.h>
using namespace std;
string s[105];int y[105],m[105],d[105];
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
    	cin>>s[i]>>y[i]>>m[i]>>d[i];
	}
	for(int i=2;i<=n*(n+1)/2;i++){
		if(y[i]>y[i-1])swap(s[i],s[i-1]),swap(y[i],y[i-1]),swap(m[i],m[i-1]),swap(d[i],d[i-1]);
	}
	for(int i=2;i<=n*(n+1)/2;i++){
		if(m[i]>m[i-1]&&y[i]==y[i-1])swap(s[i],s[i-1]),swap(y[i],y[i-1]),swap(m[i],m[i-1]),swap(d[i],d[i-1]);
	}
	for(int i=2;i<=n*(n+1)/2;i++){
		if(d[i]>d[i-1]&&y[i]==y[i-1]&&m[i]==m[i-1])swap(s[i],s[i-1]),swap(y[i],y[i-1]),swap(m[i],m[i-1]),swap(d[i],d[i-1]);
	}
	for(int i=n;i>=1;i--){
		cout<<s[i]<<'\n';
	}
	return 0;
}

dfs(半成品)

#include<bits/stdc++.h>
using namespace std;
int kp[10005],s[10005],p[10005],f1[10005];
int main(){
	int n,m,cnt=0;
	cin>>n>>m;
	int k=n;
    for(int i=1;i<=n;i++){
    	cin>>kp[i]>>s[i];
	}
	for(int j=1;j<=100;j++){
		for(int i=1;i<=n;i++){
			if(s[i]==j){
				p[k]=s[i],f1[k]=kp[i],k--;
			}
		}
	}
	int fsx=p[3*m/2];
	for(int i=1;i<=n;i++){
		if(s[i]>=fsx)cnt++;
	}
	cout<<fsx<<' '<<cnt<<'\n';
	for(int i=1;i<=cnt;i++){
		cout<<f1[i]<<' '<<p[i]<<'\n';
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int cnt=0;
long long f(int n,int m){
	if(m-n<0) return cnt;
	if(m-n>=0)cnt++;
	if(cnt%2==0)m+=n;
	return f(n,m-n);
}
int main() {
//	freopen("sum.in","r",stdin);
//	freopen("sum.out","w",stdout);
    int a,b;
    cin>>a>>b;
    cout<<f(a,b);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
struct student {
	string name;
	int ch,ma,en,SS,id;
} Q[1005];
bool cmp(student a,student b) {
	if(a.SS!=b.SS)
		return a.SS>b.SS;
	return a.id<b.id;
}
int main() {
	int n;
	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>Q[i].name>>Q[i].ch>>Q[i].ma>>Q[i].en;
		Q[i].SS=Q[i].ch+Q[i].ma+Q[i].en,Q[i].id=i;
	}
	sort(Q+1,Q+n+1,cmp);
	cout<<Q[1].name<<' '<<Q[1].ch<<' '<<Q[1].ma<<' '<<Q[1].en;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
bool is_prime(int o) {
	if (o == 2)return true;
	if (o < 2)return false;
	int q = 1;
	while (q * q <= o) {
		q++;
		if (o % q == 0)return false;
	}
	return true;
}
int main() {
//	freopen("factorial.in","r",stdin);
//	freopen("factorial.out","w",stdout);
	int t = 1;
	for (int i = 1000; i <= 3000; i++) {
		t=0;
		if (is_prime(i)) {
			if (is_prime(i % 1000)) {
				if (is_prime(i % 100)) {
					if (is_prime(i % 10))t = 2;
					}else continue;
			}else continue;
		}else continue;
		if (t == 2)cout << i <<endl;
	}
	return 0;
}

```cpp
#include<bits/stdc++.h>
using namespace std;
int S(int a){
	int s0=0;
	for(int i=1;i<a;i++){
		if(a%i==0)s0+=i;
	}
	return s0;
	}
int main() {
//	freopen("factorial.in","r",stdin);
//	freopen("factorial.out","w",stdout);
	int n,m;
	cin>>n>>m;
	for(int i=n;i<=m;i++){
		if(i==S(i))cout<<i<<' ';
	}
	return 0;
}

疯癫霖朝译爱上sort

 #include<bits/stdc++.h>
using namespace std;
long long A[10][10],max1[50],min1[50],P1[50],P2[50];
int main(){
	long long maxx=-100000000000,minn=100000000000,k=34567,cnt=0;
	int n,m;
	cin>>n>>m;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		cin>>A[i][j];
		}
}
	for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		minn=min(minn,A[i][j]);
		}
		min1[i]=minn;P1[i]=i;
		minn=100000000000;
	}
	for(int j=1;j<=m;j++){
    	for(int i=1;i<=n;i++){
    		maxx=max(maxx,A[i][j]);
		}
		max1[j]=maxx;P2[j]=j;
		maxx=-100000000000;
	}
for(int j=1;j<=m;j++){ 
    	for(int i=1;i<=n;i++){
    	if(min1[i]==max1[j])cnt++,k=1;
	}
} for(int j=1;j<=m;j++){
    for(int i=1;i<=n;i++){
    	if(min1[i]==max1[j])cout<<P1[i]<<' '<<P2[j]<<' '<<min1[i]<<endl,k=1;
	}
}
	    if(k==34567)cout<<"not exist";
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
long long A[10][10],max1[50],min1[50],P1[50],P2[50];
int main(){
	long long maxx=-100000000000,minn=100000000000,k=34567,cnt=0;
	int n,m;
	cin>>n>>m;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		cin>>A[i][j];
		}
}
	for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		minn=min(minn,A[i][j]);
		}
		min1[i]=minn;P1[i]=i;
		minn=10000000;
	}
	for(int j=1;j<=m;j++){
    	for(int i=1;i<=n;i++){
    		maxx=max(maxx,A[i][j]);
		}
		max1[j]=maxx;P2[j]=j;
		maxx=-10000000;
	}
for(int j=1;j<=m;j++){ 
    	for(int i=1;i<=n;i++){
    	if(min1[i]==max1[j])cnt++,k=1;
	}
} for(int j=1;j<=m;j++){
    for(int i=1;i<=n;i++){
    	if(min1[i]==max1[j])cout<<P1[i]<<' '<<P2[j]<<' '<<min1[i]<<endl,k=1;
	}
}
	    if(k==34567)cout<<"not exist";
	return 0;
}

 #include<bits/stdc++.h>
using namespace std;
int main(){
  freopen("park.in","r",stdin);    //¹ØÁªÊäÈëÎļþ
  freopen("park.out","w",stdout);  //¹ØÁªÊä³öÎļþ
    long long n,x,y,a,b,t,s0=0,s=0;
	cin>>n>>x>>y>>a>>b;
	for(int i=1;i<=n;i++){
		cin>>t;
		if(t<=x)s0=0;
		else if(t<=y)s0=a;
		else s0=a+ceil((t-y)*1.0/y)*b;
		s+=s0;
		s0=0;
	}
	cout<<s;
 fclose(stdin);//¹Ø±ÕÎļþ 
 fclose(stdout);//¹Ø±ÕÎļþ 
}

//在n个数a中计算数字p的个数
#include<bits/stdc++.h>
using namespace std;
int main(){  
    int n,a,k,p,cnt=0;
	cin>>n>>p;
	for(int i=1;i<=n;i++){
		cin>>a;
		while(a>0){
			k=a%10;
			if(k==p)cnt++;
			a/=10;
		}
	}       
	cout<<cnt;                                  
	return 0;
}

//判断素数
#include<bits/stdc++.h>
using namespace std;
int main(){
	int x,k=1;
	cin>>x;
	for(int i=2;i<x;i++){
		 k=x%i;
		if(k==0){break;};
	}
	cout<<k;
	return 0;
}

//最大公约数
#include<bits/stdc++.h>
using namespace std;
int main(){  
    int a,b,t=1;
	cin>>a>>b;
	while(t){
		t=a%b;
		a=b;
		b=t;
	}       
	cout<<a;           
	return 0;
}