c++洛谷刷题（入门2）

洛谷c++刷题（入门2）

P5710 【深基3.例2】数的性质

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a;
	cin>>a;
	if(a%2==0&&a>4&&a<=12)
	cout<<1<<" "<<1<<" "<<0<<" "<<0;
	if(a%2==0&&(a<=4||a>12))
	cout<<0<<" "<<1<<" "<<1<<" "<<0;
	if(a%2!=0&&a>4&&a<=12)
	cout<<0<<" "<<1<<" "<<1<<" "<<0;
	if(a%2!=0&&(a<=4||a>12))
	cout<<0<<" "<<0<<" "<<0<<" "<<1;
	return 0;
	
} 

P5711 【深基3.例3】闰年判断

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a;
	cin>>a;
	if(a%4!=0)
	cout<<0;
	else if(a%4==0&&a%100!=0)
	cout<<1;
	else if(a%4==0&&a%100==0&&a%400!=0)
	cout<<0;
	else if(a%400==0)
	cout<<1;
	return 0; 
}

P5712 【深基3.例4】Apples

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a;
	cin>>a;
	if(a==0)
	{cout<<"Today, I ate 0 apple.";}
	if(a==1)
	cout<<"Today, I ate 1 apple.";
	else if(a!=0&&a!=1) cout<<"Today, I ate "<<a<<" apples.";
	return 0;
}

P5713 【深基3.例5】洛谷团队系统

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	int a=5*n,b=11+3*n;
	if(a<b) cout<<"Local";
	else cout<<"Luogu";
	return 0;
}

P5714 【深基3.例7】肥胖问题

#include<bits/stdc++.h>
using namespace std;
int main(){
	double m,h,bmi;
	cin>>m>>h;
	bmi=m/(h*h);
	if(bmi<18.5)
	cout<<"Underweight"<<endl;
	if(bmi>=18.5&&bmi<24)
	cout<<"Normal"<<endl;
	if(bmi>=24)
	cout<<bmi<<'\n'<<"Overweight"<<endl;// 用了cout的默认输出，即为六位有效数字。
	return 0;
}

P5715 【深基3.例8】三位数排序

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c;
	cin>>a>>b>>c;
	if(a>=b&&b>=c) cout<<c<<" "<<b<<" "<<a;
	else if(a>=b&&c>=a) cout<<b<<" "<<a<<" "<<c;
	else if(b>=a&&a>=c) cout<<c<<" "<<a<<" "<<b;
	else if(b<=c&&c<=a) cout<<b<<" "<<c<<" "<<a;
	else if(a<=b&&b<=c) cout<<a<<" "<<b<<" "<<c;
	else if(a<=c&&c<=b) cout<<a<<" "<<c<<" "<<b;
	return 0;
}//这种方法繁琐但是比较直接，还有用数组快速排序的方法。

P5716 【深基3.例9】月份天数

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c;//用C来判断是不是闰年。
	cin>>a>>b;
	if(a%4!=0)
	c=0;
	else if(a%4==0&&a%100!=0)
	c=1;
	else if(a%4==0&&a%100==0&&a%400!=0)
	c=0;
	else if(a%400==0)
	c=1;
	if(b==1||b==3||b==5||b==7||b==8||b==10||b==12)
	cout<<31;
	else if(b==4||b==6||b==9||b==11)
	cout<<30;
	else if(c==1&&b==2) cout<<29;
	else if(c==0&&b==2) cout<<28;
	return 0;
}

P1085 [NOIP2004 普及组] 不高兴的津津

#include<bits/stdc++.h>
using namespace std;
int main(){
{int a,b,max,t;
 for(int i=1;i<=7;i++)//循环结构。
   {cin>>a>>b;
    if(max<(a+b)&&(a+b)>8) {max=a+b;t=i;}
    else continue;
   }
 cout<<t;
 return 0;
}}

P1909 [NOIP2016 普及组] 买铅笔

