Cod sursa(job #2270709)
Utilizator | Data | 27 octombrie 2018 13:54:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool not_prime[2000007];
int main()
{
int n;
in>>n;
int s=0;
for(int i=2; i<=n; i++)
{
if(!not_prime[i]){
s++;
for(int k=2*i; k<=n; k+=i)
{
not_prime[k]=true;
}
}
}
out<<s;
return 0;
}