Cod sursa(job #1637568)
| Utilizator | Data | 7 martie 2016 18:05:39 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciut.out");
int isColorat[2000001];
int main()
{
int nrprim=0,n,i,j;
f>>n;
for (i=2;i<=n;i++){
if (isColorat[i]==0){
nrprim++;
for (j=2*i;j<=n;j+=i)
isColorat[j]++;
}
}
cout<<nrprim;
return 0;
}
