Cod sursa(job #279676)
Utilizator | Data | 12 martie 2009 22:04:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
long int ciur[2000000];
int main()
{
long int i,j,n,k;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++)
for(j=2;i*j<n;j++)
ciur[j*i]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
k++;
return 0;
}