Cod sursa(job #1920438)
Utilizator | Data | 10 martie 2017 00:41:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int i,j,n,cnt;
bool prim[2000001];
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2;i<=n;i++)prim[i]=true;
for(i=1;i<=n;i++){
if(prim[i])
{++cnt;
for(j=i+i;j<=n;j+=i)
prim[j]=false;
}
}out<<cnt;
}