Cod sursa(job #2239577)
Utilizator | Data | 11 septembrie 2018 10:43:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, v[10001];
int main (){
fin>>n;
int p=0, x;
for(int i=2; i<=n; i++){
x=0;
for(int j=1; j<=p-1; j++){
if(i % v[j] == 0){
x=1;
break;
}
}
if(x==0){
p++;
v[p]=i;
}
}
fout<<p;
return 0;
}