Hot Air Ballooning (字符串分类）

https://nanti.jisuanke.com/t/17730

#include<cstdlib>#include<iostream>#include<set>#include<cstring>#include<map>#define maxz 1005#define maxn 20using namespace std;map<string,int>zm;string S;int n,ans;void solve(){map<char,int>bm;//记录每个字符串中有哪些不同字符出现 for(int i=0;i<S.size();i++){bm[S[i]]=1;}S="";for(char a='0';a<='9';a++){if(bm[a])S+=a;}S+='\0';//生成新的字符串 if(zm[S])//判断这个字符串是否出现过 return ;ans++;zm[S]=1;}int main(){while(cin>>n){ans=0;zm.clear();for(int i=0;i<n;i++){cin>>S;solve();}cout << ans << endl;}return 0;}