Cod sursa(job #3224877)
Utilizator | Data | 16 aprilie 2024 13:55:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000005];
int main()
{
int n, cnt=0;
fin >> n;
ciur[0]=ciur[1]=1;
for(int i=2; i<=n; i++) {
if(ciur[i]==0) {
cnt++;
for(int j=2; i*j<=n; j++) {
ciur[i*j]=1;
}
}
}
fout << cnt;
return 0;
}