Codeforces · 2211B

Mickey Mouse Constructive

This C++ solution uses simulation for Codeforces 2211B Mickey Mouse Constructive. Read the reasoning, inspect the code, or try your own test case below.

2211BImplementation & simulationSimulationC++43 lines
Solution141of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Mickey Mouse Constructive output requirements match the construction.

Implementation & simulation

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

B_Mickey_Mouse_Constructive.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    const int mod = 676767677;
    void solve() {
        int x, y; cin >> x >> y;
        int s = abs(x - y);
        if (s == 0) {
            cout << 1 << '\n';
            for (int i = 0; i < x; i++) cout << 1 << " ";
            for (int i = 0; i < y; i++) cout << -1 << " ";
            cout << '\n';
            return;
        }
        ll cnt = 0;
        for (int i = 1; i * i <= s; i++) {
            if (s % i == 0) {
                int j = s / i;
                cnt += (i == j ? 1 : 2);
            }
        }
        cout << cnt % mod << '\n';
        if (x >= y) {
            for (int i = 0; i < x; i++) cout << 1 << " ";
            for (int i = 0; i < y; i++) cout << -1 << " ";
            cout << '\n';
        } else {
            for (int i = 0; i < y; i++) cout << -1 << " ";
            for (int i = 0; i < x; i++) cout << 1 << " ";
            cout << '\n';
        }
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.