Cod sursa(job #1068261)
Utilizator | Data | 28 decembrie 2013 10:28:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int i,n,j,contor=0;
bool ciur[10000000];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=1;i<=n;i++) ciur[i]=true;
for(i=2;i<n;i++)
for(j=i;j<=n;j=j+i) ciur[j]=false;
if(ciur[i]) contor++;
fout<<contor;
system("pause");
return 0;
}