团体程序设计天梯赛-练习集L16-L26（除L20和L25)

16.

#pragma GCC optimize(3)//pta檢查身份證 
#include<bits/stdc++.h>
using namespace std;
int n;
char ch[12]={'1','0','X','9','8','7','6','5','4','3','2'};
string s;
int flag;
int a[20]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>n;
    for(register int i=1;i<=n;i++)
    {
        int sum=0;
        cin>>s;
        for(register int j=0;j<17;j++)
        {
            sum+=((s[j]-'0')*a[j]); 
        }
        sum%=11;
        if(s[17]!=ch[sum])
        {
            flag++;
            cout<<s<<endl;
        }
    }
    if(flag==0)
    cout<<"All passed"<<endl; 
    return 0;
}

17.

/*#pragma GCC optimize(3)//pta 到底有多2 
#include<bits/stdc++.h>
using namespace std;
int main()
{
    std::ios::sync_with_stdio(false);
    char a[100];
    int i,j,h;
    scanf("%s",a);
    int lena;
    lena=strlen(a);
    int count=0;
    for(i=0;i<lena;i++)
    {
        if(a[i]=='2')
        count++;
    }
    double rate;
    if(a[0]=='-')
    {
        if(a[lena-1]%2==0)
        {
            rate=count*1.0/(lena-1)*1.0*1.5*2.0*100;
        }
        else
        {
            rate=count*1.0/(lena-1)*1.0*1.5*100;
        }
    }
    else
    {
        if(a[lena-1]%2==0)
        {
            rate=count*1.0/lena*1.0*2.0*100;
        }
        else
        {
            rate=count*1.0/lena*1.0*100;
        }
    }
    printf("%.2f%%",rate);
        
    
}*/

18.

/*#include<bits/stdc++.h>//pta 大笨鈡 
using namespace std;
int h;
int m;
char ch;
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>h>>ch>>m;
    if(h<12)
    {
        printf("Only %02d:%02d.  Too early to Dang.",h,m);
    }
    else if(h==12&&m==0)
    {
        printf("Only %02d:%02d.  Too early to Dang.",h,m);
    }
    else
    {
        if(m==0)
        {
            int n=h%12;
            for(register int i=1;i<=n;i++)
            {
                cout<<"Dang";
            }
        }
        else
        {
            int n=h%12+1;
            for(register int i=1;i<=n;i++)
            cout<<"Dang";
        }
    }
    return 0;
}*/

19.

*#include<bits/stdc++.h>//pta誰先倒 
using namespace std;
int main()
{
    std::ios::sync_with_stdio(false);
    int a,b;
    cin>>a>>b;
    int n;
    cin>>n;
    int numa=0,numb=0;
    for(int i = 1;i <= n;i ++ )
    {
        int a1,a2,b1,b2;
        cin>>a1>>a2>>b1>>b2;
        if((a2==(a1+b1)&&b2==(a1+b1))||(a2!=(a1+b1)&&b2!=(a1+b1)))
        {
            continue;
        }
        if(a2==(a1+b1))//甲输
        {
            numa++;
            if(numa>a)
            {
                cout<<'A'<<endl;
                cout<<numb;
                break;
            }
        } 
        if(b2==(a1+b1))
        {
            numb++;
            if(numb>b)
            {
                cout<<'B'<<endl;
                cout<<numa;
                break;
            }
            
        }
    } 
}*/

20.明天做

21.水了

22.水

23.

#include<bits/stdc++.h>//pta 输出GPLT 
using namespace std;
int g;
int t;
int l;
int p;
string s;
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>s;
    for(register int i=0;i<s.length();i++)
    {
        s[i]=toupper(s[i]);
        if(s[i]=='G')
        {
            g++;
        }
        else if(s[i]=='T')
        {
            t++;
        }
        else if(s[i]=='L')
        {
            l++;
        }
        else if(s[i]=='P')
        {
            p++;
        } 
    }
    while(g||t||l||p)
    {
        if(g>0)
        {
            cout<<'G';
            g--;
        }
         if(p>0)
        {
            cout<<'P';
            p--;
        }
         if(l>0)
        {
            cout<<'L';
            l--;
        }
         if(t>0)
        {
            cout<<'T';
            t--;
        }
    }
    return 0;
}*/

24.水

25.明天做，這個題涉及到一個c語言的標準庫，明天好好研究一下

26.水