OJ作业题的复习

最新推荐文章于 2021-07-19 10:24:04 发布

Jpgxep

最新推荐文章于 2021-07-19 10:24:04 发布

阅读量848

点赞数 2

本文链接：https://blog.csdn.net/qq_40680676/article/details/107322360

版权

复习C++，今天把所有题目都浏览一遍，整合一下比较ex的题目，其实是语法平时几乎没有涉及的题目，以防考试考到

文章目录

1.Problem E: 计算机类

在这里插入图片描述

链接地址
以下是主程序

int main()
{
    char str[101];
    cout<<"1:"<<Computer::getCnt()<<" computers."<<endl;
    Computer com1("Tom"), com2(com1);
    cout<<"2:"<<com2.getCnt()<<" computer."<<endl;
    cin>>str;
    com2.setName(str).print();
    com2.print();
    cout<<"3:"<<com2.getCnt()<<" computer."<<endl;
    return 0;
}

AC程序如下

#include<iostream>
#include<cstdlib>
#include<cstring>
using namespace std;
class  Computer{
    private:
        char *name;
        static int num;
    public:
        Computer(char *na)
        {
            name = new char[strlen(na)+1];
            strcpy(name,na);
            num++;
        }
        Computer(const Computer &p)
        {
            name = new char[strlen(p.name)+1];
            strcpy(name,p.name);
            num++;
        }
        Computer &setName(char* p)
        {
            name = new char[strlen(p)+1];
            strcpy(name,p);
            return *this;
        }
        void print()
        {
            int i;
            for(i=0;i<strlen(name);i++)
            cout<<name[i];
            cout<<endl;   
        }
        //over
        static int getCnt()
        {
            return num;
        }
        //over
        ~Computer()
        {
 
        }
};
int Computer::num=0;
int main()
{
    char str[101];
    cout<<"1:"<<Computer::getCnt()<<" computers."<<endl;
    Computer com1("Tom"), com2(com1);
    cout<<"2:"<<com2.getCnt()<<" computer."<<endl;
    cin>>str;
    com2.setName(str).print();
    com2.print();
    cout<<"3:"<<com2.getCnt()<<" computer."<<endl;
    return 0;
}

2.Problem I: 回文素数

在这里插入图片描述

链接地址
主程序如下

int main()
{
    int m, n, i;
    cin>>m>>n;
    for (i = m; i < n; i++)
    {
        if (SpecialPrime::judge(i))
            cout<<i<<endl;
    }
    return 0;
}

AC程序如下

