Cod sursa(job #1110110)
Utilizator | Data | 17 februarie 2014 20:42:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
//Programarea in limbajul C/C++ pentru liceu, p.82
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
unsigned int N, i, j, contor;
int main()
{
f>>N;
for(i=2;i<=N;i++)
{
for (j=i+i;j<=N;j+=i)
a[j]=1;
}
for (i=2;i<=N;i++)
if (a[i]==0) contor++;
g<<contor;
}