WZOI-101至120题答案

最新推荐文章于 2024-03-23 19:36:04 发布

善良的小乔

最新推荐文章于 2024-03-23 19:36:04 发布

阅读量466

点赞数

分类专栏： WZOI题目文章标签： c++ 算法 Powered by 金山文档

本文链接：https://blog.csdn.net/Annconda/article/details/128885036

版权

WZOI题目专栏收录该内容

213 篇文章 24 订阅

订阅专栏

题目及AC代码：

101.计算比例

#include<bits/stdc++.h>
using namespace std;
int main(){
	double a,na,b,nb,c,nc,d,e,f,g;
	cin>>a>>na>>b>>nb>>c>>nc;
	d=(na-a)/a;
	e=na-a+nb-nb/(b+1)+c;
	f=a+nb/(b+1)+nc-c;
	g=e/f;
	if(d<=g){
		cout<<"tan90";
	}else{
		printf("%.2f",d-g);
	}
	return 0;
}

102.选举

#include<bits/stdc++.h>
using namespace std;
int main(){
	longlong a[4],b[4],s=0,s1=0;
	for(int i=0;i<4;i++){
		cin>>a[i]>>b[i];
		s=s+a[i];
		s1=s1+a[i]+b[i];
	}
	if(s>s1/2){
		cout<<"qindingla!";
	}else{
		cout<<"too naive!";
	}
	return 0;
}

103.说谎

#include<bits/stdc++.h>
using namespace std;
int main(){
    bool a[4]={},b[4]={};
    for(int i=0;i<=3;i++) cin>>a[i];  
    b[3]=1;
    for(int i=3;i>=1;i--){
        if(b[i]==a[i]) b[i-1]=1;
        else b[i-1]=0;
    }
    for(int i=0; i<=3; i++) cout<<b[i]<<' ';
    return 0;
}

104.装修

#include<bits/stdc++.h>
using namespace std;
int main(){
	longlong n,m,k;
	cin>>n>>m>>k;
	if(m>k){
		cout<<n*k;
	}else{
		cout<<n*m;
	}
	return 0;
}

105.英雄战士

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,m,h;
	cin>>a>>b>>m>>h;
	if(a<b){
		m=m-a;
		if(m>=0){
			h=h-a;
			if(h>0){
				cout<<"terrorist win";
			}else{
				cout<<"counter terrorist win";
			}
		}else{
			cout<<"counter terrorist win";
		}
	} 
	if(a>b){
		m=m-b;
		if(m>=0){
			h=h-b;
			if(h>0){
				cout<<"terrorist win";
			}else{
				cout<<"counter terrorist win";
			}
		}else{
			cout<<"counter terrorist win";
		}
	} 
	return 0;
}

106.追赶问题

#include<bits/stdc++.h>
using namespace std;
int main(){
	double a,x,v1,v2,t;
	cin>>x>>v1>>v2>>t;
	a=x/(v1-v2);
	if(a<=t){
		cout<<"Yes ";
		printf("%.2lf",a);
	}else{
		cout<<"No";
	}
	return 0;
}

107.撕票

#include<bits/stdc++.h>
using namespace std;
int main(){
	longlong t,ph,n,s;
	cin>>t>>ph>>n;
	s=t*n;
	if(s>=ph){
		cout<<"\"PKS has been killed!\"";
	}else{
		cout<<"\"You have been killed by PKS!\"";
	}
	return 0;
}

108.四叶玫瑰

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,a1,x,s=0;
	cin>>a;
	a1=a;
	while(a){
		x=a%10;
		s=s+x*x*x*x;
		a/=10;
	}
	if(a1==s){
		cout<<"yes";
	}else{
		cout<<"no";
	}
	return 0;
}

109.判断分数

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m,a,x,b,y;
    cin >>n>>m;
    cin >>a>>x>>b>>y;
    if(a==x/m&&b==y/m) cout<<2333;
    else cout<<((abs(a-x/m)>abs(b-y/m))?abs(a-x/m)*m:abs(b-y/m)*m);
    return 0;
}

110.天命数

#include<iostream>
using namespace std;
int main(){
	long long n,m,k,c;
	cin>>n>>m>>k;
	longlong a=max(n,m),b=min(n,m);
	if(k==1){
		c=a/b;
	}
	if(k==2){
		c=n+m;
	}
	if(k==3){
		c=((a/b)*(n+m)/a)%b;
	}
	if(c==0){
		cout<<"cangtianyisi,huangtiandangli";
	}else{
		cout<<c;
	}
	return 0;
}

