Pagini recente » Cod sursa (job #755667) | Cod sursa (job #2943059) | Cod sursa (job #2275949) | Cod sursa (job #2135453) | Cod sursa (job #802308)
Cod sursa(job #802308)
#include <fstream>
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
string a[36010];
int sol;
inline void Solve()
{
ifstream f("restante.in");
int n, poz = 0;
char x[20];
f>>n;
while(n--)
{
f>>x;
sort(x, x+strlen(x));
a[++poz] = x;
}
f.close();
sort(a+1, a+poz+1);
int i;
poz -= 1;
if (a[1] != a[2])
sol++;
for(i=2; i<=poz; i++)
{
if (a[i] != a[i-1] && a[i+1] != a[i])
sol++;
}
if (a[poz+1] != a[poz])
sol++;
}
inline void Write()
{
ofstream g("restante.out");
g<<sol<<"\n";
g.close();
}
int main()
{
Solve();
Write();
return 0;
}