Cod sursa(job #1713854)
Utilizator | Data | 6 iunie 2016 19:41:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000005];
int N;
int main()
{
f>>N;
int p=0;
for(int i=2; i<=N; i++)
{
if(ciur[i]==0)
{
p++;
for(int m=1; m*i<=N; m++)
{
ciur[m*i]=1;
}
}
}
fout<<p;
return 0;
}