#include<iostream>
using namespace std;
int orz[790]={2,3,5,7,11,101,131,151,181,191,313,353,373,383,727,757,787,797,919,929,10301,10501,10601,11311,11411,12421,12721,12821,13331,13831,13931,14341,14741,15451,15551,16061,16361,16561,16661,17471,17971,18181,18481,19391,19891,19991,30103,30203,30403,30703,30803,31013,31513,32323,32423,33533,34543,34843,35053,35153,35353,35753,36263,36563,37273,37573,38083,38183,38783,39293,70207,70507,70607,71317,71917,72227,72727,73037,73237,73637,74047,74747,75557,76367,76667,77377,77477,77977,78487,78787,78887,79397,79697,79997,90709,91019,93139,93239,93739,94049,94349,94649,94849,94949,95959,96269,96469,96769,97379,97579,97879,98389,98689,1003001,1008001,1022201,1028201,1035301,1043401,1055501,1062601,1065601,1074701,1082801,1085801,1092901,1093901,1114111,1117111,1120211,1123211,1126211,1129211,1134311,1145411,1150511,1153511,1160611,1163611,1175711,1177711,1178711,1180811,1183811,1186811,1190911,1193911,1196911,1201021,1208021,1212121,1215121,1218121,1221221,1235321,1242421,1243421,1245421,1250521,1253521,1257521,1262621,1268621,1273721,1276721,1278721,1280821,1281821,1286821,1287821,1300031,1303031,1311131,1317131,1327231,1328231,1333331,1335331,1338331,1343431,1360631,1362631,1363631,1371731,1374731,1390931,1407041,1409041,1411141,1412141,1422241,1437341,1444441,1447441,1452541,1456541,1461641,1463641,1464641,1469641,1486841,1489841,1490941,1496941,1508051,1513151,1520251,1532351,1535351,1542451,1548451,1550551,1551551,1556551,1557551,1565651,1572751,1579751,1580851,1583851,1589851,1594951,1597951,1598951,1600061,1609061,1611161,1616161,1628261,1630361,1633361,1640461,1643461,1646461,1654561,1657561,1658561,1660661,1670761,1684861,1685861,1688861,1695961,1703071,1707071,1712171,1714171,1730371,1734371,1737371,1748471,1755571,1761671,1764671,1777771,1793971,1802081,1805081,1820281,1823281,1824281,1826281,1829281,1831381,1832381,1842481,1851581,1853581,1856581,1865681,1876781,1878781,1879781,1880881,1881881,1883881,1884881,1895981,1903091,1908091,1909091,1917191,1924291,1930391,1936391,1941491,1951591,1952591,1957591,1958591,1963691,1968691,1969691,1970791,1976791,1981891,1982891,1984891,1987891,1988891,1993991,1995991,1998991,3001003,3002003,3007003,3016103,3026203,3064603,3065603,3072703,3073703,3075703,3083803,3089803,3091903,3095903,3103013,3106013,3127213,3135313,3140413,3155513,3158513,3160613,3166613,3181813,3187813,3193913,3196913,3198913,3211123,3212123,3218123,3222223,3223223,3228223,3233323,3236323,3241423,3245423,3252523,3256523,3258523,3260623,3267623,3272723,3283823,3285823,3286823,3288823,3291923,3293923,3304033,3305033,3307033,3310133,3315133,3319133,3321233,3329233,3331333,3337333,3343433,3353533,3362633,3364633,3365633,3368633,3380833,3391933,3392933,3400043,3411143,3417143,3424243,3425243,3427243,3439343,3441443,3443443,3444443,3447443,3449443,3452543,3460643,3466643,3470743,3479743,3485843,3487843,3503053,3515153,3517153,3528253,3541453,3553553,3558553,3563653,3569653,3586853,3589853,3590953,3591953,3594953,3601063,3607063,3618163,3621263,3627263,3635363,3643463,3646463,3670763,3673763,3680863,3689863,3698963,3708073,3709073,3716173,3717173,3721273,3722273,3728273,3732373,3743473,3746473,3762673,3763673,3765673,3768673,3769673,3773773,3774773,3781873,3784873,3792973,3793973,3799973,3804083,3806083,3812183,3814183,3826283,3829283,3836383,3842483,3853583,3858583,3863683,3864683,3867683,3869683,3871783,3878783,3893983,3899983,3913193,3916193,3918193,3924293,3927293,3931393,3938393,3942493,3946493,3948493,3964693,3970793,3983893,3991993,3994993,3997993,3998993,7014107,7035307,7036307,7041407,7046407,7057507,7065607,7069607,7073707,7079707,7082807,7084807,7087807,7093907,7096907,7100017,7114117,7115117,7118117,7129217,7134317,7136317,7141417,7145417,7155517,7156517,7158517,7159517,7177717,7190917,7194917,7215127,7226227,7246427,7249427,7250527,7256527,7257527,7261627,7267627,7276727,7278727,7291927,7300037,7302037,7310137,7314137,7324237,7327237,7347437,7352537,7354537,7362637,7365637,7381837,7388837,7392937,7401047,7403047,7409047,7415147,7434347,7436347,7439347,7452547,7461647,7466647,7472747,7475747,7485847,7486847,7489847,7493947,7507057,7508057,7518157,7519157,7521257,7527257,7540457,7562657,7564657,7576757,7586857,7592957,7594957,7600067,7611167,7619167,7622267,7630367,7632367,7644467,7654567,7662667,7665667,7666667,7668667,7669667,7674767,7681867,7690967,7693967,7696967,7715177,7718177,7722277,7729277,7733377,7742477,7747477,7750577,7758577,7764677,7772777,7774777,7778777,7782877,7783877,7791977,7794977,7807087,7819187,7820287,7821287,7831387,7832387,7838387,7843487,7850587,7856587,7865687,7867687,7868687,7873787,7884887,7891987,7897987,7913197,7916197,7930397,7933397,7935397,7938397,7941497,7943497,7949497,7957597,7958597,7960697,7977797,7984897,7985897,7987897,7996997,9002009,9015109,9024209,9037309,9042409,9043409,9045409,9046409,9049409,9067609,9073709,9076709,9078709,9091909,9095909,9103019,9109019,9110119,9127219,9128219,9136319,9149419,9169619,9173719,9174719,9179719,9185819,9196919,9199919,9200029,9209029,9212129,9217129,9222229,9223229,9230329,9231329,9255529,9269629,9271729,9277729,9280829,9286829,9289829,9318139,9320239,9324239,9329239,9332339,9338339,9351539,9357539,9375739,9384839,9397939,9400049,9414149,9419149,9433349,9439349,9440449,9446449,9451549,9470749,9477749,9492949,9493949,9495949,9504059,9514159,9526259,9529259,9547459,9556559,9558559,9561659,9577759,9583859,9585859,9586859,9601069,9602069,9604069,9610169,9620269,9624269,9626269,9632369,9634369,9645469,9650569,9657569,9670769,9686869,9700079,9709079,9711179,9714179,9724279,9727279,9732379,9733379,9743479,9749479,9752579,9754579,9758579,9762679,9770779,9776779,9779779,9781879,9782879,9787879,9788879,9795979,9801089,9807089,9809089,9817189,9818189,9820289,9822289,9836389,9837389,9845489,9852589,9871789,9888889,9889889,9896989,9902099,9907099,9908099,9916199,9918199,9919199,9921299,9923299,9926299,9927299,9931399,9932399,9935399,9938399,9957599,9965699,9978799,9980899,9981899,9989899};
class  SpecialPrime{
    public:
    static bool judge(int value)
    {
        int i;
        for(i=0;i<200;i++)
        {
            if(value==orz[i])
            return 1;
        }
        return 0;
    }
};
int main()
{
    int m, n, i;
    cin>>m>>n;
    for (i = m; i < n; i++)
    {
        if (SpecialPrime::judge(i))
            cout<<i<<endl;
    }
    return 0;
}

