Pagini recente » Cod sursa (job #3362980) | Cod sursa (job #3363063) | Cod sursa (job #3362969) | Cod sursa (job #3363041) | Cod sursa (job #3362987)
#include <iostream>
#include <fstream>
using namespace std;
const int N = 2000000;
bool ciur[N + 1];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,i,j,nr=0;
fin >> n;
for(int i = 0; i < n; i++)
fin >> ciur[i];
for(int i = 2; i <= n; i++)
{
if(ciur[i] == 0)
{
for(j = 1; j <= n; j+=i)
{
if(ciur[j] == 0)
ciur[j] = i;
}
nr++;
}
}
fout << nr;
return 0;
}