Submission #334893

#	Time	Username	Problem	Language	Result	Execution time	Memory
334893		tengiz05	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	364 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m, k;

void solve(int test_case){
	int i, j;
	cin >> n >> m;
	if(max(n,m)%min(n,m) == 0){
		if(n >= m){
			cout << n-1 << '\n';
			for(i=1;i<n;i++){
				cout << 1 << ' ';
			}cout << '\n';
		}else {
			cout << m-1 << '\n';
			for(i=1;i<m;i++){
				cout << -1 << ' ';
			}cout << '\n';
		}
	}else if(min(n, m) == 2){
		if(n >= m){
			cout << n << '\n';
			for(i=0;i<n;i++){
				if(i%2==0)cout << -2 << ' ' ;
				else cout << 3 << ' ' ;
			}cout << '\n';
		}else {
			cout << m << '\n';
			for(i=0;i<m;i++){
				if(i%2==0)cout << 2 << ' ' ;
				else cout << -3 << ' ' ;
			}cout << '\n';
		}
	}
	
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'void solve(long long int)':
sequence.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
   17 |  int i, j;
      |         ^

• 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