Cod sursa(job #3258858)
| Utilizator | Data | 23 noiembrie 2024 21:10:34 | |
|---|---|---|---|
| Problema | Restante | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int main()
{
int n, cnt = 0;
bool original = true;
fin >> n;
char cuv[36001][17];
for (int i = 0; i < n; i++)
{
fin >> cuv[i];
sort(cuv[i], cuv[i] + strlen(cuv[i]) + 1);
}
for (int i = 0; i < n; i++)
{
original = true;
for (int j = i + 1; j < n; j++)
{
if (strcmp(cuv[i], cuv[j]) == 0)
{
original = false;
break;
}
}
if (original)
{
cnt++;
}
}
fout << cnt;
return 0;
}