1818B - Indivisible - CodeForces Solution


constructive algorithms *900

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fn(n) for (int i = 0; i < n; i++)
#define fne(n) for (int i = 1; i <= n; i++)
#define fin(x, n) for (int i = x; i < n; i++)
#define fine(x, n) for (int i = x; i <= n; i++)
#define endl "\n"
#define pb push_back
#define msdfan                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);

void solve()
{
  int n;
  cin>>n;
  
  if(n==1) 
  {
      cout<<1<<endl;
      return;
  }
  if(n%2!=0) 
  {
      cout<<"-1"<<endl;
      return;
  }
  vector<int> v(n+1);
  for(int i=1;i<=n;i++)
  {
      v[i]=i;
  }
  for(int i=1;i<=n;i=i+2)
  {
      swap(v[i],v[i+1]);
  }
  for(int i=1;i<=n;i++)
  {
      cout<<v[i]<<" ";
  }
  cout<<endl;
}


int main()
{
    msdfan;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ll t1 = 1;
    cin >> t1;
    while (t1--)
    {
        solve();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract
490C - Hacking Cypher
158B - Taxi
41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five