Cod sursa(job #1606218)
Utilizator | Data | 20 februarie 2016 00:59:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,a,c,v[2000001];
int main()
{
f>>n;
for(int i=2;i<=n;i++)
v[i]=1;
for(int i=2;i<=sqrt(n);i++)
{
if(v[i]!=0)
{
a=i*2;
c=2;
while(a<=n)
{
v[a]=0;
c++;
a=i*c;
}
}
}
for(int i=2;i<=n;i++)
if(v[i]!=0) nr++;
g<<nr;
}