Cod sursa(job #1954014)
| Utilizator | Data | 5 aprilie 2017 10:03:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000001];
void makeciur(int n)
{
int i,m,j;
ciur[0]=ciur[1]=1;
for(i=2; i<=n; i++)
{
if(ciur[i]==0)
for(j=2*i; j<=n; j=j+i)
ciur[j]=1;
}
}
int main()
{
int n,gigel,i;
in>>n;
gigel=0;
makeciur(n);
for(i=0; i<=n; i++)
{
if(ciur[i]==0)
gigel++;
}
out<<gigel;
return 0;
}
