Submission #684688

#	Time	Username	Problem	Language	Result	Execution time	Memory
684688		mychecksedad	Nice sequence (IZhO18_sequence)	C++17	0 / 100	1 ms	468 KiB

sequence

#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;
	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{
		assert(0);
		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();
	}
	return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24