Cod sursa(job #2280073)
Utilizator | Data | 10 noiembrie 2018 11:14:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int x[2000001];
int main()
{
int n,i,j,s;
f>>n;
if(n<=1)
g<<0;
s=n-1;
for(i=2;i<=n;i++)
{
if(x[i]==0)
{
for(j=i*i;j<=n;j+=i)
{
x[j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(x[i]==1)
s--;
}
g<<s;
return 0;
}