Cod sursa(job #2397914)
Utilizator | Data | 4 aprilie 2019 21:19:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<bits/stdc++.h>
using namespace std;
long long int v[2000005],c;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long int n;
fin>>n;
for( long long int i=2; i<=n; i++)
{
if(v[i]==0)
{
for(long long int j=i*i; j<=n; j+=i)
{
v[j]=1;
}
}
}
for( long long int i=2; i<=n; i++)
{
if(v[i]==0) c++;
}
fout<<c;
return 0;
}