https://www.luogu.org/problemnew/show/P1553

    1. #include <cmath>
    2. #include <cstdio>
    3. #include <iostream>
    4. #include <algorithm>
    5. #include <queue>
    6. #include <map>
    7. #include <cstring>
    8. #include <vector>
    9. #include <stack>
    11. using namespace std;
    12. #define ll long long
    13. #define ff first
    14. #define ss second
    15. #define mp make_pair
    16. #define ph push
    17. #define pb push_back
    18. #define all(x) (x).begin(), (x).end()
    20. string::size_type pos;
    22. string qf0(string s) {
    23.     reverse(s.begin(), s.end());
    24.     while (s.size() > 1 && s[0] == '0') {
    25.         s.erase(0, 1);
    26.     }
    27.     if (s.size() == 0) {
    28.         s = "0";
    29.     }
    30.     return s;
    31. }
    33. string ql0(string s) {
    34.     reverse(s.begin(), s.end());
    35.     while (s.size() > 1 && s[s.size() - 1] == '0') {
    36.         s.erase(s.size() - 1, 1);
    37.     }
    38.     if (s.size() == 0) {
    39.         s = "0";
    40.     }
    41.     return s;
    42. }
    44. void f(string s) {
    45.     pos = s.find(".");
    46.     if (pos != s.npos) {
    47.         //从0开始截取pos位
    48.         string s1 = s.substr(0, pos), s2 = s.substr(pos + 1);
    49.         cout << qf0(s1) << "." << ql0(s2) << endl;
    50.         return;
    51.     }
    52.     pos = s.find("/");
    53.     if (pos != s.npos) {
    54.         string s1 = s.substr(0, pos), s2 = s.substr(pos + 1);
    55.         cout << qf0(s1) << "/" << qf0(s2) << endl;
    56.         return;
    57.     }
    58.     pos = s.find("%");
    59.     if (pos != s.npos) {
    60.         string s1 = s.substr(0, pos);
    61.         cout << qf0(s1) << "%" << endl;
    62.         return;
    63.     }
    64.     cout << qf0(s) << endl;
    66. }
    68. int main() {
    69.     ios::sync_with_stdio(false);
    70.     string s;
    71.     cin >> s;
    72.     f(s);
    74. }

    https://www.luogu.org/problemnew/show/P1055

    1. #include <cmath>
    2. #include <cstdio>
    3. #include <iostream>
    4. #include <algorithm>
    5. #include <queue>
    6. #include <map>
    7. #include <cstring>
    8. #include <vector>
    9. #include <stack>
    11. using namespace std;
    12. #define ll long long
    13. #define ff first
    14. #define ss second
    15. #define mp make_pair
    16. #define ph push
    17. #define pb push_back
    18. #define all(x) (x).begin(), (x).end()
    20. string::size_type pos;
    22. int qSumMod(string s) {
    23.     int t = 1, sum = 0;
    24.     for (int i = 0; i <s.size(); ++i) {
    25.         if (s[i] != '-') {
    26.             sum += (s[i] - '0') * t;
    27.             ++t;
    28.         }
    29.     }
    30.     return sum % 11;
    31. }
    33. void f(string s) {
    34.     pos = s.rfind("-");
    35.     string s1 = s.substr(0, pos), s2 = s.substr(pos + 1);
    36.     int t = s2[0] == 'X' ? 10 : s2[0] - '0';
    37.     int mod = qSumMod(s1);
    38.     if (mod == t) {
    39.         cout << "Right" << endl;
    40.     } else {
    41.         cout<<(s.substr(0, pos+1));
    42.         if (mod == 10) {
    43.             cout << "X" << endl;
    44.         } else {
    45.             cout << mod << endl;
    46.         }
    47.     }
    48. }
    50. int main() {
    51.     ios::sync_with_stdio(false);
    52.     string s;
    53.     cin >> s;
    54.     f(s);
    56. }

    https://www.luogu.org/problemnew/show/P1308

    1. #include <cmath>
    2. #include <cstdio>
    3. #include <iostream>
    4. #include <algorithm>
    5. #include <queue>
    6. #include <map>
    7. #include <cstring>
    8. #include <vector>
    9. #include <stack>
    10. #include <string>
    12. using namespace std;
    13. #define ll long long
    14. #define ff first
    15. #define ss second
    16. #define mp make_pair
    17. #define ph push
    18. #define pb push_back
    19. #define all(x) (x).begin(), (x).end()
    21. string::size_type pos;
    23. string toLowerCase(string s) {
    24.     for (int i = 0; i < s.size(); i++) {
    25.         if (s[i] >= 'A' && s[i] <= 'Z') {
    26.             s[i] += 32;
    27.         }
    28.     }
    29.     return s;
    30. }
    32. vector<pair<string,int> > split(string s) {
    33.     s+=" ";
    34.     vector<pair<string,int> >  allStr;
    35.     string re="";
    36.     for(int i=0;i<s.size();i++){
    37.         if(s[i]==' '){
    38.             if(re.size()>0){
    39.                 allStr.pb(mp(re,i-re.size()));
    40.             }
    41.             re="";
    42.         }else{
    43.             re+=s[i];
    44.         }
    45.     }
    46.     return allStr;
    47. }
    49. void f(string s, string s1) {
    50.     vector<pair<string,int> >  allStr = split(s1);
    51.     int sum=0,flag=1,n=0;
    52.     for(int i=0;i<allStr.size();i++){
    53.         if(allStr[i].ff==s){
    54.             if(flag){
    55.                 n=allStr[i].ss;
    56.                 flag=0;
    57.             }
    58.             sum++;
    59.         }
    60.     }
    61.     if (!flag) {
    62.         cout << sum << " " << n << endl;
    63.     } else {
    64.         cout << -1 << endl;
    65.     }
    66. }
    68. int main() {
    69.     ios::sync_with_stdio(false);
    70.     string s, s1;
    71.     cin >> s;
    72.     getline(cin, s1);
    73.     getline(cin, s1);
    74.     s = toLowerCase(s);
    75.     s1 = toLowerCase(s1);
    76.     f(s, s1);
    77. }

    https://www.luogu.org/problemnew/show/P1200

    #include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <cstring>
