Cod sursa(job #1136291)
Utilizator | Data | 9 martie 2014 01:21:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
long int n,i,j,k=0;
f>>n;
long int ciur[n];
for(i=2;i<=n;i++) ciur[i]=1;
for(i=2;i<=n;i++)
{
if(ciur[i])
{ k++;
for(j=2;j*i<n;j++)
{
ciur[j*i]=0;
}}
}
g<<k<<'\n';
f.close();g.close();
return 0;
}