Cod sursa(job #1305542)
Utilizator | Data | 29 decembrie 2014 21:05:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,nr=0;
f>>n;
bool prim[n+7]; //N7
for(int i=1; i<=n; i++)
prim[i]=true;
for(int i=2; i<=n; i++)
if (prim[i])
{
for(int j=2; i*j<=n; j++)
prim[i*j]=false;
nr++;
}
g<<nr;
return 0;
}