Cod sursa(job #873969)
Utilizator | Data | 7 februarie 2013 19:44:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,sol,v[2000002];
int main()
{
int i,j;
f>>n;
sol=0;
for(i=4;i<=n;i+=2)v[i]=1;
for(i=3;i<=sqrt(n);i++)
if(v[i]==0)
for(j=i*i;j<=n;j+=i)v[j]=1;
for(i=2;i<=n;i++)if(v[i]==0)sol++;
g<<sol;
return 0;
}