Cod sursa(job #1486664)
Utilizator | Data | 15 septembrie 2015 12:38:42 | |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream>
#include<algorithm>
#include<string>
using namespace std;
int n,i,l;
string s[36010];
int main() {
ifstream f("restante.in");
ofstream g("restante.out");
f>>n;
for(i=1;i<=n;i++)
f>>s[i],sort(s[i].begin(),s[i].end());
sort(s+1,s+n+1);
for(i=1;i<=n;i++)
if(s[i]!=s[i-1]&&s[i]!=s[i+1])
l++;
g<<l;
}