Cod sursa(job #3174792)
Utilizator | Data | 25 noiembrie 2023 10:11:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char v[2000002];
int main()
{
int n, cnt=0;
fin >> n;
for(int i=1; i<=n;i++) {
v[i]=0;
}
v[0]=1;
v[1]=1;
for(int i=2;i<=n;i++) {
if(v[i]==0)
{
cnt++;
for(int j=2*i;j<=n;j=j+i) {
v[j]=1;
}
}
}
fout << cnt;
return 0;
}