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