Cod sursa(job #3192806)
Utilizator | Data | 13 ianuarie 2024 11:31:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000005];
int main()
{
int i,j,n,sol=1;
f>>n;
ciur[0]=ciur[1]=1;
for(i=4;i<=n;i+=2)ciur[i]=1;
for(i=3;i<=n;i+=2)
if(!ciur[i])
{
sol++;
for(j=i*i;j<=n;j+=2*i)ciur[j]=1;
}
g<<sol;
return 0;
}