Cod sursa(job #1312236)
Utilizator | Data | 9 ianuarie 2015 00:00:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int64_t i, j, n, m;
int main()
{
f>>n;
for(i=2;i<=n;i++)
for(j=2;j*i<=n;j++)
if (i*j<2000000)
a[i*j]=true;
for(i=1;i<=n;i++)
if(!a[i]) m++;
g<<m;
return 0;
}