Cod sursa(job #1466861)
Utilizator | Data | 31 iulie 2015 10:46:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
char a[2000010];
int main()
{
int n,i,j,k=0;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for (i = 2; i <= n;++i)
a[i] = 1;
for (i = 2;i <= n;++i)
if (a[i])
{
k++;
for (j = i*2;j <= n;j += i)
a[j] = 0;
}
g<<k;
return 0;
}