Cod sursa(job #2211314)
Utilizator | Data | 9 iunie 2018 21:07:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
bool v[2000002];
int main ()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,j,s=1;
f>>n;
for(i=3;i<=n/2;i+=2)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j+=i)
v[j]=1;
}
}
for(i=3;i<=n;i+=2)
if(v[i]==0)
s++;
g<<s;
}