Advertisement
tanasaradu

Untitled

Oct 28th, 2017
71
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.31 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4. unordered_map<string,int>Q;
  5. string s;
  6. int n;
  7. int main()
  8. {
  9. int mx=-1;
  10. cin>>n;
  11. for(int i=1;i<=n;i++)
  12. {
  13. cin>>s;
  14. sort(s.begin(),s.end());
  15. ++Q[s];
  16. mx=max(mx,Q[s]);
  17. }
  18. cout<<mx<<"\n";
  19. return 0;
  20. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement