Cod sursa(job #1812784)
Utilizator | Data | 22 noiembrie 2016 13:35:50 | |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n,i,cnt;
string v[360010];
int main()
{
ifstream f("restante.in");
ofstream g("restante.out");
f>>n;
for(i=0; i<n; i++)
{
f>>v[i];
sort(v[i].begin(), v[i].end());
}
sort(v,v+n);
if(v[1]!=v[0]) cnt=1;
for(i=1; i<n; i++)
if(v[i-1]!=v[i]&&v[i]!=v[i+1])
cnt++;
g<<cnt<<'\n';
f.close(); g.close();
return 0;
}