Cod sursa(job #2035375)
Utilizator | Data | 9 octombrie 2017 11:51:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <vector>
using namespace std;
int x,cont;
bool a[20000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
void verif(int p){
for(int i=2;p*i<=x;i++){
a[p*i]=1;
}
}
int main()
{
f>>x;
for(int i=2; i<=x; i++){
if(a[i]==0){
verif(i);
cont++;
}
}
g<<cont;
return 0;
}