Cod sursa(job #1833432)
Utilizator | Data | 22 decembrie 2016 12:20:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int Nmax=2000000;
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[Nmax+1],n;
int main()
{
int k=0;
in>>n;
for(int i=2;i*i<=n;i++)
{
for(int j=i+i;j<=n;j=j+i)
v[j]=1;
}
for(int i=2;i<=n;i++)
if(v[i]==0)
k++;
out<<k;
}