#include <vector>
#include <stack>
#include <string>

using namespace std;
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define ph push
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> pii;

ll qm(string s) {
    ll sum = 1;
    for (char c:s) {
        ll t = (c - 'A') + 1;
        sum *= t;
    }
    return sum % 47;
}

void f(string s1, string s2) {
    if (qm(s1) == qm(s2)) {
        cout << "GO" << endl;
    } else {
        cout << "STAY" << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    string s1, s2;
    cin >> s1 >> s2;
    f(s1, s2);
}

    https://www.luogu.org/problemnew/show/P1914

    #include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <cstring>
#include <vector>
#include <stack>
#include <string>

using namespace std;
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define ph push
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> pii;

void f (int n,string s){
    string res="";
    for(char c:s){
        char cc=(int)(c-'a'+n)%26+'a';
        res+=cc;
    }
    cout<<res<<endl;
}

int main() {
    ios::sync_with_stdio(false);
    int n;
    string s;
    cin>>n>>s;
    f(n,s);
}

    https://www.luogu.org/problemnew/show/P1914

    #include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <cstring>
#include <vector>
#include <stack>
#include <string>

using namespace std;
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define ph push
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> pii;

int a[405][30];
void f(int num[]){
    int maxNum=*max_element(num,num+26);
    for(int i=0;i<26;++i){
        for(int j=num[i],k=maxNum-1;j>0;j--,k--){
            a[k][i]=1;
        }
    }
  for(int i=0;i<maxNum;i++){
      for(int j=0;j<26;j++){
          if(j!=0){
              cout<<" ";
          }
          if(a[i][j]==1){
              cout<<"*";
          }else{
              cout<<" ";
          }
      }
      cout<<endl;
  }
  for(char i='A';i<='Z';++i){
      if(i!='A'){
          cout<<" ";
      }
      cout<<i;
  }
  cout<<endl;

}

int main() {
    ios::sync_with_stdio(false);
    int num[30];
    memset(a, 0, sizeof(a));
    memset(num, 0, sizeof(num));
    string s,s2;
    int t=4;
    while(t--){
        getline(cin,s);
        for(int i=0;i<s.size();++i){
            if(s[i]!=' '){
                num[s[i]-'A']++;
            }
        }
    }
   f(num);
}