| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 92857 | davitmarg | Nice sequence (IZhO18_sequence) | C++17 | 2 ms | 256 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.
/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>
#include <cassert>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;
int t,n, m;
bool sw;
vector<int> a;
int main()
{
cin >> t;
while (t--)
{
cin >> n >> m;
sw = 0;
a.resize(0);
if (n < m)
{
sw = 1;
swap(n, m);
}
if (m == 2)
{
if (n % 2)
{
for (int i = 0; i < n - 1; i++)
if (i % 2 == 0)
a.PB(1);
else
a.PB(-2);
a.PB(3);
}
cout << a.size() << endl;
if (a.size() != 0)
{
for (int i = 0; i < a.size(); i++)
cout << a[i] * (2 * (!sw) - 1) << " ";
cout << endl;
}
}
}
return 0;
}
/*
*/
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... | ||||
