Cod sursa(job #2025306)
Utilizator | Data | 22 septembrie 2017 15:18:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool c[2000001];
int main()
{
long long n;
int i, j,nrp=0;
in>>n;
for(i=1; i<=n; i++) c[i] =1;
for (i=2; i<=n; i++)
if(c[i] == 1)
for(j=2; j*i <= n; i ++) c[i*j] = 0;
for(i=1; i<=n; i++)
if(c[i] ==0) nrp++;
out<<nrp;
return 0;
}