Cod sursa(job #873979)
Utilizator | Data | 7 februarie 2013 19:53:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,j,n,sol;
bool v[2000002];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
sol=0;
for(i=2;i<=n;i++)
if(v[i]==false)
{
sol++;
for(j=i*i;j<=n;j+=i)v[j]=true;
}
g<<sol;
return 0;
}