Cod sursa(job #615834)

Utilizator DanytzuBran Daniel Danytzu Data 11 octombrie 2011 01:23:45
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <stdio.h>
 #include <iostream>
int n, contor;
char prim[2000005]; 

void main()
{
int i, j;
 
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
 
scanf("%d", &n);
for (i = 2; i <= n; ++i)
{prim[i] = 1;
printf("%d , ",prim[i]);
printf("\n");}
for (i = 2; i <= n; ++i)
if (prim[i])
{
++contor;

for (j = i+i; j <= n; j =j+ i)
prim[j] = 0;
printf("%d ,",prim[j]);
}
 
printf("%d\n", contor);
 

}