Cod sursa(job #2862007)
Utilizator | Data | 4 martie 2022 19:40:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,d=2,i,uc,ciur[10000]={0},k=0;
in>>n;
while(d*d<=n)
{
for(i=2; i*d<=n; i++)
ciur[d*i]=1;
d++;
while(ciur[d]==1)
d++;
}
for(i=2; i<=n; i++)
if(ciur[i]==0)
k++;
out<<k;
return 0;
}