Cod sursa(job #1876077)
Utilizator | Data | 11 februarie 2017 22:34:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool u[2001001];
int N;
int main()
{
fin >>N;
for (int i=2;i<=N;i++){
if (!u[i]){
for (int j=2*i;j<=N;j+=i) u[i]=1;
}
}
int k=0;
for (int i=2;i<=N;i++) if (!u[i]) k++;
fout <<k;
return 0;
}