Pagini recente » Cod sursa (job #1453463) | Problema satisfiabilităţii formulelor logice de ordinul doi | Cod sursa (job #1531129) | Cod sursa (job #1808764) | Cod sursa (job #125792)
Cod sursa(job #125792)
#include <stdio.h>
#include <algorithm>
#include <set>
#include <vector>
#include <string>
using namespace std;
#define in "restante.in"
#define out "restante.out"
int N;
string A;
vector<string> S;
set<string> P;
int main()
{
char linie[19];
FILE *fin = fopen(in,"r");
freopen(out,"w",stdout);
fscanf(fin,"%d\n", &N);
for ( int i = 1; i <= N; i++ )
{
int j = 0;
A = "";
fgets(linie,18,fin);
while ( linie[j] >= 'a' && linie[j] <= 'z' ) A += linie[j], ++j;
sort(A.begin(),A.end());
S.push_back(A);
}
int T = 0;
for ( int i = 1; i < S.size(); i++ )
if ( S[i] != S[i-1] ) T += 1;
printf("%d", T);
}