Submission #887399

#TimeUsernameProblemLanguageResultExecution timeMemory
887399pccNice sequence (IZhO18_sequence)C++14
0 / 100
1 ms596 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>

const int big = 1e8;

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?-big*sign:(big-1)*sign)<<' ';
		cout<<'\n';
	}
	else{
		cout<<n<<'\n';
		for(int i = 1;i<=n;i++)cout<<(i&1?-big*sign:(big-1)*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...