Cod sursa(job #1819988)
Utilizator | Data | 1 decembrie 2016 00:43:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr=0;
int main()
{
f>>n;
vector<int> v(n+5,0);
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr++;
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
}
g<<nr;
}