Cod sursa(job #1091213)
Utilizator | Data | 25 ianuarie 2014 14:30:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
int main()
{
int N,j,i,k=0;
bool ciur[i];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>N;
for(i=2;i<=N;i++)
ciur[i]=true;
for(i=2;i<=N;i++)
if(ciur[i]==true)
for(j=i+i;j<=N;j=j+i)
ciur[j]=false;
for(i=1;i<=N;i++)
if(ciur[i]==true )
k++;
fout<<k;
fin.close();
fout.close();
return 0;
}