Cod sursa(job #781375)
Utilizator | Data | 24 august 2012 12:35:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
long int a[2000001],i,j,m,n,r,t;
int main()
{
ifstream f("ciur.in"); ofstream g("ciur.out");
f>>n; m=n-1;
for(i=2;i*i<=n;i++)
if(!a[i])
for(j=2;j*i<n;j++)
--m,a[i*j]=1;
//for(i=2;i<n;i++) if(!a[i])
//g<<i<<" ";
g<<m;
f.close(); g.close();
return 0;
}