Pagini recente » Cod sursa (job #1364440) | Cod sursa (job #229033) | Cod sursa (job #2786377) | Cod sursa (job #249879) | Cod sursa (job #2230642)
#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;
char v[n];
for(i=0; i<=n; i++)
{
v[i]=1;
}
for(i=2; i<=n; i++)
{
if(v[i])
{nrprime++;
k=i+i;
//cout<<k<<" ";
while(k<=n)
{
v[k]=0;
k=k+i;
// prim=0;
}
}
}
/*
for(i=2; i<=n; i++)
{
if(v[i]!=-1)nrprime++;
}
*/
fout<<nrprime;
return 0;
}