답안 #334880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334880 2020-12-10T06:58:32 Z tengiz05 Nice sequence (IZhO18_sequence) C++17
0 / 100
1 ms 384 KB
#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(n >= m){
		cout << n-1 << '\n';
		for(i=1;i<n;i++){
			cout << 1 << ' ';
		}cout << '\n';
	}
	if(max(n,m)%min(n,m) == 0){
		cout << 0 << "\n\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

sequence.cpp: In function 'void solve(long long int)':
sequence.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
   17 |  int i, j;
      |         ^
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 1, pans = 0
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 3, pans = 0
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 3, pans = 0
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 3, pans = 0
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 1, pans = 0
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 1, pans = 0
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Jury has the better answer : jans = 1, pans = 0
2 Halted 0 ms 0 KB -