浙大PAT乙级(Basic Level)真题1001-1005

这种东西就很烦。

A+B和C (15)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    long long int a,b,c;
    for(int i=1;i<=n;i++)
    {
        cin>>a>>b>>c;
        if(a+b>c)
            printf("Case #%d: true\n",i);
        else
        {
            printf("Case #%d: false\n",i);
        }
    }
    return 0;
}

数字分类 (20)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,i;
    int num[1001];
    int num2[1001];
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>num[i];
    }
    int sum=0;
    for(i=0;i<n;i++)
    {
        if(num[i]%10==0)
            sum+=num[i];
    }
    if(sum)
    cout<<sum<<" ";
    else cout<<"N ";
    sum=0;
    int flag=1;
    for(i=0;i<n;i++)
    {
        if(num[i]%5==1)
        {
            sum=sum+flag*num[i];
            flag=-flag;
        }
    }
    if(sum)
    cout<<sum<<" ";
    else cout<<"N ";
    sum=0;
    for(i=0;i<n;i++)
    {
        if(num[i]%5==2)
            sum++;
    }
    if(sum)
    cout<<sum<<" ";
    else cout<<"N ";
    sum=0;
    flag=0;
    for(i=0;i<n;i++)
    {
        if(num[i]%5==3)
            {
                sum+=num[i];
                flag++;
            }
    }
    if(sum)
    printf("%.1f ",sum*1.0/flag);
    else cout<<"N ";
    int k=0;
    for(i=0;i<n;i++)
    {
        if(num[i]%5==4)
            num2[k++]=num[i];
    }
    sort(num2,num2+k);
    if(k)
    cout<<num2[k-1];
    else cout<<"N";
}

数素数 (20)

#include <bits/stdc++.h>
using namespace std;
int IsPrime(int number)
{
    if(number==1) return 0;
    int i;
    for(i=2;i<=sqrt(number);i++)
    {
        if(number%i==0)return 0;
    }
    return 1;
}
int main()
{
    int m,n;
    cin>>m>>n;
    int a[10005];
    int i=1,flag=0;
    int k=1;
    int l=1;
    while(i<=n)
    {
       if(IsPrime(k))
       {
           a[l++]=k;
           i++;
       }
        k++;
    }
    for(i=m;i<=n;i++)
    {
        flag++;
        printf("%d",a[i]);
        if(flag%10&&i!=n)cout<<" ";
        if(flag%10==0)
            cout<<endl;

    }

}

福尔摩斯的约会 (20)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    string str1;
    string str2;
    string str3;
    string str4;
    cin>>str1;
    cin>>str2;
    cin>>str3;
    cin>>str4;
    int i,j;
    int flag=0,sign=0;
    for(i=0;i<str1.size();i++)
    {
        if(str1[i]==str2[i]&&str1[i]>='A'&&str1[i]<='Z')
        {
            flag=str1[i]-'A'+1;
            break;
        }
    }
    int count=0;
    char data[][4]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
    cout<<data[flag-1]<<" ";
    str1.erase(i,1);
    str2.erase(i,1);
    for(i=0;i<str1.size();i++)
    {
        if(str1[i]==str2[i]&&(str1[i]>='A'&&str1[i]<='N'))
        {
            count++;
            if(count==2)
            {
                cout<<str1[i]-'A'+10;
                break;
            }
        }
        if(str1[i]==str2[i]&&(str1[i]>='0'&&str1[i]<='9'))
        {
            count++;
            if(count==2)
            {
               printf("%02d",str1[i]-'0');
               break;
            }

        }
    }
    for(i=0;i<str3.size();i++)
    {
        if(str3[i]==str4[i]&&((str3[i]>='A'&&str3[i]<='Z')||(str3[i]>='a'&&str3[i]<='z')))
            break;
    }
    printf(":%02d",i);
}

德才论

#include <bits/stdc++.h>
using namespace std;
struct student
{
    int id;
    int de;
    int cai;
    int sum;
};
bool cmp(student a,student b)
{
    if(a.sum!=b.sum)
    return a.sum>b.sum;
    else if(a.sum==b.sum&&a.de!=b.de)
        return a.de>b.de;
    else if(a.sum==b.sum&&a.de==b.de)
        return a.id<b.id;

}
int main()
{
    int N,L,H;
    struct student a[100005];
    struct student b[100005];
    struct student c[100005];
    struct student d[100005];
    cin>>N>>L>>H;
    int i,k=0,l=0,m=0,n=0;
    int x,y,z;
    for(i=0;i<N;i++)
    {
        cin>>x>>y>>z;
        if(y>=L&&z>=L)
        {
            if(y>=H&&z>=H)
            {
                a[k].id=x;
                a[k].de=y;
                a[k].cai=z;
                a[k].sum=a[k].de+a[k].cai;
                k++;
            }

           else if(y>=H&&z<H)
            {
                b[l].id=x;
                b[l].de=y;
                b[l].cai=z;
                b[l].sum=b[l].de+b[l].cai;
                l++;
            }
            else if(y<H&&z<H&&y>=z)
            {
                c[m].id=x;
                c[m].de=y;
                c[m].cai=z;
                c[m].sum=c[m].de+c[m].cai;
                m++;
            }
            else
            {
                d[n].id=x;
                d[n].de=y;
                d[n].cai=z;
                d[n].sum=d[n].de+d[n].cai;
                n++;
            }

        }
    }
    sort(a,a+k,cmp);
    sort(b,b+l,cmp);
    sort(c,c+m,cmp);
    sort(d,d+n,cmp);
    cout<<k+l+m+n<<endl;
    for(i=0;i<k;i++)
        cout<<a[i].id<<" "<<a[i].de<<" "<<a[i].cai<<endl;
    for(i=0;i<l;i++)
        cout<<b[i].id<<" "<<b[i].de<<" "<<b[i].cai<<endl;
    for(i=0;i<m;i++)
        cout<<c[i].id<<" "<<c[i].de<<" "<<c[i].cai<<endl;
    for(i=0;i<n;i++)
        cout<<d[i].id<<" "<<d[i].de<<" "<<d[i].cai<<endl;
        return 0;
}