Cod sursa(job #988652)
Utilizator | Data | 23 august 2013 16:08:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int s,i,j;
bool v[2000001];
double n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
v[i]=true;
for(i=2;i<=n;i++)
{
if(v[i]==true)
{
s++;
for(j=i+i;j<=n;j+=i)
v[j]=false;
}
}
g<<s<<'\n';
return 0;
}