Cod sursa(job #796663)
Utilizator | Data | 12 octombrie 2012 08:59:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool V[2000001];
int n,i,j,nr;
int main (){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2; i<=n; i++){
if(V[i]==0){
nr++;
for(j=i*2; j<=n; j+=i)
V[j]=1;
}
}
fout<<nr;
return 0;
}