Cod sursa(job #2828955)
Utilizator | Data | 8 ianuarie 2022 10:23:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt=0;
fin>>n;
int ciur[n+1];
ciur[0]=0;
ciur[1]=0;
int i,j;
for(i=2;i<=n;i++)
{
if(ciur[i]!=0)
{
ciur[i]=1;
for(j=2;j*i<=n;j++)
ciur[j*i]=0;
}
}
for(i=2;i<=n;i++)
if(ciur[i]==1) cnt++;
fout<<cnt;
return 0;
}