Cod sursa(job #1288972)
Utilizator | Data | 9 decembrie 2014 12:04:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{ int n,s=0,i,j,k,flag=0;
in>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
{ if(v[i]==1)
for(j=2;j<=n/i;j++)
{
v[j*i]=0;
}
}
for(i=2;i<=n;i++)
if(v[i]==1) s++;
out<<s;
}