Cod sursa(job #1209390)
Utilizator | Data | 17 iulie 2014 16:14:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,nr=0;
ifstream in("ciur.in");
ofstream out("ciur.out");
in >> n;
bool a[n];
for(int i=2;i<=n;i++) a[i]=1;
for(int i=2;i*i<=n;i++)
{
if(a[i])
for(int j=2;j*i<n;j++)
a[i*j]=0;
}
for(int i=2;i<n;i++)
if(a[i]) nr++;
out << nr;
return 0;
}