Cod sursa(job #1793757)
Utilizator | Data | 31 octombrie 2016 15:19:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
bool c[2000001];
long n, i, j, p;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++)
if(c[i]==0)
{
p++;
for(j=i+i; j<=n ; j=j+i)
c[j]=i;
}
g<<p;
return 0;
}