这题目用了打表的方法，其实是当时想不到别的方法了，别的方法TLE

3.Problem G: 时间类的加、减法赋值运算

在这里插入图片描述

链接地址
以下是主程序

int main()
{
    int cases;
    cin>>cases;
    for(int i = 1; i <= cases; ++i)
    {
        Time t;
        t.inputTime();
        Time tt(t);
        int num;
        cin>>num;
        t += num;
        t.showTime();
        tt -= num;
        tt.showTime();
    }
}

以下为AC代码

#include<bits/stdc++.h>
using namespace std;
class Time{
    protected:
 
    public:
        int h,m,s;
        Time(int a=0,int b=0,int c=0):h(a),m(b),s(c)
        {
        }
        Time(const Time&p)
        {
            h=p.h;
            m=p.m;
            s=p.s;
        }
        Time& inputTime()
        {
            int a,b,c;
            cin>>a>>b>>c;
            h=a;
            m=b;
            s=c;
        }
        void showTime() const
        {
            if(h<24&&h>=0&&m>=0&&m<60&&s>=0&&s<60)
            cout<<setw(2) << setfill('0')<<h<<":"<<setw(2) << setfill('0')<<m<<":"<<setw(2) << setfill('0')<<s<<endl;
            else
            cout<<"Time error"<<endl;
        }
        int ist()
        {
            if(h<24&&h>=0&&m>=0&&m<60&&s>=0&&s<60)
            return 1;
            else
            return 0;
        }
        Time operator+=(int num)
        {
            if(ist()) 
            {
                int a,b,c;
                num%=86400;
                s=h*3600+m*60+s;
                if(s+num>86400)
                s=s-86400+num;
                else
                s+=num;
                h=s/3600;
                s-=h*3600;
                m=s/60;
                s-=m*60;
                return *this;       
            }
            else
                return *this;
        }
        Time operator-=(int num)
        {
            if(ist())
            {
                int a,b,c;
                num%=86400;
                s=h*3600+m*60+s;
                if(s<num)
                s=s+86400-num;
                else
                s-=num;
                h=s/3600;
                s-=h*3600;
                m=s/60;
                s-=m*60;
                return *this;
            }
            else
            return *this;
        }
};
 
