Submission #879287

#	Time	Username	Problem	Language	Result	Execution time	Memory
879287		The_Samurai	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	348 KiB

sequence

// I stand with PALESTINE




//#pragma GCC optimize("Ofast,O3")
//#pragma GCC target("avx,avx2")
#include "bits/stdc++.h"

using namespace std;
using ll = long long;

void out(vector<int> a) {
    cout << a.size() << '\n';
    if (a.empty()) return;
    for (int x: a) cout << x << ' ';
    cout << '\n';
}

void solve() {
    int n, m;
    cin >> n >> m;
    if (max(n, m) % min(n, m) == 0) {
        if (n == min(n, m)) out(vector(m - 1, -1));
        else out(vector(n - 1, 1));
        return;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
#ifdef sunnatov
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int q = 1;
    cin >> q;
    while (q--) {
        solve();
        cout << '\n';
    }
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24