Cod sursa(job #3294522)
| Utilizator | Data | 25 aprilie 2025 11:30:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <cstdlib>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n;
fin >> n;
int *v = (int*)calloc(n+1, sizeof(int));
int cnt = 0;
for(int i = 2; i <= n; i++)
{
if(v[i] == 0)
{
cnt++;
for(int j = i; i * j <= n; j++)
{
v[i * j] = 1;
}
}
}
fout << cnt;
fin.close();
fout.close();
return 0;
}
