Cod sursa(job #3182237)
| Utilizator |  Vlad Negut Vlad10 |
Data | 8 decembrie 2023 18:51:56 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;ifstream fin ("ciur.in");ofstream fout("ciur.out");;bool ciur[2000001];int cnt=0;int main(){int n;fin>>n;cnt=n;int j,d;for(d=2;d*d<=n;d++){if(ciur[d]==0){for(j=d*d;j<=n;j+=d){if(ciur[j]!=1)cnt--;ciur[j]=1;}}}cnt--;}
