Cod sursa(job #1036890)
Utilizator | Data | 19 noiembrie 2013 18:32:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n, i, s=0, j;
bool a[2000000];
int main()
{
in>>n;
for(i=2;i*i<n;i++)
{
if(!a[i])
{
for(j=i*i;j<=n;j=j+i)
{
a[j]=true;
}
}
}
for(i=2;i<n;i++)
{
if(!a[i])
{
s++;
}
}
out<<s;
}