Submission #385537

#	Time	Username	Problem	Language	Result	Execution time	Memory
385537		vanic	Nice sequence (IZhO18_sequence)	C++14	0 / 100	2 ms	768 KiB

sequence

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cassert>

using namespace std;

void solve(){
	int n, m;
	cin >> n >> m;
	assert(n!=3 && m!=3);
	int sol=n-1;
	if(n>m){
		sol=(n+m-1)/m*m-1;
		cout << sol <<  '\n';
		int br=(sol+m-1)/m+1;
		for(int i=1; i<=sol; i++){
			if(i%m){
				cout << -br << ' ';
			}
			else{
				cout << br*(m-1)+1 << ' ';
			}
		}
		cout << '\n';
	}
	else if(n<m){
		sol=(n+m-1)/n*n-1;
		cout << sol <<  '\n';
		int br=(sol+n-1)/n+1;
		for(int i=1; i<=sol; i++){
			if(i%n){
				cout << br << ' ';
			}
			else{
				cout << -br*(n-1)-1 << ' ';
			}
		}
		cout << '\n';
	}
	else{
		cout << n-1 << '\n';
		for(int i=0; i<n-1; i++){
			cout << 1 << ' ';
		}
		cout << '\n';
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(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