Cod sursa(job #1795012)
Utilizator | Data | 1 noiembrie 2016 21:43:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,con;
bool a[2000005];
void ciur(int n)
{
for(int i=2;i<n;i++)
if(a[i]==0)
for(int j=i+i;j<=n;j+=i)
a[j]=1;
}
int main()
{
f>>n;
ciur(n+1);
for(int i=2;i<=n;i++)
if(a[i]==0)
con++;
g<<con;
return 0;
}