Cod sursa(job #1962412)
| Utilizator | Data | 11 aprilie 2017 19:00:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
void citire(int &n)
{
ifstream fin("ciur.in");
fin>>n;
}
char ciur[2000000];
int numarare(int n)
{
int nr=0;
for(int i=2;i<=n;i++)
if(ciur[i]==0)
{
nr++;
for(int j=2*i;j<=n;j+=i)
ciur[j]=1;
}
return nr;
}
int main()
{
int n;
citire(n);
ofstream fout("ciur.out");
fout<<numarare(n);
return 0;
}
