Cod sursa(job #2238397)
| Utilizator | Data | 5 septembrie 2018 14:30:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int prim[2000001],N,i,j,cnt=0;
int main()
{
f>>N;
for(i=2; i<=N; i+=2)
if(!prim[i])
{
cnt++;
for(j=i+i; j<=N; j+=i)
prim[i]=1;
}
g<<cnt;
return 0;
}
