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