Submission #684699

#TimeUsernameProblemLanguageResultExecution timeMemory
684699mychecksedadNice sequence (IZhO18_sequence)C++17
15 / 100
8 ms724 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int ll; #define pb push_back #define MOD (1e9+7) #define all(x) x.begin(), x.end() const int N = 1e6, K = 20; int n, m, sw = 1; vector<int> ans; void solve(){ cin >> n >> m; sw = 1; if(n < m){ swap(n, m); sw = -1; } if(n % m == 0){ cout << n - 1 << '\n'; for(int i = 0; i < n - 1; ++i) cout << sw << ' '; return; }else{ cout << n << '\n'; for(int i = 0; i < n; ++i){ if(i % 2) cout << sw * (n/2 + 2) << ' '; else cout << sw * -(n/2+1) << ' '; } return; } } int main(){ cin.tie(0); ios::sync_with_stdio(0); int t; cin >> t; while(t--){ solve(); cout << '\n'; } return 0; }
#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...