Cod sursa(job #2486269)
Utilizator | Data | 2 noiembrie 2019 16:17:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream A("ciur.in");
ofstream B("ciur.out");
int n,r=0;A>>n;
int V[n+1];
for(int i=0;i<=n;++i)
V[i]=0;
V[0]=1;V[1]=1;
for(int i=2;i*i<=n;++i)
if(V[i]==0)
for(int j=2;j<=n/i;++j)
V[i*j]=1;
for(int i=0;i<=n;++i)
if(V[i]==0)
++r;
B<<r;
A.close();
B.close();
return 0;
}