Cod sursa(job #1947527)
Utilizator | Data | 31 martie 2017 00:27:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include<vector>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
vector<bool> prim;
int main()
{
f>>n;
prim.resize(n+1,1);
for(int i=2;i<=n;i++)
if(prim[i])
{
nr++;
for(int j=2*i;j<=n;j+=i)
prim[j]=0;
}
g<<nr<<'\n';
return 0;
}