Cod sursa(job #973672)
Utilizator | Data | 15 iulie 2013 00:23:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int s,i,j,v[2000001];
double n;
int main()
{
f>>n;
for(i=2;i<=n;i++)
{
if(!v[i])
{
s++;
for(j=i+i;j<=n;j+=i)
{
v[j]++;
}
}
}
g<<s<<'\n';
return 0;
}