Cod sursa(job #3314345)
| Utilizator | Data | 9 octombrie 2025 17:54:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int prime[2000001];
for(int i=0; i<=n; i++) prime[i]=1;
prime[0]=0;
prime[1]=0;
for(int i=2; i*i<=n; i++)
if(prime[i]==1)
for(int j=i*i; j<=n; j+=i)
prime[j]=0;
int rez=0;
for(int i=2; i<=n; i++)
if(prime[i]==1)
rez++;
g<<rez;
return 0;
}
