Cod sursa(job #1054264)
Utilizator | Data | 13 decembrie 2013 16:00:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int main()
{
int n, i, k=0, v[100], j, c;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i = 2; i <= n; i++)
{
v[i] = 0;
for (c = 2; c <= sqrt(i); c++)
if ((i % c == 0)&&(i!=2))
v[i] = 1;
if (v[i] == 0)
k++; //cout<<i<<" ";
}
g<<k;
//cout << k;
}