mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-02 23:56:29 +00:00
29 lines
458 B
C++
29 lines
458 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
||
|
using namespace std;
|
||
|
|
||
|
int n, ans, a[11], b[11];
|
||
|
|
||
|
bool cmp() {
|
||
|
for (int i = 0; i < n; i++) {
|
||
|
if (a[i] != b[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
int main() {
|
||
|
scanf("%d", &n);
|
||
|
for (int i = 0; i < n; i++) {
|
||
|
scanf("%1d", a + i);
|
||
|
b[i] = i + 1;
|
||
|
}
|
||
|
while (!cmp()) {
|
||
|
next_permutation(b, b + n);
|
||
|
ans++;
|
||
|
}
|
||
|
cout << ++ans << endl;
|
||
|
return 0;
|
||
|
}
|