Cod sursa(job #2753616)
| Utilizator | Data | 23 mai 2021 19:13:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,multiplu,numarul;
in >> n;
int sir[n+1]={0};
numarul = n - 1;
for(i=2; i<=n; i++)
{
if(sir[i] == 0)
{
multiplu = i;
while(multiplu+i<=n)
{
multiplu += i;
if(sir[multiplu] == 0)
{
numarul -= 1;
}
sir[multiplu] = 1;
}
}
}
out << numarul;
}
