# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
501285 | dostigator | Nice sequence (IZhO18_sequence) | C++17 | 1 ms | 316 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.
// author lox:(
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
using namespace std;
#define popcnt __builtin_popcount
#define all(a) a.begin(),a.end()
#define low_b lower_bound
#define up_b upper_bound
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define mii map<int,int>
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define endl '\n'
#define Y second
#define X first
typedef long double ld;
typedef long long ll;
const int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1},col=107,N=3e5+777;
const ll mod=1e9+7,inf=1e18;
void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
ll binpow(ll n,ll k){if(k<0)return 0ll;if(k==0)return 1ll;if(k%2)return (binpow(n,k-1)*n)%mod;ll kk=binpow(n,k/2)%mod;return (kk*kk)%mod;}
void solve(){
int n,m;
cin>>n>>m;
if(max(n,m)%min(n,m)==0){//correct;
cout<<max(n,m)-1<<endl;
if(n>m){
for(int i=1; i<n; ++i)
cout<<i<<' ';
cout<<endl;
return;
}
if(n<=m){
for(int i=1; i<m; ++i)
cout<<-i<<' ';
cout<<endl;
return;
}
return;
}
cout<<max(n,m)<<endl;
if(n<m){
if(!(m % 2)) m--;
cout << m << "\n";
for(ll i = 1; i <= m / 2 - 1; i++) {
cout << -m << " " << m + 1 << " ";
}
cout << (m + 1) << "\n";
return;
}
if(!(n % 2)) n--;
cout << n << "\n";
for(ll i = 1; i <= n / 2 - 1; i++) {
cout << n << " " << -(n + 1) << " ";
}
cout << -(n + 1) << "\n";
return;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//fre_open
ll tt=1;
cin>>tt;
while(tt--) 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... |