Cod sursa(job #2377126)
Utilizator | Data | 8 martie 2019 22:01:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
//#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
short int v[1960003];
int main()
{
f>>n;
int i=2,nrprime=0;
while(i<=n)
{
v[i]=1;
nrprime++;
int j=i*i;
while(j<=n)
{
v[j]=-1;
j+=i;
}
while(v[i]==1 or v[i]==-1)
{
i++;
if(i>n)
break;
}
}
g<<nrprime;
return 0;
}