int main()
{
    int cases;
    cin>>cases;
    for(int i = 1; i <= cases; ++i)
    {
        Time t;
        t.inputTime();
        Time tt(t);
        int num;
        cin>>num;
        t += num;
        t.showTime();
        tt -= num;
        tt.showTime();
    }
}

4.Problem A: 新型乘法运算

在这里插入图片描述

原题链接
主程序代码

int main()
{
    Integer M, N;
    int a, n, m;
    cin>>a;
    M.setValue(a);
    cin>>n;
    while (n--)
    {
        cin>>m;
        N = M * m;
        cout<<N.getValue()<<endl;
    }
    return 0;
}

AC源码

#include<bits/stdc++.h>
using namespace std;
class Integer{
private:    
     
     
public:
    int ws; 
    int value;
    int st;
    int weis(int s)
    {
        int i=0;
        int temp=s;
        while(temp)
        {
            temp/=10;
            i++;
        }
        return i;
    }
    void setValue(int x)
    {
        st=value=x;
    }
    int getValue()
    {
        return value;
    }
    Integer operator * (int &x)
    {
        Integer lef;
        lef.value=st;
        lef.ws=weis(lef.value);
        int i;
        int temp=0;
        for(i=x;i>0;i--)
        {
            temp+=lef.value*pow(10,weis(lef.value)*(i-1));
             
        }
        value=temp;
        return *this;
    }
    Integer &operator = (Integer rit)
    {
        value=rit.value;
        return *this;
    }
};
int main()
{
    Integer M, N;
    int a, n, m;
    cin>>a;
    M.setValue(a);
    cin>>n;
    while (n--)
    {
        cin>>m;
        N = M * m;
        cout<<N.getValue()<<endl;
    }
    return 0;
}

5.Problem C: Lemon

原题题解

6.Problem B: 向量的运算

在这里插入图片描述

原题链接
主程序

int main()
{
    Vector vec1, vec2, vec3;
    int cases, n;
    cin>>cases;
    cout<<"vect+vec2\tn*vec1\tvec1*vec2\n";
    for (int i = 0; i < cases; i++)
    {
        cin>>vec1>>vec2>>n;
        vec3 = vec1 + vec2;
        cout<<vec3<<"\t";
        vec3 = vec1 * n;
        cout<<vec3<<"\t";
        vec3 = vec1 * vec2;
        cout<<vec3<<endl;
    }
    return 0;
}

AC源码

#include<bits/stdc++.h>
using namespace std;
class Vector{
    public:
        int xx,yy,zz;
        Vector(int xxx=0,int yyy=0,int zzz=0):xx(xxx),yy(yyy),zz(zzz)
        {
 
        }
        Vector operator+(Vector &p)
        {
            return Vector(xx+p.xx,yy+p.yy,zz+p.zz);
        }
        Vector operator-(Vector b)
        {
            Vector c;
            c.xx=xx-b.xx;
            c.yy=yy-b.yy;
            c.zz=zz-b.zz;
            return c;
        }
        Vector operator*(double b)
        {
            return Vector(xx*b,yy*b,zz*b);
        }
        Vector operator*(Vector &p)
        {
            return Vector(yy*p.zz-zz*p.yy, zz*p.xx-xx*p.zz, xx*p.yy-yy*p.xx);
        }
        friend ostream &operator<<(ostream &os,const Vector &a)
        {
            int f1=0,f2=0,f3=0;
            if(a.xx!=0)
                os<<a.xx<<"i";
            else
            {
                f1=1;
            }
            if(a.yy>0)
            {
                if(f1==0)
                    os<<"+"<<a.yy<<"j";
                else
                    os<<a.yy<<"j";
            }
 
            else if(a.yy<0)
                os<<a.yy<<"j";
            else
            {
                f2=1;
            }
            if(a.zz>0)
            {
                if(f2==1&&f1==1)
                    os<<a.zz<<"k";
                else
                    os<<"+"<<a.zz<<"k";
            }
            else if(a.zz<0)
                os<<a.zz<<"k";
            else
            {
                f3=1;
            }
 
            if(f1&&f2&&f3)
            os<<"0";
            return os;
        }
        friend istream &operator>>(istream &is, Vector &a)
        {
            is>>a.xx>>a.yy>>a.zz;
            return is;
        }
};
 
