Cod sursa(job #2008474)
Utilizator | Data | 6 august 2017 17:04:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int n[2000000],i=2;
int main()
{
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
int m;
fin>>m;
while(i<m){
if(n[i]==0)for(int j=2*i;j<=m;j+=i)n[j]=1;
i++;
}
int cate=0;
for(int i=2;i<=m;i++)
if(n[i]==0)cate++;
fout<<cate;
return 0;
}