Cod sursa(job #1486639)
Utilizator | Data | 15 septembrie 2015 11:52:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,a[200005],p;
in >> n;
p=1;
a[1]=2;
for(int i=3;i<=n;i++){
bool succes=true;
for(int j=1;j<=p;j++){
if(i%a[j]==0){
succes=false;
break;
}
}
if(succes==true){
p++;
a[p]=i;
}
}
out << p;
}