Cod sursa(job #2469487)
| Utilizator | Data | 7 octombrie 2019 15:39:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<cstdio>
#include<vector>
using namespace std;
vector<int> ciur;
vector<int>::iterator it;
int n,i;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur.push_back(2);
bool prim;
for(int i=3;i<=n;i++)
{
prim=true;
for(it=ciur.begin();it!=ciur.end()&&(*it)*(*it)<=i;it++)
{
if(i%(*it)==0)
{
prim=false;
break;
}
}
if(prim)
ciur.push_back(i);
}
printf("%d\n",ciur.size());
return 0;
}
