Cod sursa(job #1285076)
Utilizator | Data | 7 decembrie 2014 02:09:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
bool Prim[2000013];
int sol(0),n,sf(0);
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for (int i=2;i<=n;++i)
if (Prim[i]==0)
{
++sol;
for (int j=2; i*j<=n; ++j) Prim[i*j]=1;
}
cout<<sol;
return 0;
}