Cod sursa(job #2661836)
Utilizator | Data | 22 octombrie 2020 19:31:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001];
int main ()
{
int n, i, j, x=0;
in>>n;
for(i=2; i<=n; i++)
{
if(ciur[i]==0)
{
x++;
for(j=i+i; j<=n; j=j+i)
ciur[j]=1;
}
}
out<<x;
return 0;
}