303A - Lucky Permutation Triple - CodeForces Solution


constructive algorithms implementation math *1300

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;

#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define endl "\n"
#define ll long long

void solve(){ 
    ll n;cin>>n;
    
    if(n%2==0){
        cout<<"-1\n";
        return ;
    }
    for (int i = 0; i < n; i++){
        cout<<i<<" ";
    }
    cout<<endl;
    for (int i = 0; i < n; i++){
        cout<<(i+1)%n<<" ";
    }
    cout<<endl;
    for (int i = 0; i < n; i++){
        cout<<(2*i + 1)%n<<" ";
        
    }
    cout<<endl;
    
    
    
}

int32_t main(){
    IOS;
    // ll t;
    // cin>>t;
    // while(t--){
        solve();
    // }

    return 0;
}


Comments

Submit
0 Comments
More Questions

903C - Boxes Packing
887A - Div 64
755B - PolandBall and Game
808B - Average Sleep Time
1515E - Phoenix and Computers
1552B - Running for Gold
994A - Fingerprints
1221C - Perfect Team
1709C - Recover an RBS
378A - Playing with Dice
248B - Chilly Willy
1709B - Also Try Minecraft
1418A - Buying Torches
131C - The World is a Theatre
1696A - NIT orz
1178D - Prime Graph
1711D - Rain
534A - Exam
1472A - Cards for Friends
315A - Sereja and Bottles
1697C - awoo's Favorite Problem
165A - Supercentral Point
1493A - Anti-knapsack
1493B - Planet Lapituletti
747B - Mammoth's Genome Decoding
1591C - Minimize Distance
1182B - Plus from Picture
1674B - Dictionary
1426C - Increase and Copy
520C - DNA Alignment