Cod sursa(job #877128)
| Utilizator | Data | 12 februarie 2013 16:43:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,b[2000000],x=0;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void citire()
{
fin>>n;
for (int i=1; i<=n; i++)
{
b[i]=1;
}
}
void ciur()
{
for(int i=2; i<=n; i++)
{
if(b[i]==1)
{
for(int j=i+1; j<=n; j++)
{
if(j%i==0)
b[j]=0;
}
}
}
}
void afisare()
{
for(int i=2; i<=n; i++)
if(b[i]==1)
x++;
fout<<x;
}
int main()
{
citire();
ciur();
afisare();
fin.close();
fout.close();
return 0;
}
