Cod sursa(job #1302124)
Utilizator | Data | 26 decembrie 2014 17:23:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream x ("ciur.in");
ofstream y ("ciur.out");
int n;
bool ciur[2000001];
int main()
{
int i,j,k=0;
x>>n;
for(i=2;i<=n;i++)
if(ciur[i]==false)
{
k++;
j=i;
while(j+i<n)
{
j+=i;
ciur[j]=true;
}
}
y<<k<<'\n';
return 0;
}