A.Colorful Subsequence
AC人数较多
#include<bits/stdc++.h> using namespace std; long long book[100]; int main() { long long n; cin>>n; string s; cin>>s; for(int i=0;i<n;i++) { int pos=s[i]-‘a‘; book[pos]++; } long long ans=1; for(int i=0;i<100;i++) { ans=(ans*(book[i]+1))%(1000000007); } cout<<ans-1; return 0; }
B.Reversi
[1]:郑泽昊
G.轮回
原文:https://www.cnblogs.com/QLU-ACM/p/11191644.html