Cod sursa(job #2377407)
Utilizator | Data | 10 martie 2019 10:58:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000001];
int cnt;
int main()
{
int n;
f>>n;
f.close();
for(int i=2;i<=sqrt(n);i++)
{
if(v[i]==0)
{
for(int j=i;j<=n/i;j++)
{
v[i*j]=1;
}
}
}
for(int i=2;i<=n;i++)
{
if(v[i]==0)
cnt++;
}
g<<cnt;
g.close();
return 0;
}