Codeforces · 2218C

The 67th Permutation Problem

This C++ solution uses mathematical reasoning for Codeforces 2218C The 67th Permutation Problem. Read the reasoning, inspect the code, or try your own test case below.

2218CMathMathematical reasoningC++39 lines
Solution216of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Mathematical reasoning

The 67th Permutation Problem matches the test input and the implementation's constructive permutation output.

Math

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

C_The_67_th_Permutation_Problem.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    void solve() {
        int n; cin >> n;
        n *= 3;
        vector<int> v;
        bool f = 1, s = 1;
        int cur = 1;
        int a = n;
        for (int i = 1; i <= n; i++) {
            if (f) {
                cout << cur << " ";
                f = 0;
                s = 1;
                cur++;
            } else {
                if (s) {
                    cout << a-- << " ";
                    s = 0;
                } else {
                    cout << a-- << " ";
                    f = 1;
                }
            }
        }
        cout << '\n';
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.