Cod sursa(job #3349640)
| Utilizator |  Dominik domdiridomdidom |
Data | 1 aprilie 2026 13:44:56 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
int main(){std::ifstream i("ciur.in");std::ofstream o("ciur.out");int n,s=0; i>>n;n++;bool*p=new bool[n];for(int j=2;j<n;j++)p[j]=1;for(int j=2;j<n;j++)if(p[j])for(int k=2;j*k<n;k++)p[j*k]=0;for(int j=2;j<n;j++)if(p[j])s++;o<<s;}