Submission
Status:
PPPPPPPPPPPPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: nicekrittaphat
Problemset: สุ่มสลับ
Language: cpp
Time: 0.004 second
Submitted On: 2026-10-13 19:41:36
#include<iostream>
using namespace std;
long long factorial(int n){
long long sum = 1;
while(n>1){
sum *= n;
n--;
}
return sum;
}
int main(){
int n;
string s;
cin>>n>>s;
bool alphabet[26] = {false};
long long count1 = 1;
int ind=0;
while(n>0){
int val=0;
for(int i=0;i<s[ind]-'A';i++){
if(!alphabet[i]){
val++;
}
}
count1 += factorial(n-1)*val;
alphabet[s[ind]-'A'] = true;
n--;
ind++;
}
cout<<count1;
}