Cod sursa(job #2546822)
Utilizator | Data | 14 februarie 2020 16:41:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim[2000005],n,cnt;
int main()
{
int n,cnt=0;
fin>>n;
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=3;i<=n;i+=2)
if(prim[i])
{
cnt++;
for(int j=i+i;j<=n;j+=i)
prim[j]=0;
}
fout<<cnt+1;
}