| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 334895 | beksultan04 | Nice sequence (IZhO18_sequence) | C++14 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
main(){
int t;
scan1(t)
while (t--){
int n,m,i,mx,mn;
scan2(n,m)
mx = max(m,n);
mn = min(m,n);
if (m == 2){
cout <<n<<"\n";
for (i=0;i<n;++i){
if (i%2 == 0)cout <<"-199999999 ";
else cout <<"200000000 ";
}
}
else if (n == 2){
cout <<m<<"\n";
for (i=0;i<m;++i){
if (i%2 == 0)cout <<"199999999 ";
else cout <<"-200000000 ";
}
}
else {
cout <<mx-1<<"\n";
if (n > m){
for (i=1;i<n;++i)cout <<"1 ";
endi;
}
else {
for (i=1;i<m;++i)cout <<"-1 ";
endi;
}
}
}
}
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... | ||||
