Cod sursa(job #975982)
Utilizator | Data | 22 iulie 2013 10:15:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k,P[2000000];
bool v[2000099];
int main()
{
f>>n;
for(int i=2;i<=n;i++)
if(!v[i])
{
k++; P[k]=i;
//fac false toti multiplii lui i
for(int j=2*i;j<=n;j=j+i)v[j]=true;
}
g<<k<<'\n';
f.close();g.close();
return 0;
}