Cod sursa(job #2437608)
Utilizator | Data | 9 iulie 2019 20:01:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int main()
{
int c=0,n;
int prim[2000006];
fi>>n;
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=2;i<=n;i++)
if(prim[i])
{
c++;
for(int j=i+i;j<=n;j+=i)
prim[j]=0;
}
fo<<c;
return 0;
}