Cod sursa(job #2239582)
Utilizator | Data | 11 septembrie 2018 11:00:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, v[2000001];
int main (){
fin>>n;
int p=0, x;
for(int i=2; i<=n; i++){
if(v[i]==0){
p++;
x=i;
while(i+x<=n){
v[i+x]=1;
x=x + i;
}
}
}
fout<<p;
return 0;
}