Pagini recente » Cod sursa (job #2745136) | Cod sursa (job #45682) | Cod sursa (job #2096539) | Cod sursa (job #679345) | Cod sursa (job #294165)
Cod sursa(job #294165)
#include<fstream>
using namespace std;
int m[36001][27];
int main()
{
ifstream f1 ("restante.in");
ofstream f2 ("restante.out");
int n,i,j,k,f,nr=0,id;
char c;
f1>>n;
for (i=1; i<=n+1; i++)
while (f1.get(c) && int(c)>=97) m[i-1][int(c)-96]++;
for (i=1; i<=n; i++)
{f=1;
for (j=1; j<=n; j++)
{id=1;
for (k=1; k<=26; k++) if (m[i][k]!=m[j][k]) id=0;
if (i==j) id=0;
if (id==1) f=0;
}
if(f==1)nr++;
}
f2<<nr;
return 0;
}