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