Pagini recente » Cod sursa (job #2492840) | Cod sursa (job #1766058) | Cod sursa (job #367425) | Cod sursa (job #2868638) | Cod sursa (job #2028519)
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#define MAX 36001
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int ok[MAX];
int main()
{
string s[MAX];
int n; f>>n;
int i, j;
for( i = 1; i <= n ; i++)
{
f>>s[i];
sort(s[i].begin(), s[i].end());
}
int nr = 0;
for( i = 1; i <= n; i++){
for( j = i+1; j<= n; j++)
if(s[i].compare(s[j])==0 ){
ok[i] = 1;
ok[j] = 1;
}
if( ok[i] == 0)
nr++;
}
g << nr;
return 0;
}