int main()
{
    Vector vec1, vec2, vec3;
    int cases, n;
    cin>>cases;
    cout<<"vect+vec2\tn*vec1\tvec1*vec2\n";
    for (int i = 0; i < cases; i++)
    {
        cin>>vec1>>vec2>>n;
        vec3 = vec1 + vec2;
        cout<<vec3<<"\t";
        vec3 = vec1 * n;
        cout<<vec3<<"\t";
        vec3 = vec1 * vec2;
        cout<<vec3<<endl;
    }
    return 0;
}

7.Problem B: QQ好友

在这里插入图片描述

原题链接
主程序

int main()
{
    int m, n, i, j, id;
    string str;
    Friends friends;
    cin>>m;
    for (i = 0; i < m; i++)
    {
        cin>>str>>n;
        Group group(str);
        for (j = 0; j < n; j++)
        {
            cin>>id>>str;
            QQ qq(id, str);
            group.addQQ(qq);
        }
        friends.addGroup(group);
    }
 
    cin>>m;
    for (i = 0; i < m; i++)
    {
        cin>>str;
        friends.findGroup(str);
    }
 
    cin>>n;
    for (i = 0; i < n; i++)
    {
        cin>>j;
        friends.findQq(j);
    }
    return 0;
}

AC源码

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
class QQ {
public:
    int number;
    string ID;
    QQ(int qq = 0, string id = 0) :number(qq), ID(id)
    {
 
    }
};
class Group {
public:
    string name;
    vector<QQ> qq;
    Group(string GP = 0) :name(GP)
    {
 
    }
    void addQQ(const QQ& p)
    {
        qq.push_back(p);
        int i, j;
        for (i = 0; i < qq.size(); i++)
            for (j = 0; j < qq.size() - 1 - i; j++)
            {
                if (qq[j].number > qq[j + 1].number)
                {
                    swap(qq[j], qq[j + 1]);
                }
 
            }
    }
    Group(const Group& p)
    {
        name = p.name;
        qq = p.qq;
    }
};
class Friends {
public:
    vector<Group> gp;
 
    void addGroup(const Group& p)
    {
        gp.push_back(p);    
        int i, j;
        for (i = 0; i < gp.size(); i++)
            for (j = 0; j < gp.size() - 1 - i; j++)
            {
                if (gp[j].name > gp[j + 1].name)
                {
                    swap(gp[j], gp[j + 1]);
                }
            }
    }
    void findGroup(string gName)
    {
        int i, j;
        int flag = 0;
        //遍历组名
        for (i = 0; i < gp.size(); i++)
        {
            if (gName == gp[i].name)//找到
            {
                //如果组非空
                if (!gp[i].qq.empty())
                {
                    cout << "Group " << gName << " :";
                    //循环输出一个组的所有QQ
                    for (j = 0; j < gp[i].qq.size(); j++)
                    {
                        if (j != gp[i].qq.size() - 1)
                        {
                            cout << " " << gp[i].qq[j].number << " " << gp[i].qq[j].ID << ";";
                            flag = 1;
                        }
                        else
                        {
                            cout << " " << gp[i].qq[j].number << " " << gp[i].qq[j].ID << "." << endl;
                            flag = 1;
                        }
                    }
                }
                else
                {
                    cout << "Group " << gName << " : empty." << endl;
                    flag = 1;
                }
            }
        }
        if (!flag)
        {
            cout << "Group " << gName << " : not existing." << endl;
        }
    }
    void findQq(int num)
    {
        int i, j;
        int cnt = 1;
        int flag = 0;
        cout << "QQ " << num << " in :";
        for (i = 0; i < gp.size(); i++)
        {
            for (j = 0; j < gp[i].qq.size(); j++)
            {
                if (num == gp[i].qq[j].number)
                {
                    flag = 1;
                    if (cnt == 1)
                    {
                        cout << " " << gp[i].name;
                        cnt++;
                        break;
                    }
                    else
                    {
                        cout << "; " << gp[i].name;
                        cnt++;
                        break;
                    }
                }
            }
        }
        if (flag==0)
        {
            cout << " empty";
        }
        cout << "." << endl;
    }
};
 
