Cod sursa(job #1745164)
Utilizator | Data | 21 august 2016 13:38:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int a[2000001],n,i,nr,j;
int main()
{
f>>n;
for(i=2;i<=sqrt(n);i++)
{
if(a[i]==0)
{
for(j=i;j<=n/i;j++)
{
a[i*j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(a[i]==0)
{
nr++;
}
}
g<<nr;
return 0;
}