Cod sursa(job #1542756)
Utilizator | Data | 5 decembrie 2015 17:10:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main()
{
int a,i,m=0,cnt=0;
in>>a;
v[0]=0;
v[1]=0;
for(i=2;i<=a;i++)
v[i]=1;
for(i=2;i<=a;i++)
{
if(v[i]==1)
{
while(m<=a)
{
m=m+i;
v[m]=0;
}
}
}
for(i=2;i<=a;i++)
{
if(v[i]==1)
cnt++;
}
out<<cnt;
return 0;
}