Cod sursa(job #1810565)
Utilizator | Data | 20 noiembrie 2016 10:58:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define Nmax 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[Nmax], nr, n;
int main()
{
f>>n;
for(int i=2;i*i<=n;i++)
{
if(v[i]==0)
{
for(int j=i*i; j<=n;j+=i)
{
v[j]=1;
}
}
}
for(int i=2;i<=n;i++)
if(v[i]==0)
nr++;
g<<nr;
return 0;
}