Cod sursa(job #1426058)
Utilizator | Data | 28 aprilie 2015 21:46:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int i,j,n,nr=1;
char prim[2000000];
fin>>n;
for( i=2;i*i<=n;i++)
{
for( j=i*i;j<=n;j=j+i)
{
if( prim[j]==0)
nr++;
prim[j]=1;
}
}
fout<<n-nr;
return 0;
}