Cod sursa(job #495843)
Utilizator | Data | 26 octombrie 2010 23:06:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<fstream>
using namespace std;
bool vc[2000000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long n, i, j, suma=0;
f>>n;
for(i=2;i*i<=n;++i)
if(!vc[i])
for(j=i*i;j<=n;j=j+i)
vc[j]=1;
for(i=2;i<=n;++i)
if(!vc[i])
suma++;
g<<suma;
f.close();
g.close();
return 0;
}