Cod sursa(job #2542661)
| Utilizator | Data | 10 februarie 2020 13:40:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin;
ofstream fout;
vector <bool> prime (2000002 , 1);
int n, i, m, suma;
int main (void){
fin.open("ciur.in");
fin>>n;
fin.close();
for (i=2; i<=n; i++)
if (prime[i]){
for (int j=i+i; j<=n; j+=i)
prime[j] = false;
suma++;
}
fout.open("ciur.out");
fout<<suma<<"\n";
fout.close();
return 0;
}
