Cod sursa(job #2262910)
Utilizator | Data | 17 octombrie 2018 22:09:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#define MAX 2000000
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool v[MAX];
void Vector(int N)
{
int i,j;
v[0]=0;
for(i=2;i<=N;i++)
if(v[i]==0)
{v[0]++;
for(j=2;j*i<=N;j++)
v[i*j]=1;
}
g<<v[0];
}
int main()
{int N;
f>>N;
Vector(N);
return 0;
}