Cod sursa(job #1627285)
| Utilizator | Data | 3 martie 2016 16:14:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr=1;
bool ciur[2000002];
int main()
{
ios::sync_with_stdio(false);
f>>n;
for(int i=3;i<=n;i++)
{
if(!ciur[i])
for(int j=3*i;j<=n;j+=2*i) ciur[j]=true;
}
for(int i=3;i<=n;i+=2) if(!ciur[i]) nr++;
g<<nr;
return 0;
}
