제출 #879288

#제출 시각아이디문제언어결과실행 시간메모리
879288The_SamuraiNice sequence (IZhO18_sequence)C++17
6 / 100
0 ms348 KiB
// 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 (n == min(n, m)) out(vector(m - 1, -1));
        else out(vector(n - 1, 1));
}

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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...