제출 #879294

#제출 시각아이디문제언어결과실행 시간메모리
879294vjudge1Nice sequence (IZhO18_sequence)C++17
15 / 100
6 ms1116 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{ int res[N]; cout <<max(n,m) << '\n'; for(int i = 1;i <= max(n,m);i++){ if(i % 2){ res[i] = (2e5); }else{ res[i] = (2e5 + 1) * (-1); } } for(int i = 1;i <= max(n,m);i++){ cout << res[i] * (n == min(n,m) ? 1 : -1) << ' '; } 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...