Cod sursa(job #1389264)
Utilizator | Data | 16 martie 2015 09:38:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, k=0;
int main()
{
bool c[2000001];
f>>n;
for(int i=2;i<sqrt(n);i++)
{
if (!c[i])
{
for(int j=i^2;j<n;j=j+i)
c[j]=true;
}
}
for(int i=2;i<=n;i++)
if(!c[i])
k++;
g<<k;
return 0;
}