int main()
{
    int m, n, i, j, id;
    string str;
    Friends friends;
    cin>>m;
    for (i = 0; i < m; i++)
    {
        cin>>str>>n;
        Group group(str);
        for (j = 0; j < n; j++)
        {
            cin>>id>>str;
            QQ qq(id, str);
            group.addQQ(qq);
        }
        friends.addGroup(group);
    }
 
    cin>>m;
    for (i = 0; i < m; i++)
    {
        cin>>str;
        friends.findGroup(str);
    }
 
    cin>>n;
    for (i = 0; i < n; i++)
    {
        cin>>j;
        friends.findQq(j);
    }
    return 0;
}

8.Problem C: 玩家PK

在这里插入图片描述

原题链接
主程序

int main()
{
    int a, b, c, d;
    string name;
    cin>>name>>a>>b>>c>>d;
    Role one(name, a, b, c, d);
    cin>>name>>a>>b>>c>>d;
    Role two(name, a, b, c, d);
    one.combat(two);
    return 0;
}

AC源码

#include <iostream>
#include <string>
  
using namespace std;
  
  
class Role{
      
public:
    int hp_;  //??
    int ce_;  //???
    int de_; // ???
    int fa_; // ???
    string name_; //??
    bool flag;
  
    Role(string n , int h ,int c , int d , int f ):
    name_(n),hp_(h),ce_(c),de_(d),fa_(f)
    {
        flag = false;
    }
    void combat(Role & another){
        if(fa_ > another.fa_){
            flag = true;
            fa_ = another.fa_;
        }
        while(1){
              
         // ??????
        if(hp_ ==0 ){
            cout<<another.name_<<" wins."<<endl;
            break;
        }
        if(another.hp_ == 0){
            cout<<name_<<" wins."<<endl;
            break;
        }
          
        if(flag){  //a??b
            cout<<name_<<" attacks "<<another.name_<<":"<<another.name_<<" ";
            if(ce_ > another.de_){
                another.hp_ -= (ce_-another.de_);
                another.de_--;
                if(another.hp_ < 0){
                    another.hp_ = 0;
                }
                if(another.de_ <0){
                    another.de_ = 0;
                }
            }else{
                another.hp_ --;
                another.de_ --;
                if(another.hp_ < 0){
                    another.hp_ = 0;
                }
                if(another.de_ <0){
                    another.de_ = 0;
                }
            }
            cout<<"hp="<<another.hp_<<",de="<<another.de_<<endl;
            flag = false;
        }else{
              
           cout<<another.name_<<" attacks "<<name_<<":"<<name_<<" ";
            if(another.ce_ > de_){
                hp_ -= (another.ce_-de_);
                de_--;
                if(hp_ < 0){
                    hp_ = 0;
                }
                if(de_ <0){
                    de_ = 0;
                }
            }else{
                hp_ --;
                de_ --;
                if(hp_ < 0){
                    hp_ = 0;
                }
                if(de_ <0){
                    de_ = 0;
                }
            }
            cout<<"hp="<<hp_<<",de="<<de_<<endl;
            flag = true;
        }
        }
    }
};
 
int main()
{
    int a, b, c, d;
    string name;
    cin>>name>>a>>b>>c>>d;
    Role one(name, a, b, c, d);
    cin>>name>>a>>b>>c>>d;
    Role two(name, a, b, c, d);
    one.combat(two);
    return 0;
}

※9.Problem F: 复数类模板

