Cod sursa(job #2230635)
| Utilizator | Data | 10 august 2018 20:04:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int nrprime=0,n,k=0,i;
fin>>n;
long long v[n];
for(i=0; i<=n; i++)
{
v[i]=1;
}
for(i=2; i<=n; i++)
{
k=i+i;
//cout<<k<<" ";
while(k<=n)
{
v[k]=-1;
k=k+i;
}
}
for(i=2; i<=n; i++)
{
if(v[i]!=-1)nrprime++;
}
fout<<nrprime;
return 0;
}
