#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
const int E = 1e6+777;
const long long inf = 1e18+777;
const int N = 1e5+777;
const int MOD = 1e9+7;
const bool I = 1;
int main(){auto solve=[&](){
int n, m;
cin >> n >> m;
if(n == 2){
if(m % 2 == 0) --m;
cout << m << '\n';
for(int i = 1; i <= m; ++i){
if(i & 1) cout << "444441 ";
else cout << "-444442 ";
}
cout << '\n';
}else if(m == 2){
if(n % 2 == 0) -- n;
cout << n << '\n';
for(int i = 1; i <= n; ++i){
if(i & 1) cout << "-444441 ";
else cout << "444442 ";
}
cout << '\n';
}else{
if(m % n == 0 && m >= n){
cout << m - 1 << '\n';
for(int i = 1; i < m; ++i) cout << "-1 ";
cout << '\n';
}else if(n % m == 0 && n >= m){
cout << n - 1 << '\n';
for(int i = 1; i < n; ++i) cout << "1 ";
cout << '\n';
}else{
cout << "0\n";
}
}
};NFS;int T=1;if(I)cin>>T;while(T--)solve();}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Ok |
2 |
Correct |
1 ms |
204 KB |
Ok |
3 |
Correct |
0 ms |
204 KB |
Ok |
4 |
Correct |
1 ms |
316 KB |
Ok |
5 |
Correct |
1 ms |
204 KB |
Ok |
6 |
Correct |
1 ms |
312 KB |
Ok |
7 |
Correct |
1 ms |
204 KB |
Ok |
8 |
Correct |
1 ms |
304 KB |
Ok |
9 |
Correct |
1 ms |
312 KB |
Ok |
10 |
Correct |
1 ms |
316 KB |
Ok |
11 |
Correct |
1 ms |
312 KB |
Ok |
12 |
Correct |
0 ms |
204 KB |
Ok |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Ok |
2 |
Correct |
1 ms |
204 KB |
Ok |
3 |
Correct |
1 ms |
204 KB |
Ok |
4 |
Correct |
0 ms |
204 KB |
Ok |
5 |
Correct |
1 ms |
204 KB |
Ok |
6 |
Correct |
1 ms |
332 KB |
Ok |
7 |
Correct |
3 ms |
844 KB |
Ok |
8 |
Correct |
2 ms |
588 KB |
Ok |
9 |
Correct |
4 ms |
1044 KB |
Ok |
10 |
Correct |
2 ms |
716 KB |
Ok |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Ok |
2 |
Correct |
1 ms |
204 KB |
Ok |
3 |
Correct |
0 ms |
204 KB |
Ok |
4 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 0 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 5, pans = 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Ok |
2 |
Correct |
1 ms |
204 KB |
Ok |
3 |
Correct |
0 ms |
204 KB |
Ok |
4 |
Correct |
1 ms |
316 KB |
Ok |
5 |
Correct |
1 ms |
204 KB |
Ok |
6 |
Correct |
1 ms |
312 KB |
Ok |
7 |
Correct |
1 ms |
204 KB |
Ok |
8 |
Correct |
1 ms |
304 KB |
Ok |
9 |
Correct |
1 ms |
312 KB |
Ok |
10 |
Correct |
1 ms |
316 KB |
Ok |
11 |
Correct |
1 ms |
312 KB |
Ok |
12 |
Correct |
0 ms |
204 KB |
Ok |
13 |
Correct |
1 ms |
204 KB |
Ok |
14 |
Correct |
1 ms |
204 KB |
Ok |
15 |
Correct |
0 ms |
204 KB |
Ok |
16 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 0 |
17 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Ok |
2 |
Correct |
1 ms |
204 KB |
Ok |
3 |
Correct |
0 ms |
204 KB |
Ok |
4 |
Correct |
1 ms |
316 KB |
Ok |
5 |
Correct |
1 ms |
204 KB |
Ok |
6 |
Correct |
1 ms |
312 KB |
Ok |
7 |
Correct |
1 ms |
204 KB |
Ok |
8 |
Correct |
1 ms |
304 KB |
Ok |
9 |
Correct |
1 ms |
312 KB |
Ok |
10 |
Correct |
1 ms |
316 KB |
Ok |
11 |
Correct |
1 ms |
312 KB |
Ok |
12 |
Correct |
0 ms |
204 KB |
Ok |
13 |
Correct |
1 ms |
204 KB |
Ok |
14 |
Correct |
1 ms |
204 KB |
Ok |
15 |
Correct |
1 ms |
204 KB |
Ok |
16 |
Correct |
0 ms |
204 KB |
Ok |
17 |
Correct |
1 ms |
204 KB |
Ok |
18 |
Correct |
1 ms |
332 KB |
Ok |
19 |
Correct |
3 ms |
844 KB |
Ok |
20 |
Correct |
2 ms |
588 KB |
Ok |
21 |
Correct |
4 ms |
1044 KB |
Ok |
22 |
Correct |
2 ms |
716 KB |
Ok |
23 |
Correct |
1 ms |
204 KB |
Ok |
24 |
Correct |
1 ms |
204 KB |
Ok |
25 |
Correct |
0 ms |
204 KB |
Ok |
26 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 0 |
27 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Ok |
2 |
Correct |
1 ms |
204 KB |
Ok |
3 |
Correct |
0 ms |
204 KB |
Ok |
4 |
Correct |
1 ms |
316 KB |
Ok |
5 |
Correct |
1 ms |
204 KB |
Ok |
6 |
Correct |
1 ms |
312 KB |
Ok |
7 |
Correct |
1 ms |
204 KB |
Ok |
8 |
Correct |
1 ms |
304 KB |
Ok |
9 |
Correct |
1 ms |
312 KB |
Ok |
10 |
Correct |
1 ms |
316 KB |
Ok |
11 |
Correct |
1 ms |
312 KB |
Ok |
12 |
Correct |
0 ms |
204 KB |
Ok |
13 |
Correct |
1 ms |
204 KB |
Ok |
14 |
Correct |
1 ms |
204 KB |
Ok |
15 |
Correct |
1 ms |
204 KB |
Ok |
16 |
Correct |
0 ms |
204 KB |
Ok |
17 |
Correct |
1 ms |
204 KB |
Ok |
18 |
Correct |
1 ms |
332 KB |
Ok |
19 |
Correct |
3 ms |
844 KB |
Ok |
20 |
Correct |
2 ms |
588 KB |
Ok |
21 |
Correct |
4 ms |
1044 KB |
Ok |
22 |
Correct |
2 ms |
716 KB |
Ok |
23 |
Correct |
1 ms |
204 KB |
Ok |
24 |
Correct |
1 ms |
204 KB |
Ok |
25 |
Correct |
0 ms |
204 KB |
Ok |
26 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 0 |
27 |
Halted |
0 ms |
0 KB |
- |