#include <iostream>
#include <string>

using namespace std;

int main()
{
    string s;
    getline(cin, s); // 输入一行字符串

    bool first = true; // 标记是否在单词的第一个字符处
    for (char& c : s) {
        if (isalpha(c)) { // 如果是字母
            if (first) { // 如果是单词的第一个字符
                c = toupper(c); // 转换为大写字母
                first = false; // 重置 first
            }
        } else { // 如果不是字母
            first = true; // 重置 first
        }
    }

    cout << s << endl;

    return 0;
}

#include <iostream>
#include <cmath>

using namespace std;


typedef long long LL;

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

    while (T -- )
    {
        int n;
        cin >> n;

        int ans = 0;
        for (int i = 1; i * i * i<= n; i ++ )
        {
            int t = i * i * i;
            int r = sqrt(t);
            if (r * r == t) ans ++;
        }
        cout << ans << endl;
    }
    return 0;
}

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int w[N];

int main()
{
    int n;
    while(cin >> n && n != 0)
    {
        int ans = 0;
        for (int i = 0; i < n; i ++ ) cin >> w[i];
        for (int i = 0; i < n; i ++ )
        {
            for (int j = 0; j < n; j ++)
            {
                if (w[i] < w[j] && __gcd(w[i], w[j]) == 1)
                {
                    //cout << "分子：" << w[i] << "分母：" << w[j] << endl;
                     ans ++; 
                }
            } 
        }
        cout << ans << endl;
    }

    return 0;
}

#include <iostream>

using namespace std;



int main()
{
    double n, k;
    while (cin >> n >> k)
    {
        double house = 200;
        double sum = 0;  //n是年薪 k是增长率
        bool flag = false;
        for (int i = 1; i <= 21; i ++ )
        {
            sum += n;
            // cout << "第" << i << "年财产：" << sum << endl;
            // cout << "第" << i << "年房价：" << start << endl; 
            if (sum >= house)
            {
                cout << i << endl;
                flag = true;
                break;
            }
            house = house * (1 + k / 100.0);
        }

        if (!flag) cout << "Impossible" << endl;  
    }


    return 0;
}

#include <iostream>
#include <vector>

using namespace std;

const int N = 110;

int w[N];

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i ++ ) cin >> w[i];

    vector<int> v;    

    for (int i = 0; i < n; i ++ )
    {
        if (i == 0 && w[i] < w[i + 1]) v.push_back(i);
        if (i == 0 && w[i] > w[i + 1]) v.push_back(i);
        if (i == n - 1 && w[i] < w[i - 1]) v.push_back(i);
        if (i == n - 1 && w[i] > w[i - 1]) v.push_back(i);
        if (w[i] < w[i - 1] && w[i] < w[i + 1] && i != 0 && i != n - 1) v.push_back(i); //极小值点
        if (w[i] > w[i - 1] && w[i] > w[i + 1] && i != 0 && i != n - 1) v.push_back(i); //极大值带你
    } 

    for (auto c: v)
    {
        cout << c << ' ';
    }

    return 0;
}

#include <iostream>
using namespace std;

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

    // 枚举每个数字
    int ans = 0;

    for (int i = 1; i <= n; i ++ )
    {
        bool flag = false;
        if (i % 7 == 0)
        {
            flag = true;
        }
        int t = i;
        while(t)
        {
            int ret = t % 10;
            if (ret == 7) flag = true;
            t /= 10;
        }

        if (!flag) ans += (i * i);
    }

    cout << ans << endl;


    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int n, m;
    while (cin >> n >> m)
    {
        bool flag = false;
        if (n == 1 && m == 1)  flag = true;
        if (!(n & 1) || !(m & 1))
        {
            if (m == 1 && n != 1)  flag = false;
            else if (m != 1 && n == 1) flag = false;
            else flag = true;
        }

        if (flag) cout << 'Y' << endl;
        else cout << 'N' << endl;
    }

    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    int T;
    cin >> T;
    while (T -- )
    {
        double H, n;
        cin >> H >> n;

        double s = 0;
        for (int i = 1; i <= n; i ++ )
        {
            if (i == 1) s += H;
            else 
            {
                H /= 2.0;
                s += 2.0 * H;
            }
        }

        printf("%.2lf\n", s);

    }

    return 0;
}

单词识别, tolower、单词分割、字符串 待补充y总做法

简单版本

#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>

using namespace std;

string s = "";

int main()
{
    map<string, int> hash;
    string str;
    getline(cin, str);
    transform(str.begin(), str.end(), str.begin(), ::tolower);

    for (int i = 0; i < str.size(); i ++ )
    {
        if (str[i] != ',' && str[i] != ' ' && str[i] != '.')
        {
            s += str[i];
        }
        else
        {
            hash[s] ++; 
            s = "";
        }
    }
    hash[s] ++;
    for (auto &[k, v] :hash)
    {
        if (!k.empty()) cout << k << ':' << v << endl;
    }

    return 0;
}

#include <iostream>
#include <unordered_set>

using namespace std;

unordered_set<int> s;

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i ++ )
    {
        int x;
        cin >> x;
        s.insert(x);
    }

    int m;
    cin >> m;
    for (int j = 0; j < m; j ++ )
    {
        int x;
        cin >> x;
        if (s.count(x)) cout << "YES" << endl;
        else cout << "NO" << endl;
    } 

    return 0;
}