Cod sursa(job #1897760)
Utilizator | Data | 1 martie 2017 17:56:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k;
bool a[2000001];
int main()
{
f>>n;
for(int i=2; i<=n; i++)
{
if(a[i]==false)
{k++;
for(int j=i; j<=n; j=j+i)
a[j]=true;
}
}
g<<k;
g.close();
f.close();
return 0;
}