Cod sursa(job #1560004)
| Utilizator | Data | 1 ianuarie 2016 13:17:28 | |
|---|---|---|---|
| Problema | Restante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <string.h>
#include <algorithm>
#define nMax 36001
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
string S[nMax];
int n, i, sol;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>S[i];
sort(S[i].begin(), S[i].end());
}
sort(S+1, S+n+1);
for(i=1;i<=n;i++)
if(S[i]!=S[i-1]&&S[i]!=S[i+1])
sol++;
fout<<sol;
return 0;
}
