Cod sursa(job #2396142)
Utilizator | Data | 3 aprilie 2019 11:31:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
bool ciur[2000005];
void ciuruit(int n)
{
int ret=0;
for (int i=2; i<=n; i++)
{
if (ciur[i]==0)
{
ret++;
for (int j=i+i; j<=n; j+=i)
{
ciur[j]=1;
}
}
}
g<<ret;
}
int main()
{
f>>n;
ciuruit(n);
return 0;
}