Cod sursa(job #2140043)
Utilizator | Data | 22 februarie 2018 23:23:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,n,j,counter = 0,*a;
f>>n;
a = new int[n];
for(i = 2;i <= n;i++)
a[i] = 1;
for(i = 2;i <= n;i++)
{
if(a[i])
{
counter++;
for(j = i;j <= n;j += i)
a[j] = 0;
}
}
g<<counter;
return 0;
}