제출 #334852

#제출 시각아이디문제언어결과실행 시간메모리
334852amunduzbaevNice sequence (IZhO18_sequence)C++14
0 / 100
1 ms364 KiB
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 2000;

int n, m;

void solve(){
	
	cin>>n>>m;
	if(n == m){
		cout<<n-1<<"\n";
		for(int i=0;i<n-1;i++) cout<<1<<" ";
		cout<<"\n";
		return;
	}
	if(n % m == 0 && n > m){
		cout<<n-1<<"\n";
		for(int i=0;i<n-1;i++) cout<<-1<<" ";
		cout<<"\n";
		return;
	}
	if(m % n == 0 && m > n){
		cout<<m-1<<"\n";
		for(int i=0;i<m-1;i++) cout<<1<<" ";
		cout<<"\n";
		return;
	}
	return;
}

int main(){
	fastios
	int t = 1;
	cin>>t;
	while(t--) solve();
	return 0;
}

#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...