Cod sursa(job #622134)
Utilizator | Data | 17 octombrie 2011 14:35:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
bool a[2000005];
int main(){
int i,c=0,n,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2;i*i<=n;i++)
{
if(!a[i])
for(j=i*i;j<=n;j+=i)
a[j]=true;
}
for(i=2;i<=n;i++)
if(!a[i])
c++;
g<<c;
return 0;
}