Cod sursa(job #861835)
Utilizator | Data | 21 ianuarie 2013 22:23:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
fstream f("ciur.in" ,ios::in), g("ciur.out", ios::out);
bool v[2000000];
int main()
{
int n,t=0;
f>>n;
for(int i=2;i<=n;i++)
{
if (v[i]==false)
{
t++;
for(int j=2*i; j<=n;j+=i)
v[j]=true;
}
}
g<<t;
return 0;
}