Cod sursa(job #1607534)
Utilizator | Data | 21 februarie 2016 12:46:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
bool npr[2000001];
int n,cnt,i,j,x;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
cnt=n/2;
x=sqrt(n);
for(i=3;i<=x;i+=2)
if(!npr[i])
for(j=3*i;j<=n;j+=i*2)
npr[j]=true,cnt++;
g<<n-cnt;
return 0;
}