Cod sursa(job #2079765)
Utilizator | Data | 1 decembrie 2017 20:05:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int main()
{
int cont=1,n,i,i2;
f>>n;
for(i=3;i<=n;i+=2)
{
if (a[i]==0)
cont++;
for(i2=i;i2<=n;i2=i2+i)
a[i2]=1;
}
g<<cont;
return 0;
}