Cod sursa(job #1954739)
| Utilizator | Data | 5 aprilie 2017 16:47:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n, cont=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prime=true;
f>>n;
for (int i=2; i<n; i++)
{
for (int y=2; y<=i/2; y++)
{
if (i%y==0)
prime=false;
}
if (prime==true)
cont++;
prime=true;
}
g<<cont;
return 0;
}
