1
2
3
4
5
6
7
8
9
10

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n, m;
        cin >> n >> m;
        for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cout << static_cast<char>('a' + j);
        cout << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n, m;
        cin >> n >> m;
        const int r = static_cast<int>(sqrt(n)) + 1;
        int ans = 1;
        for (int i = 1; i <= min(r, n); ++i) {
            if (n % i != 0) continue;
            if (i >= m) ans = max(ans, n / i);
            else if (n / i >= m) ans = max(ans, i);
        }
        cout << ans << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        int n, k, m;
        cin >> n >> k >> m;
        string str;
        str.resize(m);
        cin >> str;
        set<char> st;
        int tot = 0;
        vector<char> ans;
        for (const auto& c: str) {
            if (c < 'a' || c >= 'a' + k) continue;
            st.insert(c);
            if (st.size() == k) {
                st.clear();
                ++tot;
                ans.push_back(c);
            }
        }
        if (tot >= n) cout << "YES" << endl;
        else {
            cout << "NO" << endl;
            char c = 'a';
            for (char i = 0; i < k; ++i) if (!st.count(i + 'a')) c = i + 'a';
            for (int i = 0; i < n; ++i) if (i < ans.size()) cout << ans[i]; else cout << c;
            cout << endl;
        }
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

#define int long long
 void solve() {
    int _;
    cin >> _;
    for (int tc = 0; tc < _; ++tc) {
        constexpr int mod = 1e9 + 7;
        auto qp = [&](int a, int p) {
            int ans = 1;
            while (p) {
                if (p & 1) ans = ans * a % mod;
                a = a * a % mod;
                p >>= 1;
            }
            return ans;
        };
        int n, m, k;
        cin >> n >> m >> k;
        const int i = qp(n * (n - 1) / 2 % mod, mod - 2);
        vector<tuple<int, int, int>> data(m);
        for (auto& [l, r, v]: data) cin >> l >> r >> v;
        int ans = 0;
        for (const auto [_l, _r, v]: data) {
            const int l = v * k % mod;
            const int r = i * ((k - 1) * k / 2 % mod) % mod;
            const int t = (l + r) * i % mod;
            ans = (ans + t) % mod;
        }
        cout << ans << endl;
    }
}