Cod sursa(job #1057108)
Utilizator | Data | 14 decembrie 2013 14:20:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
int n, i, k=0, s, v[499999],j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
k++;
for (i = 3; i <= n; i += 2)
v[i] = 0;
for (i = 3; i <= n; i += 2)
{
for (j=3; j<=i; j+=2)
{
s = i*j;
if (s <= n)
v[s] = 1;
}
if (v[i] == 0)
k++;
}
g<<k;
}