Cod sursa(job #1155256)
Utilizator | Data | 26 martie 2014 19:48:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cnt,n;
bool par[2000010];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(int i=2;i<=n;i++){
if(par[i]==0){
cnt++;
for(int j = i+i;j<=n;j+=i)
par[j]=1;
}
}
fout<<cnt<<' ';
return 0;
}