Cod sursa(job #1639603)
Utilizator | Data | 8 martie 2016 12:59:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream F ("eratostene.in");
ofstream G ("eratostene.out");
int n,i,ciur[2000003],j,k;
int main()
{
F>>n;
ciur[1]=1;
ciur[0]=1;
for ( i=2;i*i<=n;i++ )
if ( !ciur[i] )
for ( j=i*i;j<=n;j+=i )
++ciur[j];
for ( i=1;i<=n;i++ )
if ( !ciur[i] )
++k;
G<<k;
return 0;
}