Cod sursa(job #1675676)
Utilizator | Data | 5 aprilie 2016 14:55:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n,c;
bool ciur[2000050];
int main()
{
ifstream cin("ciur.in");
ofstream cout ("ciur.out");
cin>>n;
for(int i=2;i<=n;i++)
{
if(ciur[i]!=1)
{
++c;
if(i*i<0) continue;
for(int j=i*i;j<=n;j+=i)
{
if(j<0) break;
ciur[j]=1;
}
}
}
cout<<c;
}