Cod sursa(job #2504652)
Utilizator | Data | 5 decembrie 2019 12:26:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
short int v[2000000];
int main()
{
int n,i,contor=0,j;
f>>n;
for(i=2;i<=sqrt(n);i++)
{
if(v[i]==0)
{
for(int j=2*i;j<=n;j=j+i)
v[j]=1;
}
}
for(int i=2;i<=n;i++)
if(v[i]==0)
contor++;
g<<contor;
return 0;
}