Cod sursa(job #2858268)
Utilizator | Data | 27 februarie 2022 12:33:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int v[2000006]={0},i=0,g=0,n;
in>>n;
for(i=2;i*i<=n;i++)
{
for(int j=2;j*i<=n;j++)
{
v[i*j]=1;
}
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
g++;
}
out<<g;
return 0;
}