Cod sursa(job #668322)
Utilizator | Poenar Liana bia.lili | Data | 24 ianuarie 2012 18:21:12 |
---|---|---|---|
Problema | Restante | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int n;
int main()
{
int i,j;
char a[37001];
f>>n;
for(i=1;i<=n;i++){
f>>a[i];
}
sort(a+1,a+n+1);
int nr=0;
for(i=2;i<=n;i++)
if(a[i]!=a[i-1] && a[i]!=a[i+1])
nr++;
g<<nr<<"\n";
f.close();
g.close();
return 0;
}