Cod sursa(job #675171)
Utilizator | Data | 7 februarie 2012 12:46:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
#define infile "ciur.in"
#define outfile "ciur.out"
int main (void)
{
ifstream in(infile);
int n,j,phi[2000005],i,count=0;
in>>n;
for (i=1;i<=n;i++)
phi[i]=i;
for (i=2;i<=n;i++)
if (phi[i]==i)
{
count++;
for (j=i+i;j<=n;j+=i)
phi[j]=0;
}
ofstream out(outfile);
out<<count;
in.close();
out.close();
return 0;
}