Cod sursa(job #2840957)
Utilizator | Data | 29 ianuarie 2022 08:21:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
ifstream fin("ciur.in");
ofstream fout("ciur.out");
using namespace std;
int main()
{
int n, prime = true, S = 0;
fin >> n;
for(int i = 2; i <= n; i++)
{
for(int j = 2; j < i; j++)
{
prime = true;
if(i % j == 0)
{
prime = false;
break;
}
}
if(prime == true)
{
S++;
}
}
fout << S << endl;
}