Pagini recente » Cod sursa (job #2602899) | Borderou de evaluare (job #1328305) | Cod sursa (job #496279) | Cod sursa (job #2893401) | Cod sursa (job #1811378)
#include <bits/stdc++.h>
using namespace std;
int N, ans;
string sir[36005];
inline void Read()
{
ifstream f("restante.in");
f >> N;
for(int i = 1; i < N; i++)
{
f >> sir[i];
sort(sir[i].begin(), sir[i].end());
}
f.close();
}
inline void Solve()
{
int i;
sort(sir, sir + N);
sir[N] = "";
if(sir[1] != sir[0]) ans = 1;
for(i = 1; i < N; i++)
if(sir[i] != sir[i - 1] && sir[i] != sir[i + 1])
ans++;
}
inline void Write()
{
ofstream g("restante.out");
g << ans << "\n";
g.close();
}
int main()
{
Read();
Solve();
Write();
return 0;
}