Cod sursa(job #1852564)
Utilizator | Data | 20 ianuarie 2017 22:15:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[2000002];
int main()
{ int n,i,j,ct;
fin>>n;
c[2]=true;
for(i=3;i<=n;i=i+2)
c[i]=true;
for(i=3;i*i<=n;i=i+2)
if(c[i]==true)
for(j=3*i;j<=n;j=j+2*i)
c[j]=false;
ct=1;
for(i=3;i<=n;i++)
if(c[i]==true)
ct++;
fout<<ct;
return 0;
}