Cod sursa(job #2655693)
Utilizator | Data | 5 octombrie 2020 11:19:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <vector>
#include<fstream>
using namespace std;
ifstream be("ciur.in");
ofstream ki("ciur.out");
int main()
{
int n,db=0;
be>>n;
vector<bool>a(n,true);
for(int i=2;i<=n;++i)
{
if(a[i]==true)db++;
int j=2;
while(i*j<=n)
{
a[i*j]=false;
j++;
}
}
ki<<db;
return 0;
}