Cod sursa(job #1758187)
Utilizator | Data | 16 septembrie 2016 19:11:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
using namespace std;
int v[2000001],i,j,c,n;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n/2;i++)
if(!v[i])
{
c++;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
for(;i<=n;i++)
if(!v[i])
c++;
g<<c;
f.close();
g.close();
return 0;
}