Cod sursa(job #2391197)
Utilizator | Data | 28 martie 2019 18:30:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n,i,nr=0,j;
in>>n;
for(i=2;i<=n;i++)
{
if(v[i]!=1)
{
j=i;
while(j<=n)
{
j=j+i;
v[j]=1;
}
}
}
for(i=2;i<=n;i++)
if(v[i]==0)
nr++;
out<<nr;
return 0;
}