Cod sursa(job #1720689)
Utilizator | Data | 23 iunie 2016 09:31:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,cnt;
char prim[2000005];
int main()
{
f>>n;
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=2;i<=n;i++)
if(prim[i])
{
cnt++;
for(int j=i+i;j<=n;j+=i)
prim[j]=0;
}
g<<cnt;
return 0;
}