Cod sursa(job #1876085)
Utilizator | Data | 11 februarie 2017 22:44:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 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;
int k=0;
for (int i=2;i<=N;i++) u[i]=1;
for (int i=2;i<=N;i++){
if (u[i]) {
k++;
for (int j=2*i;j<=N;j+=i){
u[j]=0;
}
}
}
fout <<k;
return 0;
}