每天打卡一小时 第三十一天 PTA520钻石 争霸赛

#include<iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    cout<<"520 "<<n<<" Times!";
}

#include<iostream>
using namespace std;
int main()
{
    int T,w,t;
    cin>>T>>w>>t;

    if(w>=T&&t>=T)
    {
        cout<<"*^_^*";
    }

    if(w>=T&&t<T)
    {
        cout<<"T_T";
    }

    if(w<T&&t>=T)
    {
        cout<<"-_-#";
    }

    if(w<T&&t<T)
    {
        cout<<"-_-";
    }
    
}

#include<iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int m;
        cin>>m;
        if(m%2==0)
        {
            cout<<"!Love"<<endl;
        }
        else
        {
            cout<<"Love!"<<endl;
        }
    }
}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool isCoupleNum(int num)
{
    vector<int> digits;
    while(num)
    {
        digits.push_back(num % 10);
        num /= 10;
    }
    int len = digits.size();
    if(len % 2 != 0) return false;
    reverse(digits.begin(), digits.end());
    int mid = len >> 1;
    int a = 0, b = 0;
    bool oddA = false, oddB = false;
    for(int i = 0; i < len; ++i)
    {
        if(i < mid){
            if(i == 0 || digits[i] <= digits[i - 1]) a += digits[i];
            else return
                false;
        } else
        {
            if(i == mid || digits[i] >= digits[i - 1]) b += digits[i];
            else return
                false;
        }
    }
    return (a % 2 == 0 && b % 2 == 1);
}

int main(){
    int n; cin >> n;
    vector<int> numbers(n);
    int counts = 0;
    int maxCoupleNum = -1;
    for(int i = 0; i < n; ++i){
        cin >> numbers[i];
        if(isCoupleNum(numbers[i])){
            ++counts;
            maxCoupleNum = max(maxCoupleNum, numbers[i]);
        }
    }
    cout << counts << endl;
    cout << maxCoupleNum << endl;
    return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }

    int m;
    cin>>m;
    int b[m];
    for(int i=0;i<m;i++)
    {
        cin>>b[i];
    }

    for(int i=0;i<m;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(b[i]==a[j])
            {
                cout<<j+1<<endl;
                break;
            }

            if(b[i]!=a[j]&&j==n-1)
            {
                cout<<"Sorry"<<endl;
                break;
            }
        }
    }
}