Submission #879281

#TimeUsernameProblemLanguageResultExecution timeMemory
879281vjudge1Logičari (COCI21_logicari)C++17
0 / 110
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 10, MOD = 998244353; void test(){ int n,m; cin >> n >> m; if(max(n,m) % min(n,m) == 0){ if(n > m){ cout << n - 1 << '\n'; for(int i = 1;i <= n - 1;i++){ cout << 1 << ' '; } }else{ cout << m - 1 << '\n'; for(int i = 1;i <= m - 1;i++){ cout << -1 << ' '; } } cout << '\n'; }else{ cout << max(n,m) << '\n'; for(int i = 1;i <= max(n,m);i++){ if(i % 2 == 0){ cout << (n == 2 ? 2 : -2) << ' '; }else{ cout << (n == 2 ? -3 : 3) << ' '; } } cout << '\n'; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int T = 1; cin >> T; for(int i = 1;i <= T;i++) { test(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...