Cod sursa(job #1125063)
Utilizator | Data | 26 februarie 2014 15:31:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include<iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,j,n,k=0;
bool ciur[10000];
f>>n;
for(i=2;i<n;++i)
ciur[i]=true;
for(i=2;i<n;++i)
if(ciur[i]==true)
{k++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;}
g<<k;
return 0;}