Codeforces-Codes/A_Divisible_Array.cpp at main · iaayushmaan/Codeforces-Codes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define loop(o, n) for (int i = 0; i < n; i++)
#define py cout << "YES" << endl
#define pn cout << "NO" << endl
using namespace std;
// #define m 1e9+7

int main()
{
    int t = 1;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        int odd = 1, eve = 2;
        if (n % 2 == 0)
        {
            for (int i = 0; i < n; i++)
            {

                cout << eve << " ";
                eve += 2;
            }
        }
        else
        {
            for (int i = 0; i < n; i++)
            {

                cout << odd << " ";
                odd++;
            }
        }
        cout << endl;
    }
    return 0;
}