Cod sursa(job #534544)
Utilizator | Data | 15 februarie 2011 20:29:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream>
using namespace std;
int a[20000],i,j,n;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
int nr;
for(i=2;i<=n;i++)
if(a[i]==0)
{
for(j=2;j<=n/i;j++)
a[i*j]=1;
nr++;
}
g<<nr;
}