Submission #879287

# Submission time Handle Problem Language Result Execution time Memory
879287 2023-11-27T05:37:38 Z The_Samurai Nice sequence (IZhO18_sequence) C++17
6 / 100
1 ms 348 KB
// 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';
    }
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 1 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 0 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 344 KB Ok
11 Correct 0 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Jury has the better answer : jans = 3, pans = 0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 1 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 0 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 344 KB Ok
11 Correct 0 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
13 Incorrect 0 ms 348 KB Jury has the better answer : jans = 3, pans = 0
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 1 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 0 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 344 KB Ok
11 Correct 0 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
13 Incorrect 0 ms 348 KB there is incorrect sequence
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 1 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 0 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 344 KB Ok
11 Correct 0 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
13 Incorrect 0 ms 348 KB there is incorrect sequence
14 Halted 0 ms 0 KB -