Cod sursa(job #1483848)
Utilizator | Data | 9 septembrie 2015 23:46:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long int n,k=0;
bool a[20000000];
ifstream fi("ciur.in");
ofstream fo("ciur.out");
fi>>n;
for (int i=0;i<n;i++)
{
a[i]=true;
}
for (int i=2;i<=n;i++)
if (a[i]){ ++k;
for(int j=2;j<=n/i;j++)
a[i*j]=false;
}
fo<<k;
fi.close();fo.close();
return 0;
}