Cod sursa(job #3314801)
| Utilizator | Data | 11 octombrie 2025 10:22:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
bool ciur[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n;
fin >> n;
int rasp=0;
for(int i=2;i<=n;i++){
if(ciur[i]==false){
rasp++;
for(int j=i;j<=n;j+=i)
ciur[j]=true;
}
}
fout << rasp;
}
