Cod sursa(job #1321222)

Utilizator HDRazviIordache Razvan HDRazvi Data 18 ianuarie 2015 21:07:32
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.33 kb
Raporteaza aceasta sursa 
#include <fstream>
#include <math.h>
using namespace std;


int main() {
int a[1001],nr = 0, n, i, j;
ifstream x ("ciur.in");
ofstream y ("ciur.out");
x>>n;
for (i=2; i<=n; i++)
a[i]=1;
for (i=2; i<=sqrt(n); i++)
if (a[i]!=0)
for (j=2; j<=n/i; j++)
a[i*j]= 0;
for (i=2; i<=n; i++)
if (a[i]==1)
y<<i<< "\t";
return 0;
}