Cod sursa(job #733033)
| Utilizator |  Iordan Vlad Vladinho97 |
Data | 11 aprilie 2012 13:02:00 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,i,j,nr;
bool v[1000];
f>>n;
for(i=1;i<=n;i++)
v[i]=0;
nr=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=i+i;j<=n;j=j+i)
v[j]=1;
nr++;
}
}
g<<nr;
return 0;
}