Cod sursa(job #1284469)
Utilizator | Data | 6 decembrie 2014 15:49:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n,i,j,nr=0;
in>>n;
for(i=2;i<=n;i++)v[i]=1;
{
for(i=2;i<=n;i++)
if(v[i])
{
nr++;
for(j=1;j<=n/i;j++)v[i*j]=0;
}
}
out<<nr;
return 0;
}