Submission

Score: 90

User: ChanakanStudy

Problemset: สุ่มสลับ

Language: cpp

Time: 0.190 second

Submitted On: 2026-10-11 10:03:37

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <climits>
#include <map>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    string s;
    cin >> s;
    string a = s;
    sort(a.begin() , a.end());
    ll count = 0;
    while(true) {
        if(a == s) {
            cout << count+1;
            return 0;
        }
        next_permutation(a.begin() , a.end());
        count++;
    }
    return 0;
}