Cod sursa(job #565000)
| Utilizator |  Patrascoiu Andrei andreip_ar |
Data | 27 martie 2011 12:31:34 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream.h>
#include <stdlib.h>
#include <conio.h>
#include <iostream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long int i,n,j,l,k=1;
char *v;
int main ()
{f>>n;
v=(char*)calloc(n,1);
for (j=3; j<=n; j+=2)
if (v[j]==0)
{
for (l=j; l<=n; l+=j)
v[l]=1;
k++;}
g<<k;
f.close();
g.close();
return 0;}
