Cod sursa(job #2271672)
Utilizator | Data | 29 octombrie 2018 08:24:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000003];
int nrp=0,n,i,j;
int main()
{
f>>n;
nrp=n-1;
v[0]=1;v[1]=1;
for(i=2;i<=sqrt(n)+1;i++)
if(v[i]==0)
for(j=i*2;j<=n;j+=i)
{
if(v[j]==0)
nrp--;
v[j]=1;
}
g<<nrp;
}