在这里插入图片描述
原题链接
主程序`

int main()
{
    int a, b;
    double c, d;
    cin>>a>>b;
    Complex<int> c1(a, b);
    cout<<setiosflags(ios::fixed)<<setprecision(2)<<c1.getModulus()<<endl;
    cin>>c>>d;
    Complex<double> c2(c, d);
    cout<<setiosflags(ios::fixed)<<setprecision(2)<<c2.getModulus()<<endl;
    return 0;
}

AC源码

#include <iostream>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <vector>
using namespace std;
template <class T>
class Complex{
public:
    T x,y;
    Complex(T a,T b):x(a),y(b)
    {
         
    }
    double getModulus()
    {
        return sqrt(x*x+y*y);
    }
}; 
int main()
{
    int a, b;
    double c, d;
    cin>>a>>b;
    Complex<int> c1(a, b);
    cout<<setiosflags(ios::fixed)<<setprecision(2)<<c1.getModulus()<<endl;
    cin>>c>>d;
    Complex<double> c2(c, d);
    cout<<setiosflags(ios::fixed)<<setprecision(2)<<c2.getModulus()<<endl;
    return 0;
}

10.Problem G: 相邻的素数

在这里插入图片描述
原题链接
主程序

int main()
{
    int a, b;
    cin>>a>>b;
    Compute compute(a, b);
    compute.showResult();
    return 0;
}

AC源码

#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
bool isp(int j)
{
    int i;
    if(j<=1)
        return false;
    for(i = 2 ; i <= sqrt(j) ; i++)
    {
        if( j % i == 0)
            return false;   
    } 
    return true;
}
class Compute {
public:
    int m,n;
    Compute(int aa=0,int bb=0):m(aa),n(bb)
    {
         
    }
    void showResult()
    {
        if(n>0)
        {
            int p = 0;
            while( p<n )
            {
                if( isp(m) )
                {
                    if(p==0)
                    cout<<m;
                    else
                    cout<<" "<<m;
                    p++;
                    m++;
                }
                else
                {
                    m++;
                }
            }       
        }
        else
        {
            int p=0;
            int tp=-n;
            while(p<tp)
            {
                if(m<=1)
                break; 
                if(isp(m))
                {
                    if(p==0)
                    cout<<m;
                    else
                    cout<<" "<<m;
                    p++;
                    m--;
                }
                else
                {
                    m--;
                }
                 
            }
        }
    }
};
int main()
{
    int a, b;
    cin>>a>>b;
    Compute compute(a, b);
    compute.showResult();
    return 0;
}

11.Problem H: 数组的平滑

在这里插入图片描述
原题链接
AC源码

#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
using namespace std;
vector<double> a;
vector<double> b;
bool issame(int num)
{
    int j;
    for(j=0;j<num;j++)
    {
        if(a[j]!=b[j])
        return false;
    }
    return true;
}
int main()
{
    double tp;
    int i;
    int flag=0;
    while(cin>>tp)
    {
        a.push_back(tp);    
        b.push_back(tp);    
    } 
    while(1)
    {
        for(i=1;i<a.size()-1;i++)
        {
            a[i]=round( (a[i-1]+a[i+1])/2 );
        }
        for(i=1;i<a.size()-1;i++)
        {
            b[i]=a[i];
        }       
        for(i=1;i<a.size()-1;i++)
        {
            b[i]=round( (b[i-1]+b[i+1])/2 );
        }       
        if(issame(a.size()))
        {
            break;
        }
    }
    for(i=0;i<a.size();i++)
    {
        if(i==0)
        {
            cout<<a[i];
        }
        else
        cout<<" "<<a[i];
    }           
//  cout<<round(3.49);    
//  cout<<round(3.5);
    return 0;
}

12.Problem L: 数组的归一化

在这里插入图片描述
AC源码

#include <iostream>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <vector>
using namespace std;
int main()
{
    vector<double> a;
    double tp;
    double sum=0;
    int i;
    while(cin>>tp)
    {
        sum+=tp;
        a.push_back(tp);
    }
    for(i=0;i<a.size();i++)
    {
        if(sum==0)
        {
            if(i==0)
            cout<<"1.00";
            else
            cout<<" 1.00";
            continue;
        }
        a[i]/=sum;
        if(i==0)
        cout<<fixed<<setprecision(2)<<a[i];
        else
        cout<<" "<<fixed<<setprecision(2)<<a[i];
    }
     
    return 0;
}

Jpgxep

关注

2
点赞
踩
4

收藏

觉得还不错? 一键收藏
打赏
0
评论
OJ作业题的复习

复习C++，今天把所有题目都浏览一遍，整合一下比较ex的题目，其实是语法平时几乎没有涉及的题目，以防考试考到文章目录1.Problem E: 计算机类2.Problem I: 回文素数3.Problem G: 时间类的加、减法赋值运算1.Problem E: 计算机类链接地址以下是主程序int main(){ char str[101]; cout<<"1:"<<Computer::getCnt()<<" computers."<.
复制链接

扫一扫