Cod sursa(job #2280500)
Utilizator | Data | 10 noiembrie 2018 18:33:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int s[2000001];
int main()
{
ifstream fcin("ciur.in");
ofstream fcout("ciur.out");
int x,i;
fcin>>x;
for(i=2;i<=x;i++)
s[i]=0;
int j;
for (i=2;i<=x;i++)
if(s[i]==0)
for (j=2*i;j<=x;j+=i)
s[j]=1;
int v=0;
for (i=2;i<=x;i++)
if (s[i]==0)
v++;
fcout<<v;
return 0;
}