Submission #887394

#TimeUsernameProblemLanguageResultExecution timeMemory
887394pccNice sequence (IZhO18_sequence)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define pii pair<int,int> #define fs first #define sc second #define tlll tuple<ll,ll,ll> void solve(){ int n,m; cin>>n>>m; int sign = 1; if(m>n){ sign = -1; swap(n,m); } if(n%2 == 0){ cout<<n-1<<'\n'; for(int i = 1;i<n;i++)cout<<(i&1?sign:-sign*2)<<' '; cout<<'\n'; } else{ cout<<n<<'\n'; for(int i = 1;i<=n;i++)cout<<(i&1?2*sign:-3*sign)<<' '; cout<<'\n'; } return; } int main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t;cin>>t; while(t--)solve(); }
#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...