Cod sursa(job #1194240)
Utilizator | Data | 3 iunie 2014 10:56:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long n, i, j, c = 0;
ifstream infile ("ciur.in");
ofstream outfile ("ciur.out");
infile >> n;
bool v[n];
for (i = 0; i <= n; i++)
{
v[i] = 1;
}
for (i = 2; i <= n; i++)
{
if (v[i] == 1)
{
c ++;
for (j = i * 2; j <= n; j += i)
v[j] = 0;
}
}
outfile << c;
outfile.close();
}