cses day1 problems solutions

permutations.cpp

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

void solution(){
    int n;
    cin >> n;
    if(n==1){
        cout << 1 << endl;
    } else if(n<=3){
        cout << "NO SOLUTION" << endl;
    } else{
        for(int i=0; i<n; i++){
            if((i+1)%2==0){
                cout << i+1 << " ";
            }
        }
        for(int i=0; i<n; i++){
            if((i+1)%2==1){
                cout << i+1 << " ";
            }
        }
        cout << "\n";
    }
}

int main() {
    int T=1;
    // cin >> T;
    for(int t=0; t<T; t++) {
        solution();
    }
    return 0;
}