SRM496 Div2 Easy(250) AnagramFree
#include <string> #include <vector> #include <algorithm> #include <set> using namespace std; class AnagramFree{public: int getMaximumSubset( vector <string> S ) { for ( vector<string>::iterator it=S.begin(); it!=S.end(); it++ ) sort(it->begin(),it->end()); return (int)set<string>(S.begin(),S.end()).size(); }};