111.分段函数

#include<iostream>
using namespace std;
int main(){
	longlong a;
	cin>>a;
	if(a<0){
		cout<<"-1";
	}elseif(a==0){
		cout<<"0";
	}else{
		cout<<"1";
	}
	cout<<"\n";
	return 0;
}

112.商场折扣

#include<iostream>
using namespace std;
int main(){
	double a;
	cin>>a;
	if(a<250){
		printf("%.2lf",a);
	}elseif(a<500){
		a=a*(1-0.05);
		printf("%.2lf",a);
	}elseif(a<1000){
		a=a*(1-0.1);
		printf("%.2lf",a);
	}elseif(a<2000){
		a=a*(1-0.15);
		printf("%.2lf",a);
	}else{
		a=a*(1-0.2);
		printf("%.2lf",a);
	}
	return 0;
}

113.成绩评定

#include<iostream>
using namespace std;
int main(){
	longlong a;
	cin>>a;
	if(a>=85){
		cout<<"A";
	}if(a>=60&&a<85){

		cout<<"P";
	}if(a<60){
		cout<<"E";
	}
	return 0;
}

114.求方程的解(简化版)

#include<bits/stdc++.h>
using namespace std;
int main(){
	double a,b,c,x1,x2;
	cin>>a>>b>>c;
	x1=(-b+sqrt(b*b-4*a*c))/(2*a);
	x2=(-b-sqrt(b*b-4*a*c))/(2*a);
	if(x1>x2){
		printf("%.2lf ",x1);
		printf("%.2lf",x2);
	}else{
		printf("%.2lf ",x2);
		printf("%.2lf",x1);
	}
	return 0;
}

115.求直角梯形最长对角线

#include<bits/stdc++.h>
using namespace std;
int main(){
	double a,b,c,x;
	cin>>a>>b>>c;
	if(a>b){
		x=sqrt(a*a+c*c);
		printf("%.1lf",x);
	}else{
		x=sqrt(b*b+c*c);
		printf("%.1lf",x);
	}
	return 0;
}

116.重组最大数

#include<bits/stdc++.h>
using namespace std;
int main(){
	longlong a,x,y,z,s=0;
	cin>>a;
	x=a%10;
	y=a/10%10;
	z=a/100%10;
	if(x>y){
		swap(x,y);
	}
	if(x>z){
		swap(x,z);
	}
	if(y>z){
		swap(y,z);
	}

	cout<<z<<y<<x;
	return 0;
}

117.求三角形面积

#include<bits/stdc++.h>
using namespace std;
int main(){
	double a,b,c,p,s;
	cin>>a>>b>>c;
	if(a+b<=c){
		cout<<"Can't";
		return0;
	}
	p=(a+b+c)/2;
	s=sqrt(p*(p-a)*(p-b)*(p-c));
	printf("%.2lf",s);
	return 0;
}

118.计算邮件收费

#include<bits/stdc++.h>
using namespace std;
int main(){
	double a,s;
	cin>>a;
	if(a<=1){
		s=1.5*a;
	}else{
		s=1.5+(a-1)*0.8;
	}
	printf("%.2lf",s);
	return 0;
}

119.称号

#include<bits/stdc++.h>
using namespace std;
int main(){
	longlong a;
	cin>>a;
	if(0<=a&&a<=2){
		cout<<"You are a Foolish Man.";
	}
	if(a==3){
		cout<<"You are on a Killing Spree.";
	}
	if(a==4){
		cout<<"You are Dominating.";
	}
	if(a==5){
		cout<<"You have a Mega-Kill.";
	}
	if(a==6){
		cout<<"You are Unstoppable.";
	}
	if(a==7){
		cout<<"You are Wicked Sick.";
	}
	if(a==8){
		cout<<"You have a M-m-m-m....Monster Kill.";
	}
	if(a==9){
		cout<<"You are Godlike.";
	}
	if(a>=10){
		cout<<"You are Beyond Godlike (Somebody kill him!).";
	}
	return 0;
}

120.有一门课不及格的学生

#include<bits/stdc++.h>
using namespace std;
int main(){
	longlong a,b,s=0;
	cin>>a>>b;
	if(a<60){
		s++;
	}
	if(b<60){
		s++;
	}
	if(s==1){
		cout<<1;
	}else{
		cout<<0;
	}
	return 0;
}