Submission #64996042

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sd second
#define int long long
const int mod = 1e9 + 7;

int powOf(int l, int r)
{
    int c = 0;
    while (l > 0 && l % r == 0)
    {
        l /= r;
        c++;
    }
    return c;
}

int binpow(int n, int x)
{
    if (x == 0)
        return 1;
    int ans = binpow(n, x / 2);
    if (x % 2 == 0)
        return ans * ans;
    else
        return ans * ans * n;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        string s;
        cin >> s;
        int n = s.size();
        for (int i = 0; i < n; i++)
        {
            if (s[i] - 'A' < 26)
                cout << s[i];
        }
        cout << endl;
    }
    return 0;
}

Submission Info

Judge Result