Cod sursa(job #2371115)
Utilizator | Data | 6 martie 2019 15:57:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,ans;
bool ciur[2000100];
int main()
{
in>>n;
ciur[0]=ciur[1]=1;
for(int i=2;i<=n;i++)
if(ciur[i]==0)
{
ans++;
for(int j=2;i*j<=n;j++)
ciur[i*j]=1;
}
out<<ans;
return 0;
}