Cod sursa(job #1996288)
Utilizator | Data | 30 iunie 2017 20:51:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<iostream>
#include<cstring>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n;
in>>n;
int q=1;
while(q*q<=n)
{
q++;
if(v[q]==0)
for(int i=q*2;i<=n;i=i+q)
v[i]=1;
}
int k=0;
for(int i=2;i<=n;i++)
if(v[i]==0)
k++;
out<<k;
}