Cod sursa(job #654193)
| Utilizator | Data | 29 decembrie 2011 20:12:56 | |
|---|---|---|---|
| Problema | Restante | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int n,d[36001];
string a[36001];
int main(void){
register int i,j;
f>>n;
f.get();
for(i=1;i<=n;i++){
f>>a[i];
sort(a[i].begin(),a[i].end());
}
sort(a+1,a+n+1);
int nr=0;
for(i=2;i<=n;i++)
if(a[i]!=a[i-1] && a[i]!=a[i+1])
nr++;
g<<nr<<"\n";
f.close();
g.close();
return 0;
}