Cod sursa(job #1488617)
Utilizator | Data | 19 septembrie 2015 13:03:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream fi ("ciur.in");
ofstream fo ("ciur.out");
int fr[2000000],i,j,n,k;
int main()
{
fi>>n;
for (i=2;i<=n;i++)
if (fr[i]==0)
{
for (j=i+i;j<=n;j=j+i) fr[j]++;
k++;
}
fo<<k;
return 0;
}