Cod sursa(job #1834837)
| Utilizator | Data | 25 decembrie 2016 14:57:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
bool v[2000005];
int n,k,i,j;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++)
{
if(v[i]==0)
{
k++;
for(j=2*i; j<=n; j+=i)
v[j]=1;
}
}
g<<k<<'\n';
f.close(); g.close();
}
