Cod sursa(job #2146593)
Utilizator | Data | 28 februarie 2018 08:11:47 | |
---|---|---|---|
Problema | Aria | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <bitset>
using namespace std;
bitset <100001> a;
int main()
{
int n, i, x, nr1=0, lg, lgmax, st, dr, swapuri=0, j;
cin >> n;
for (i=1; i<=n; i++)
{
cin >> x;
if (x)
{
a[i]=1;
nr1++;
}
}
cout << n-2*nr1;
return 0;
}