제출 #334850

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334850		amunduzbaev	Nice sequence (IZhO18_sequence)	C++14	0 / 100	1 ms	364 KiB

sequence

#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;
}

• 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