Cod sursa(job #2028523)
Utilizator | Rodica Vasilescu Rodik_Rody | Data | 27 septembrie 2017 23:22:57 |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#define MAX 36001
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
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());
}
sort(s+1, s+n+1);
int nr = 0;
for( i = 1; i <= n; i++)
if(s[i]!= s[i-1] && s[i] != s[i+1] )
nr++;
g << nr;
return 0;
}