2021/4/24天梯赛全国总决赛题解

L1-1

#include<bits/stdc++.h>
using namespace std;
int main()
{
	cout<<"To iterate is human, to recurse divine."<<endl; 
	return 0;
} 

L1-2

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int N,K,M,res;
	cin>>N>>K>>M;
	res=N-K*M;
	cout<<res<<endl;
	return 0;
} 

L1-3

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,year,month;
	cin>>n;
	if(n<10000){
		int a=n/100;//年份
		if(a<22){
			year=2000+a;
			month=n-a*100;
		} 
		else{
			year=1900+a;
			month=n-a*100;
		}
	}
	else{
		year=n/100;
		month=n-year*100;
	}
	if(month<10)
		cout<<year<<"-"<<"0"<<month<<endl;
	else
		cout<<year<<"-"<<month<<endl;
	return 0;
} 

L1-4

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int N,M;
	float P[100];
	cin>>N>>M;
	for(int i=0;i<N;i++){
		cin>>P[i];
	}
	for(int i=0;i<N;i++){
		if(P[i]<M){
			cout<<"On Sale! ";
			printf("%.1f\n",P[i]);
		}
	}
	return 0;
} 

L1-5

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int m[24],time[1000],cnt=0,temp,t;
	for(int i=0;i<24;i++){
		cin>>m[i];
	}
	while(1){
		cin>>t;
		if(t>=0&&t<=23){
			time[cnt]=t;
			cnt++;
		}
		else
			break;
	}
	for(int i=0;i<cnt;i++){
		temp=time[i];
		if(m[temp]>50)
			cout<<m[temp]<<" "<<"Yes"<<endl;
		else
			cout<<m[temp]<<" "<<"No"<<endl;
	}
	return 0;
} 

L1-6

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,k,m;
	cin>>n>>k;
	string vec[n];
	getchar();//获取换行符
	int cnt=0;
	for(int i=0;i<n;i++){
		string str;
		getline(cin,str);
		if(str.find("easy")!=-1) continue;
		if(str.find("qiandao")!=-1) continue;
		vec[cnt]=str;
		cnt++;
	} 
	if(k>=cnt)
		cout<<"Wo AK le"<<endl;
	else
		cout<<vec[k]<<endl;
	return 0; 
}

L1-7

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
	int N,xiao=0,da=0;
	cin>>N;
	ll nl[N],min,max;
	for(int i=0;i<N;i++){
		cin>>nl[i];
	}
	sort(nl,nl+N);//从小到大排序 
	min=nl[0];
	max=nl[N-1];
	for(int i=0;i<N;i++){
		if(nl[i]==min)
			xiao++;
		if(nl[i]==max)
			da++;
	}
	cout<<min<<" "<<xiao<<endl;
	cout<<max<<" "<<da<<endl;
	return 0;
} 

L1-8

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a1,a2,n;
	cin>>a1>>a2>>n;
	int a[n];
	a[0]=a1;
	a[1]=a2;
	int f1=0,f2=1;
	int i=2;
	while(i<n){
		int f3=a[f1]*a[f2];
		if(f3>=10){
			a[i]=f3/10;
			a[i+1]=f3%10;
			i+=2;
		}else{
			a[i]=f3;
			i++;
		}
		f1++;
		f2++;
	}
	for(int i=0;i<n;i++){
		if(i==n-1){
			cout<<a[i];
		}else{
			cout<<a[i]<<' ';
		}
	}
	return 0;
}