Cod sursa(job #2293054)
Utilizator | Data | 30 noiembrie 2018 14:40:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
//cout<<"Start";
long long n, c, s, i, j;
bool v[1000001];
f>>n;
c=n;
s=2;
for(i=1;i<=n;i++)
{
v[i]=true;
}
for(i = 2; i <= n; i=i+2)
{
v[i]=false;
c--;
}
for(i=3;i<=n/2;i=i+2)
{
if(v[i]==true)
{
for(j=i*2;j<=n;j+=i)
{
if(v[j]==true)
{
v[j]=false;
c--;
}
}
}
}
g<<c;
return 0;}