Cod sursa(job #1982029)
Utilizator | Data | 17 mai 2017 16:24:27 | |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int n,sol;
string s[36003];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
{
f>>s[i];
sort(s[i].begin(),s[i].end());
}
sort(s+1,s+n+1);
for(int i=1;i<=n;++i) if(s[i]!=s[i-1]&&s[i]!=s[i+1]) ++sol;
g<<sol;
return 0;
}