제출 #1109217

#제출 시각아이디문제언어결과실행 시간메모리
1109217MuhammetNice sequence (IZhO18_sequence)C++17
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int t; cin >> t; while(t--){ int n, m; cin >> n >> m; vector <int> a(max(n,m)+1); int x = max(n,m)-(max(n,m) % 2 == 0); cout << x << "\n"; if(n < m){ for(int i = 1; i <= x; i++){ if(i % 2 == 1) cout << 4 << ' '; else cout << -5 << ' '; } } else { for(int i = 1; i <= x; i++){ if(i % 2 == 1) cout << -5 << ' '; else cout << 4 << ' '; } } 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...