字符串计数 sum数字 c字母 #include #include using namespace std;

int -> %d
long long -> %ld
char -> %c
string -> %s
float -> %f
double -> %lf
string ->

#include <iostream>
#include <algorithm>

using namespace std;

struct pai{
    string name;
    int id;
    double score;
};

pai a[101];

bool compare(pai a,pai b){
    return a.score > b.score;

}

int main(){
    int n,xiao = 101,xiaoid=1;
    string xiaoname = "";
    cin >> n;

    for(int i=1; i<=n; i++){
        cin >> a[i].id >> a[i].name >> a[i].score;
    }
    sort(a+1,a+1+n,compare);
    for(int i=1; i<=n; i++){
        cout << a[i].id<<" "<<a[i].name<<" "<<a[i].score<<endl;
    }

    return 0;
    }
```cpp
#include <iostream>

using namespace std;

int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}
int main(){
    int m;
    cin>>m;
    int start = 2;

    int offset = 0;
    for(int i=1; i<m; i++){
        offset += a[i];
    }
    int first = (start + offset) % 7;

    cout << "MON TUE WED THU FRI SAT SUN"<<endl;
    for(int i=0; i<first; i++){
        cout << "    ";
    }
    int t = a[m];
    for(int i=1; i<=t; i++){
        if(i<9){
            cout << " ";
        }
        else{
            cout << "  ";
        }
    }
    cout << i;

    if((first+i) % 7 == 0){
        cout << endl;
    }else{
        cout<< " ";
    }

    return 0;
}
``````cpp
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

struct node{
    int e,c,m;

    int sum,pai,num;
}a[10010];

bool cmp(node x, node y ){
    if(x.sum != y.sum){
        return x.sum > y.sum;
    }
    if(x.c+x.m != y.c+y.m){
        return x.c+x.m > y.c+y.m;
    }
    if(max(x.c,x.m) != max(y.c,y.m)){
        return max(x.c,x.m) > max(y.c,y.m);
    }
    return false;

}
bool cmp1(node x, node y){
    return x.num < y.num;
}

int main(){
    int n;
    cin>>n;

    for(int i=1; i<=n; i++){
        cin >> a[i].c>>a[i].m >> a[i].e;
        a[i].num = i;
        a[i].sum = a[i].c+a[i].m + a[i].e;

    }
    sort(a+1,a+1+n, cmp);

    for(int i=1; i<=n; i++){
        if(a[i].sum == a[i-1].sum
        && a[i].c+a[i].m == a[i-1].c+a[i-1].m
        && max(a[i].c, a[i].m) == max(a[i-1].c,a[i-1].m)){
            a[i].pai = a[i-1].pai;
        }else{
            a[i].pai = i;
        }

    }
    sort(a+1,a+1+n,cmp1);


for(int i=1; i<=n; i++){
    cout << a[i].pai << endl;
}
return 0;
}

#include <iostream>

using namespace std;

bool ismatch(char c1, char c2){
    return c1==c2 || c1==63 || c2=='?';
}
int main (){
    string s,t;
    cin >> s >> t;
    int len_s = s.length();
    int len_t = t.length();

    for(int i=0; i<=len_s-len_t; i++){
        bool ok = true;

        for(int j=0; j<len_t; j++){
            if(ismatch(s[i+j],t[j])==false){
                ok = false;
                break;
            }
        }
        if(ok == true){
            cout << i+1 << " "<< i+len_t << endl;
        }
    }
}