Cod sursa(job #1977964)
Utilizator | Data | 6 mai 2017 16:08:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,nr=1;
long a[2000000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for (i=3;i<=n;i=i+2)
if (a[i] == 0)
{
nr++;
for (j=i+i;j<=n;j=j+i)
a[j] = 1;
}
g << nr;
}