Cod sursa(job #944353)
Utilizator | Data | 28 aprilie 2013 10:42:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,j,k;
bool v[nmax];
int main()
{f>>n;
for (i=2;i<=n;i++)
if(v[i]==0){
for(j=2*i;j<=n;j+=i)
v[j]=1;
k++;
}
g<<k;
return 0;
}