2020暑期培训 第五套

t1匹配

#include <bits/stdc++.h>
using namespace std;
int ans, sum, n;
string s1, s2;
int main(){
    freopen("rotate.in", "r", stdin);
    freopen("rotate.out", "w", stdout);
    cin >> n;
    cin >> s1 >> s2;
    for (int i = 0; i < n; i++){
        sum = 0;
        for (int j = 0; j < n; j++)
            if (s1[(i+j)%n] == s2[j]) sum++;
        ans = max(ans, sum);
    }
    cout << ans << endl;
    return 0;
}

 t2 挑战

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#define LL long long
using namespace std;
template<typename T>void Read(T &cn)
{
    char c;int sig = 1;
    while(!isdigit(c = getchar()))if(c == '-')sig = -1;cn = c-48;
    while(isdigit(c = getchar()))cn = cn*10+c-48;cn*=sig;
}
template<typename T>void Write(T cn)
{
    if(!cn){putchar('0');return;}
    if(cn<0){putchar('-');cn = 0-cn;}
    int wei = 0;T cm = 0;int cx = cn%10;cn=cn/10;
    while(cn)wei++,cm = cm*10+cn%10,cn=cn/10;
    while(wei--)putchar(cm%10+48),cm=cm/10;
    putchar(cx+48);
}
int S,A,B;
int n,ans;
int S1,A1,B1;
int main()
{
    // freopen("kanna.in","r",stdin);
    // freopen("kanna.out","w",stdout);
    Read(n); Read(S); Read(A); Read(B);
    ans = 0;
    for(int i = 1;i<=n;i++){
        Read(S1); Read(A1); Read(B1);
        int lin1 = A1-B, lin2 = A-B1;
        if(S1 <= A) {ans++; continue; }
        if(lin2 <= 0) continue;
        if(lin1 <= 0) {ans++; continue; }//排除line2<=0 的情况
        int cishu1 = ceil(S*1.0/lin1), cishu2 = ceil((S1-A)*1.0/lin2);
        ans += (cishu1 > cishu2);
    }
    Write(ans); putchar('\n');
    return 0;
}
/*
3
10 2 2
2 100 100
13 3 0
3 0 100

*/

 

 t3 python

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;

string s[1000005];
int n = 0;

bool check(int num)
{
    int len = s[num].length();
    if(s[num][len - 1] != ']') return false;
    for(int i = 3;i < len;i++){
        if(!(s[num][i] - '0' >= 0) && !(s[num][i] - '0' <= 9))
            return false;
    }
    return true;
}

void work(int num){
    int a = 0;
    int len = s[num].length();
    for(int i = 3;i < len - 1;i++){
        a *= 10;
        a += s[num][i] - '0';;
    }
    cout << "Out[" << num << "]: " << "'" << s[a] << "'" << endl;
}

int main()
{
    // freopen("ipython.in", "r", stdin);
    // freopen("ipython.out", "w", stdout);
    // ios::sync_with_stdio(false);
    int i = 0;
    while(cin>>s[++i]){
    //n--;
    // for(int i = 1;i <= n;i++){
        printf("In [%d]: ",i);
        if(s[i][0] == 'I' && s[i][1] == 'n' && s[i][2] == '[' && check(i))
            work(i);
        if(i != n)
            printf("\n");
    // }
    }
    return 0;
}