Cod sursa(job #2023537)
Utilizator | Data | 19 septembrie 2017 09:00:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N, i, nr=0, ok;
f>>N;
for (i=2; i<=N; i++)
{
ok=1;
if (i%2==0 || i%3==0 || i%5==0 || i%7==0)
ok=0;
if (i==2 || i==3 || i==5 || i==7)
ok=1;
if (ok==1)
nr++;
}
g<<nr;
return 0;
}