Cod sursa(job #2075440)
Utilizator | Data | 25 noiembrie 2017 14:01:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[1000001];
int main()
{
int n,i,j,m=0;
fin>>n;
for(i=0;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
{
m++;
for(j=i*i;j<=n;j=j+i)
ciur[j]=1;
}
}
fout<<m;
return 0;
}