Cod sursa(job #1126924)
Utilizator | Data | 27 februarie 2014 10:27:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int i, k, n, incr;
fin>>n;
vector<int>v(n+1, 0);
vector<int>sol;
for(i=2; i<=n; i++)
{
if(v[i]!=1)
{
sol.push_back(i);
k=i;
incr=k;
while(k<=n)
{
v[k]=1;
k=k+incr;
}
}
}
fout<<sol.size();
}