Pagini recente » Cod sursa (job #2143258) | Cod sursa (job #2300923) | Cod sursa (job #158655) | Cod sursa (job #1459077) | Cod sursa (job #906574)
Cod sursa(job #906574)
#include <fstream>
#include <string>
#include <string.h>
#include <algorithm>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int n, i, sol;
char x[20];
string a[36010];
int main(){
f>>n;
for(i=1; i<=n; i++)
{
f.get();
f.get(x, 16);
sort(x, x+strlen(x));
a[i]=x;
}
f.close();
sort(a+1, a+n+1);
n=1;
if(a[1]!=a[2])
sol++;
for(i=2; i<n; i++)
if(a[i]!=a[i-1] && a[i]!=a[i+1])
sol++;
if(a[n-1]!=a[n])
sol++;
g<<sol<<"\n";
g.close();
return 0;
}