Cod sursa(job #303256)
Utilizator | Iordache Bogdan Ieew | Data | 9 aprilie 2009 18:03:30 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <vector>
using namespace std;
vector<bool> a(2000002);
//vector<int>prim;
int sol,n;
int main()
{int i,j;
ifstream in("ciur.in");
in>>n;
in.close();
i=2;
while(i<n)
{
while(a[i]&&i<n)i++;
if(a[i])break;
sol++;
// prim.push_back(i);
j=1;
while(i*j<=n){a[i*j]=1;j++;}
}
ofstream out("ciur.out");
//for(i=0;i<prim.size();i++)out<<prim[i]<<' ';out<<'\n';
out<<sol<<'\n';
out.close();
return 0;
}