Pagini recente » Cod sursa (job #3210739) | Cod sursa (job #1792985) | Cod sursa (job #3144161) | Cod sursa (job #317782) | Cod sursa (job #468778)
Cod sursa(job #468778)
#include <fstream>
using namespace std;
char s[36001][17];
int nr,n,v[1<<16];
ifstream in("restante.in");
ofstream out("restante.out");
bool cmp(int a,int b)
{
for (int i=0;i<17;i++)
if (s[a][i]!=s[b][i])
return s[a][i]<s[b][i];
return true;
}
bool comp(char a[],char b[])
{
for (int i=0;i<17;i++)
if (a[i]!=b[i])
return true;
return false;
}
int main()
{
int i;
in>>n>>ws;
for (i=1;i<=n;i++)
{
in.getline(s[i],17);
sort(s[i],s[i]+strlen(s[i]));
v[i]=i;
}
sort(v+1,v+n+1,cmp);
for (i=1;i<=n;i++)
if (comp(s[v[i]],s[v[i-1]]) && comp(s[v[i]],s[v[i+1]]))
nr++;
out<<nr<<"\n";
return 0;
}