Cod sursa(job #826441)
Utilizator | Data | 30 noiembrie 2012 18:26:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long i,n,nr=0,j;
char p[2000000];
int main()
{
f>>n;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
if(p[i]==1)
{
nr++;
for(j=i+1;j<=n;j++)
if(j%i==0)
p[j]=0;
}
g<<nr;
f.close();
g.close();
return 0;
}