Cod sursa(job #523569)
Utilizator | Data | 18 ianuarie 2011 16:33:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream.h>
int v[100],i,j,n,nr=0;
int main()
{ifstream f11("ciur.in");
ofstream g11("ciur.out");
f11>>n;
for(i=2;i<n/2;i++)
for(j=2;(j*i)<=n;j++)
v[j*i]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
nr++;
g11<<nr<<";";
f11.close();
g11.close();
return 0;
}