Cod sursa(job #2231085)
Utilizator | Data | 12 august 2018 22:07:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
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 main()
{
int nrprime=1,n,k=0,i;
fin>>n;
bool v[n];
for(i=0; i<=n; i++)
{
v[i]=1;
//cout<<v[i]<<" ";
}
for(i=3; i<=n; i=i+2)
{
if(v[i])
{
nrprime++;
k=i+i;
while(k<=n)
{
v[k]=0;
k=k+i;
}
}
}
fout<<nrprime;
return 0;
}