# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1238549 | SmuggingSpun | Nice sequence (IZhO18_sequence) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
int n, m;
namespace sub1{
void solve(){
cout << max(n, m) - 1 << "\n";
for(int i = max(n, m); i > 1; i--){
cout << (n < m ? "-1 " : "1 ");
}
cout << "\n";
}
}
namespace sub2{
void solve(){
if(n == 2){
cout << m << "\n" << "100000 ";
for(int i = 1; i < m; i++){
cout << ((i & 1) ? "-99999 " : "100000 ");
}
cout << "\n";
}
else{
cout << n << "\n" << "-100000 ";
for(int i = 1; i < n; i++){
cout << ((i & 1) ? "99999 " : "-100000 ");
}
cout << "\n";
}
}
}
namespace sub34567{
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
int _t;
cin >> _t;
for(int _ = 0; _ < _t; _++){
cin >> n >> m;
if(max(n, m) % min(n, m) == 0){
sub1::solve();
}
else if(min(n, m) == 2){
sub2::solve();
}
else{
sub34567::solve();
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |