제출 #495844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495844		Mukhitali	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	256 KiB

sequence

//bit chass 1
#include <bits/stdc++.h>

#define x first
#define y second
#define el "\n"
#define ll long long
#define pb push_back
#define pll pair <ll, ll>
#define pii pair <int, int>
#define all(x) x.begin(), x.end()
#define lca(x,y) x * y / __gcd(x, y)
#define ibase ios_base::sync_with_stdio(0), cin.tie(0)

using namespace std;

const int N = 2e5 + 5, inf = 1e9 + 7, M = 2e6, MM = 2e6 + 5, K = 300;
const ll MI = 2e18;
const double P = 3.14;



void solve() {
	int n, m;
	cin >> n >> m;
	bool ok = (n <= m);
	if (n > m)
		swap(n, m);
	if (m % n == 0) {
		cout << m - 1 << el;
		for (int i = 1; i < m; i++) {
			if (ok)
				cout << "-1 ";
			else 
				cout << "1 ";
		}
		return;
	}
	ll k = m / n;
		cout << k + (k + 1) * (n - 1) << el;
	for (int i = 1; i <= k; i++) {
		if (i == 1) {
			for (int j = 1; j < n; j++) {
				if (ok)
					cout << "10 ";
				else 
					cout << "-10 ";
			}
		}
		if (ok)
			cout << -(n - 1) * 10 - 1 << ' ';
		else 
			cout << (n - 1) * 10 + 1 << ' ';
		for (int j = 1; j < n; j++) {
			if (ok)
				cout << "10 ";
			else 
				cout << "-10 ";
		}
	}
}

int main() {
	ibase;
	int T = 1;
	cin >> T;
	for (int i = 1; i <= T; i++) {
//		cout << "Case " << i << ": ";
		solve();
		cout << el;
	}
}

• Subtask 1: 6 / 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