Cod sursa(job #3031110)
Utilizator | Data | 18 martie 2023 18:45:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include<fstream>
#include<string.h>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f >> n;
int c = 0;
int a[n];
memset(a, 0, sizeof(a));
for (int i = 2; i <= n; i++) {
if (a[i] == 0) {
c += 1;
for (int j = i+1; j <= n; j++) {
if (j%i==0) a[j]=1;
}
}
}
g << c;
f.close();
g.close();
return 0;
}