西邮杯初赛c++题解

这里写图片描述

#include<iostream>
using namespace std; 
int main(){
    unsigned Groups,InitialSum,FinalResult,Leftmultiply,Rightmultiply,tempsum,tempcount,addedge;
    bool haveresult;
    cin>>Groups;
    while(Groups--)
    {
        cin>>InitialSum>>FinalResult;
        for(tempsum=0,tempcount=1;tempsum<InitialSum;tempcount++)
        {
            tempsum+=tempcount;
        }
        addedge=--tempcount;
        haveresult=false;
        if(tempsum==InitialSum){//123456
            for(Leftmultiply=2;Leftmultiply!=addedge-1;Leftmultiply++){
                for(Rightmultiply=Leftmultiply+2;Rightmultiply<=addedge;Rightmultiply++){
                    for(tempcount=1,tempsum=0;tempcount<=addedge;tempcount++){
                        if((tempcount==Leftmultiply-1)||(tempcount==Rightmultiply-1))tempsum+=(tempcount)*(tempcount+1);
                        else if((tempcount==Leftmultiply)||(tempcount==Rightmultiply))continue;
                        else tempsum+=tempcount;
                    }
                    if(tempsum==FinalResult){
                        haveresult=true;
                        cout<<"("<<Leftmultiply-1<<","<<Rightmultiply-1<<")";
                    }
                }
            }
            cout<<endl;
        }
        else cout<<"NONE"<<endl;
    } 
    return 0;
}

这里写图片描述

#include<iostream>
using namespace std;
int main(){
    unsigned nutforeachgroup=0,agroupnum,bgroupnum,cgroupnum;
    cin>>agroupnum>>bgroupnum>>cgroupnum;
    while(++nutforeachgroup){
        if(nutforeachgroup%agroupnum==0&&nutforeachgroup%bgroupnum==0&&nutforeachgroup%cgroupnum==0)break;
    }
    cout<<nutforeachgroup<<endl;
    return 0;
}

这里写图片描述

#include<iostream>
#include<string>
using namespace std; 
bool invert(string &CoinsArray,string::size_type index)
{
    if(CoinsArray[index]=='*')CoinsArray[index]='o';
    else CoinsArray[index]='*';

    if(CoinsArray[index+1]=='*')CoinsArray[index+1]='o';
    else CoinsArray[index+1]='*';
    return true;
} 
int main(){
    unsigned stepCount=0;
    string::size_type index;
    string current,final;
    cin>>current>>final;
    while(current!=final){
        for(index = 0;index!=current.size()-1;index++){
            if(current[index]!=final[index]){
                invert(current,index);
                stepCount+=1;
                break;
            }
        }
    }
    cout<<stepCount<<endl;
    return 0;
}

这里写图片描述
暂时不会

这里写图片描述

