【入门2】分支结构

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

#include<iostream>
using namespace std;
int a,k[5],sum;
int main(){
	cin>>a;
	if(a>4&&a<=12) sum++;
	if(a%2==0) sum++;
	if(sum==2) k[1]=1;
	if(sum==1||sum==2) k[2]=1;
	if(sum==1) k[3]=1;
	if(sum==0) k[4]=1;
	for(int i=1;i<=4;i++)
		cout<<k[i]<<" ";
	return 0;
}

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

#include<iostream>
using namespace std;
int main()
{
    int n;
	cin>>n;
	cout<<((n%4==0&&n%100!=0)||(n%400==0))?1:0;
	return 0;
}

P5712 【深基3.例4】Apples

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

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

#include<iostream>
using namespace std;
int main(){
    int n;
	cin>>n;
	if(n*5<=n*3+11) cout<<"Local"<<endl;
    else cout<<"Luogu"<<endl;
	return 0;
}

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

#include<iostream>
using namespace std;
double m,h,bmi;
int main()
{
	cin>>m>>h;
	bmi=m/(h*h);
	if(bmi<18.5)
        cout<<"Underweight";
	if(bmi>=18.5&&bmi<24)
		cout<<"Normal";
	if(bmi>=24)
		cout<<bmi<<endl<<"Overweight";
	return 0;
}

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

#include<iostream>
#include<algorithm>
using namespace std;
int a[3];
int main()
{
    cin>>a[1]>>a[2]>>a[3];
    sort(a+1,a+4);
    cout<<a[1]<<' '<<a[2]<<' '<<a[3];
    return 0;
}

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

#include<iostream>
using namespace std;
int y,m;
int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int main()
{
    cin>>y>>m;
    if(y%4==0&&y%100!=0||y%400==0)
        a[2]=29;
    cout<<a[m];
    return 0;
}

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

#include<iostream>
using namespace std;
int main()
{
    int a,b,s,max=0,i,day=0;
    for(i=1;i<8;i++){
        cin>>a>>b;
        s=a+b;
        if(s>max&&s>8)
            max=s,day=i;
    }
    cout<<day;
    return 0;             
}

P1909 [NOIP2016 普及组] 买铅笔

#include<iostream>
using namespace std;
int main()
{
	int n,a1,a2,b1,b2,c1,c2,a,b,c,z;
	cin>>n;
	cin>>a1>>a2;
	cin>>b1>>b2;
	cin>>c1>>c2;
	a=n/a1;
	a1=n%a1==0?a:a+1;
	a=a1*a2;
	b=n/b1;
	b1=n%b1==0?b:b+1;
	b=b1*b2;
	c=n/c1;
	c1=n%c1==0?c:c+1;
	c=c1*c2;
	if(a<b&&a<c)
		z=a;
    if(b<a&&b<c)
		z=b;
    if(c<b&&c<a)
		z=c;
    cout<<z;
    return 0;
}

P1055 [NOIP2008 普及组] ISBN 号码

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	char s[14],c;
	cin>>s;
	int h=0,k=0;
	for(int i=0;i<11;i++)
	{
		if(s[i]!='-')
		{
			k++;
			h+=k*(s[i]-'0');
		}
	}
	h%=11;
	if(h==10) c='X';
	else c=h+'0';
	if(c==s[12]) cout<<"Right"<<endl;
	else
	{
		s[12]=c;
		cout<<s;
	}
	return 0;
}

P1422 小玉家的电费

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
    double n;
    cin>>n;
    if(n<=150)
        cout<<fixed<<setprecision(1)<<n*0.4463<<endl;
    else if(n>=151&&n<=400)
        cout<<fixed<<setprecision(1)<<150*0.4463+(n-150)*0.4663<<endl;
    else
        cout<<setprecision(1)<<fixed<<150*0.4463+250*0.4663+(n-400)*0.5663<<endl;
    return 0;
}

P1424 小鱼的航程(改进版)

#include<iostream>
using namespace std;
int main()
{
    int n,k,sum=0;
    cin>>n>>k;
    for(int i=1;i<=k;i++){
        if(n!=6&&n!=7)
			sum+=250;
        if(n==7)
			n=1;
        else
			n++;
    }
    cout<<sum;
    return 0;
}

P1888 三角函数

#include<iostream>      
using namespace std;  
long long maxn,minn;  
long long gcd(long long,long long);  
int main()
{  
	long long a,b,c;  
	cin>>a>>b>>c;
	minn=a;
	if(b<minn) minn=b;  
	if(c<minn) minn=c;
	maxn=a; 
	if(b>maxn) maxn=b;
	if(c>maxn) maxn=c;
	cout<<gcd(minn,maxn)<<"/"<<gcd(maxn,minn);
	return 0;
}

long long gcd(long long a,long long b)
{
	int yue;
	for(int i=a;i>=1;i--){
		if(a%i==0 && b%i==0){
			yue=i;
			break;
		}
	}
	return a/yue; 
}

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

#include<iostream>
using namespace std;
int main()
{
	int m,i,cnt=0;
	int a[10];
    for(i=0;i<10;i++)
    {
    	cin>>a[i];
	}
	cin>>m;
	for(i=0;i<10;i++)
    {
    	if(m+30 >= a[i])
    	{
    		cnt+=1;
		}
	}
	cout<<cnt<<endl;
	return 0;
}

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

#include<iostream>
#include<algorithm>
using namespace std;
int a,b,c;
int main()
{
	cin>>a>>b>>c;
	int d[4]={0,a,b,c};
	sort(d+1,d+4);
	if(d[1]+d[2]<=d[3]){
		cout<<"Not triangle"<<endl;
		return 0;
	}
	if(d[1]*d[1]+d[2]*d[2]==d[3]*d[3])
        cout<<"Right triangle"<<endl;
	else if(d[1]*d[1]+d[2]*d[2]>d[3]*d[3])
        cout<<"Acute triangle"<<endl;
	else if(d[1]*d[1]+d[2]*d[2]<d[3]*d[3])   
        cout<<"Obtuse triangle"<<endl;
	if(a==b||b==c||a==c)
        cout<<"Isosceles triangle"<<endl;
	if(a== b&&b==c)
        cout<<"Equilateral triangle"<<endl;
	return 0;
}

P4414 [COCI2006-2007#2] ABC

#include<iostream>
#include<algorithm>
using namespace std;
int a[3];
char A,B,C;
int main()
{
    cin>>a[0]>>a[1]>>a[2];
    cin>>A>>B>>C;
    sort(a,a+3);
    cout<<a[A-'A']<<" "<<a[B-'A']<<" "<<a[C-'A'];
    return 0;
}

理解为主