Cod sursa(job #548451)
| Utilizator |  Dersedan Diana dershi |
Data | 7 martie 2011 14:28:20 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{
int n,i=1,a[200];
ifstream f;
f.open("ciur.in");
f>>n;
for(i=2;i<=n;i++)
a[i]=i;
int k=0;
for(i=2;i<=n-1;i++)
{
if(a[i]!=1) { k++;
for(int j=i+1;j<=n;j++)
if(a[j]%a[i]==0) a[j]=1; }
}
ofstream g;
g.open("ciur.out");
g<<k;
f.open();
g.open();
return 0;
}