#include<bits/stdc++.h>
using namespace std;
int main(){
	long n,m,p,q,h;
	long a,b,c,d,e,f;
	cin>>n;
	cin>>a>>b;
	cin>>c>>d;
	cin>>e>>f;
	if(n%a==0) m=n/a*b;
	else if(n%a!=0) m=(n/a+1)*b;
	if(n%c==0) p=n/c*d;
	else if(n%c!=0) p=(n/c+1)*d;
	if(n%e==0) q=n/e*f;
	else if(n%e!=0) q=(n/e+1)*f;
	if(m<=p&&p<=q) cout<<m;
	if(m<=q&&q<=p) cout<<m;
	if(p<=m&&m<=q) cout<<p;
	if(p<=q&&q<=m) cout<<p;
	if(q<=p&&p<=m) cout<<q;
	if(q<=m&&m<=p) cout<<q;
	return 0;
}

P1055 [NOIP2008 普及组] ISBN 号码

#include<bits/stdc++.h>
using namespace std;
int main()
{
	char a[14];
	char n;
	cin>>a;
	int b=0,c=0;
	for(int i=0;i<11;i++)
	{
		if(a[i]!='-')
		{
			c++;
			b+=c*(a[i]-'0');
		}
	}
	b%=11;
	if(b==10) n='X';
	else n=b+'0';
	if(n==a[12]) cout<<"Right";
	else
	{
		a[12]=n; cout<<a;
	}
	return 0;
}

P1422 小玉家的电费

#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
int main(){
	int a;
	cin>>a;
	double m;
	if(a<=150)  m=0.4463*a;
	else if(a>=151&&a<=400) m=150*0.4463+(a-150)*0.4663;
	else if(a>=401) m=150*0.4463+250*0.4663+(a-400)*0.5663;
	cout<<fixed<<setprecision(1)<<m;
	return 0;
}

P1424 小鱼的航程(改进版)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a,b,i,sum=0;
    cin>>a>>b;
    for (i=a;i<=a+b-1;++i){
        if (i%7==6 || i%7==0)
        {continue;}
        sum=sum+250; }
    cout<<sum;
    return 0;
}

P1888 三角函数

#include<bits/stdc++.h>    
using namespace std;
int main()
{
    int a[4];    
    for (int i=0;i<3;i++)     
    {cin>>a[i];}
    sort(a,a+3);   
    cout<<a[0]/__gcd(a[0],a[2])<<'/'<<a[2]/__gcd(a[0],a[2])<<endl;
    return 0;
}

P1046 [NOIP2005 普及组] 陶陶摘苹果

#include <iostream>
using namespace std;
int a[20],H,m;
int main()
{
    for(int i=0;i<10;i++)cin>>a[i];
    cin>>H;
    H = H+30;
    for(int i=0;i<10;i++)m+=!(H<a[i]);
    cout<<m;
}

P5717 【深基3.习8】三角形分类

#include<bits/stdc++.h>
using namespace std;
int main() {
	int a[4],n=3,i;
	for(i=1; i<=3; ++i)
	{cin>>a[i];}
	sort(a+1,a+n+1);
	if(a[1]+a[2]<=a[3])
	{cout<<"Not triangle\n";return 0;}
	if(a[3]*a[3]==(a[2]*a[2]+a[1]*a[1])) cout<<"Right triangle\n";
	else if(a[3]*a[3]<(a[2]*a[2]+a[1]*a[1])) cout<<"Acute triangle\n";
	else if(a[3]*a[3]>(a[2]*a[2]+a[1]*a[1])) cout<<"Obtuse triangle\n";
	if(a[1]==a[2]||a[2]==a[3]||a[3]==a[1])  cout<<"Isosceles triangle\n";
	if(a[1]==a[2]&&a[2]==a[3]) cout<<"Equilateral triangle\n";
	return 0;
}

P4414 [COCI2006-2007#2] ABC

#include<bits/stdc++.h>
using namespace std;
int a,b,c;
int x,y,z,s;
char ch;
int main()
{
	cin>>x>>y>>z;
	s=x+y+z;
	a=min(min(x,y),z);
	c=max(max(x,y),z);
	b=s-a-c;
	for(int i=0;i<3;++i)
	{
		cin>>ch;
		if(ch=='A') cout<<a<<' ';
		if(ch=='B') cout<<b<<' ';
		if(ch=='C') cout<<c<<' ';
	}
	return 0;
}