Cod sursa(job #874438)
Utilizator | Data | 8 februarie 2013 14:35:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int a[1000];
main()
{int n,i,j,z;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
z=0;
for(i=2;i<=n;i++)
{j=i;
do
{j=j+i;
a[j]=1;}
while(j<n);
}
for(i=2;i<=n;i++)
{if(a[i]==0) {z++;
a[z]=i;}
}
g<<z;
}