Cod sursa(job #1247242)
Utilizator | Data | 22 octombrie 2014 14:49:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,nr,i,j;
bool b[500];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
nr=0;
for (i=2; i<=n; i++)
{
if (b[i]==false)
{
for (j=2; j<=n/i; j++)
{
b[i*j]=true;
}
}
}
for (i=2; i<=n; i++)
{
if (b[i]==false)
{
nr++;
}
}
g<<nr;
return 0;
}