Cod sursa(job #2557698)
| Utilizator | Data | 25 februarie 2020 22:35:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool prim[2000005];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,j,nr=0,n;
f>>n;
for(i=2;i<=n;i++)
if(!prim[i])
{
nr++;
for(j=i+i;j<=n;j+=i)
prim[j]=true;
}
g<<nr;
return 0;
}
