Cod sursa(job #1345399)
Utilizator | Data | 17 februarie 2015 16:29:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
bool ciur[10001];
int n, cnt=0;
fin>>n;
for(int i=2; i<=n; i++){
if(ciur[i]==0)
cnt++;
for(int j=i+i; j<=n; j=j+i)
ciur[j]=1;
}
fout<<cnt;
return 0;
}