Cod sursa(job #2310130)
Utilizator | Data | 30 decembrie 2018 17:08:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
int i,j,k,n;
bool u[2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=sqrt(n);i++)
if(u[i]==0)
for(j=i+i;j<=n;j=j+i)
u[j]=1;
for(i=2;i<=n;i++)
if(u[i]==0)
k++;
g<<k;
return 0;
}