Pagini recente » Monitorul de evaluare | Istoria paginii utilizator/ungureanu_eduard | Monitorul de evaluare | Istoria paginii utilizator/l0lestefoartetare | Cod sursa (job #183732)
Cod sursa(job #183732)
#include<fstream.h>
#include<string.h>
int n,i,j,k,sol=0;
char v[36010][17],aux,a[17];
int main()
{
ifstream f("restante.in");
ofstream g("restante.out");
f>>n;f.get();
for(i=1;i<=n;i++)
{f.get(v[i],16);
f.get();
for(j=0;j<strlen(v[i])-1;j++)
for(k=j+1;k<strlen(v[i]);k++)
if(v[i][j]>v[i][k]) { aux=v[i][j]; v[i][j]=v[i][k]; v[i][k]=aux;}
}
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(strcmp(v[i],v[j])>0) { strcpy(a,v[i]);
strcpy(v[i],v[j]);
strcpy(v[j],a);
}
for(i=1;i<=n;i++)
if(strcmp(v[i],v[i+1])!=0) sol++;
else while (strcmp(v[i],v[i+1])==0) i++;
g<<sol;
f.close();
g.close();
return 0;
}