Cod sursa(job #1074578)
Utilizator | Data | 7 ianuarie 2014 19:25:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,n,r=0;bool a[2000000];
f >> n;
for(i=2;i<=sqrt(n);i++)
{
if(a[i]==false)
{
int j=2;
while(j*i<=n)
{
if(a[i*j]==false)r++;
a[i*j]=true;
j++;
}
}
}
g << n-1-r;
return 0;
}