Pagini recente » Cod sursa (job #2901376) | Cod sursa (job #2677570) | Cod sursa (job #2271341) | Cod sursa (job #891569) | Cod sursa (job #340263)
Cod sursa(job #340263)
#include "stdio.h"
#include <algorithm>
using namespace std;
int compare( const void *arg1, const void *arg2 )
{
/* Compare all of both strings: */
return strcmp( (char* ) arg1, ( char* ) arg2 );
}
int main(void)
{
FILE *in, *out;
if((in = fopen("restante.in", "r"))==NULL)
return -1;
if((out = fopen("restante.out", "w"))==NULL)
return -1;
char a[36000][16];
int N;
fscanf(in, "%d\n", &N);
for(int i=0; i<N; i++)
{
fscanf(in, "%s\n", a[i]);
sort(a[i], a[i]+strlen(a[i]));
}
qsort((void *)a, N, sizeof(char *), compare);
int count = 0;
for(int i=0; i<N-1; i++)
{
if(strcmp(a[i], a[i+1]))
count++;
}
fprintf(out, "%d\n", count);
fclose(in);
fclose(out);
}