#include<iostream>
#include<iomanip>
using namespace std;
enum WeekDay{
    Monday = 1,
    Tuesday,
    Wednesday,
    Thursday,
    Friday,
    Saturday,
    Sunday, 
};
struct Date{
    Date();
    unsigned year;
    unsigned month;
    unsigned day;
    WeekDay weekday;
};
Date::Date()
{
    year=1900;
    month=1;
    day=1;
    weekday=Monday;
}
int main(){
    Date Today,Aimday;
    unsigned Groups,PassDays;
    char dash;
    cin>>Groups;
    while(Groups--)
    {
        Date Origin;
        cin>>Today.year>>dash>>Today.month>>dash>>Today.day>>PassDays;
        while(Origin.year!=Today.year||Origin.month!=Today.month||Origin.day!=Today.day){
            Origin.day++;
            switch(Origin.weekday){
                case Monday:Origin.weekday=Tuesday;break;
                case Tuesday:Origin.weekday=Wednesday;break;
                case Wednesday:Origin.weekday=Thursday;break;
                case Thursday:Origin.weekday=Friday;break;
                case Friday:Origin.weekday=Saturday;break;
                case Saturday:Origin.weekday=Sunday;break;
                case Sunday:Origin.weekday=Monday;break;
            }
            switch(Origin.month){
                case 1:
                case 3:
                case 5:
                case 7:
                case 8:
                case 10:
                case 12:
                    {
                        if(Origin.day>31)
                        {
                            Origin.day%=31;
                            Origin.month++;
                        }
                        break;
                    }
                case 4:
                case 6:
                case 9:
                case 11:
                    {
                        if(Origin.day>30)
                        {
                            Origin.day%=30;
                            Origin.month++;
                        }
                        break;
                    }
                case 2:
                    {
                        if((Origin.year%400==0)||(Origin.year%4==0&&Origin.year%100!=0))
                        {
                            if(Origin.day>29)
                            {
                                Origin.day%=29;
                                Origin.month++;
                            }
                        }
                        else
                        {
                            if(Origin.day>28)
                            {
                                Origin.day%=28;
                                Origin.month++;
                            }
                        }
                        break;
                    }
            }
            if(Origin.month>12)
            {
                Origin.month%=12;
                Origin.year++; 
            } 
        }
        Today.weekday=Origin.weekday;
        Aimday=Today;
        while(PassDays--)
        {

            Aimday.day++;
            switch(Aimday.weekday){
                case Monday:Aimday.weekday=Tuesday;break;
                case Tuesday:Aimday.weekday=Wednesday;break;
                case Wednesday:Aimday.weekday=Thursday;break;
                case Thursday:Aimday.weekday=Friday;break;
                case Friday:Aimday.weekday=Saturday;break;
                case Saturday:Aimday.weekday=Sunday;break;
                case Sunday:Aimday.weekday=Monday;break;
            }
            switch(Aimday.month){
                case 1:
                case 3:
                case 5:
                case 7:
                case 8:
                case 10:
                case 12:
                    {
                        if(Aimday.day>31)
                        {
                            Aimday.day%=31;
                            Aimday.month++;
                        }
                        break;
                    }
                case 4:
                case 6:
                case 9:
                case 11:
                    {
                        if(Aimday.day>30)
                        {
                            Aimday.day%=30;
                            Aimday.month++;
                        }
                        break;
                    }
                case 2:
                    {
                        if((Aimday.year%400==0)||(Aimday.year%4==0&&Aimday.year%100!=0))
                        {
                            if(Aimday.day>29)
                            {
                                Aimday.day%=29;
                                Aimday.month++;
                            }
                        }
                        else
                        {
                            if(Aimday.day>28)
                            {
                                Aimday.day%=28;
                                Aimday.month++;
                            }
                        }
                        break;
                    }
            }
            if(Aimday.month>12)
            {
                Aimday.month%=12;
                Aimday.year++; 
            } 
        }
        cout<<Aimday.year<<"年"<<setw(2)<<setfill('0')<<Aimday.month<<"月"<<setw(2)<<Aimday.day<<"日"<<" ";
        switch(Aimday.weekday){
            case Monday:cout<<"星期一";break;
            case Tuesday:cout<<"星期二";break;
            case Wednesday:cout<<"星期三";break;
            case Thursday:cout<<"星期四";break;
            case Friday:cout<<"星期五";break;
            case Saturday:cout<<"星期六";break;
            case Sunday:cout<<"星期日";break;
        }
        cout<<endl;
    } 
    return 0;
}

这里写图片描述

#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
using namespace std;
int main(){
    unsigned Groups,bitsum,bitminus,index;
    cin>>Groups;
    string a,b,add,minus,buffer;
    vector<string> addition,subtractions;
    while(Groups--)
    {
        cin>>a>>b;
        string space;
        string::size_type length=a.size()-b.size();
        for(string::size_type i = 0;i<=length+1;i++)space.push_back('0');//根据两个string的长度差,补一定数目的零 
        space.append(b);
        b=space;
        space="00";//前面补2个零保证运算过程边界正确 
        space.append(a);
        a=space;

        add=a;//加法运算 
        bitsum=static_cast<unsigned>(add[add.size()-1]+b[add.size()-1])-96;
        for(string::size_type i = add.size()-1;i!=0;i--)
        {
            add[i]=static_cast<char>(bitsum%10+48);
            bitsum=bitsum/10+static_cast<unsigned>(add[i-1]+b[i-1])-96;
        }
        buffer.clear();
        index=0;
        while(add[index]=='0')index++;
        if(index>=add.size())buffer="0";
        while(index<add.size())
        {
            buffer.push_back(add[index]);
            index++;
        }

        addition.push_back(buffer);//结果存进vector 

        minus=a;
        for(string::size_type i = minus.size()-1;i!=1;i--)
        {
            if(minus[i]>=b[i])
            {
                minus[i]=static_cast<char>(minus[i]-b[i]+48);

            }
            else
            {
                length=1;
                while(minus[i-length]=='0')
                {
                    minus[i-length]='9';
                    length++;
                }
                minus[i-length]-=1;
                minus[i]=static_cast<char>(minus[i]+10-b[i]+48);
            }
        }
        buffer.clear();
        index=0;
        while(minus[index]=='0')index++;
        if(index>=minus.size())buffer="0";
        while(index<minus.size())
        {
            buffer.push_back(minus[index]);
            index++;
        }
        //if(index>minus.size())buffer="0";
        subtractions.push_back(buffer);
    }
    for(vector<string>::iterator i = addition.begin();i!=addition.end();i++)cout<<*i<<endl;
    for(vector<string>::iterator i = subtractions.begin();i!=subtractions.end();i++)cout<<*i<<endl;
    return 0;
}

oj把比赛关了…

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值