Cod sursa(job #2489153)
Utilizator | Data | 7 noiembrie 2019 22:47:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,v[100005],i,j,numar;
int main()
{
f>>n;
v[0]=1;
v[1]=1;
for(i=2;i*i<=n;i++)
for(j=2;j*i<=n;j++)
{
v[i*j]=1;
}
for(i=1;i<=n;i++)
{
if(v[i]==0)
numar++;
}
g<<numar;
}