Cod sursa(job #947961)
| Utilizator | Data | 8 mai 2013 22:13:35 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#define IN "ciur.in"
#define OUT "ciur.out"
#define MAX 2000000
using namespace std;
ifstream fin(IN);
ofstream fout(OUT);
bool v[MAX];
int n, sol;
void ciur();
int main()
{
ciur();
return 0;
}
void ciur()
{
fin>>n;
int i, j;
for(i=2; i<=n; i++)
v[i]=1;
for(i=2; i<=n; i++)
if(v[i])
{
sol++;
for(j=i+i; j<=n; j+=i)
v[j]=0;
}
fout<<sol<<'\n';
}
