Cod sursa(job #1241404)
Utilizator | Data | 13 octombrie 2014 15:05:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int v[10000];
int main()
{
int i,n,j,nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2; i*i<=n; i++)
{
if(v[i]==0)
for (j=i;j<=n/i;j++)
v[i*j]=1;
}
v[0]=1; v[1]=1;
for (i=0;i<=n;i++)
if(v[i]==0)
nr++;
g<<nr;
return 0;
}