🚀 go-pugleaf

In article <YUUICHI.97Mar26145832@georg.jo.tomakomai-ct.ac.jp>,
	yuuichi@georg.jo.tomakomai-ct.ac.jp (KAWAGUCHI Yuuichi) writes:
> $B$9$+(B?  $BNc$($P!V%(%i%9%H%F%M%9$N$U$k$$$r;H$&!W$H$$$&(B
> $B$N$O!"AG0x?tJ,2r$N;EAH$_$r@bL@$7$F$$$^$9$+(B?

In article <5hr972$jak@meshsv18.tk.meshnet.or.jp>,
	"KOSUGE Mitsuyasu" <FZK01077@niftyserve.or.jp> writes:
>   $B!V%(%i%9%H%F%M%9$N$U$k$$!W$OAG?t$r5a$a$kJ}K!$G(B
> $B!V$"$k?t$,AG?t$,$I$&$+D4$Y$k$K$O!"$=$N?tL$K~$N(B
> $BA4$F$NAG?t$G3d$j@Z$l$J$1$l$PNI$$!W$H$$$&J}K!$G$9!#(B

$B!V%(%i%9%H%F%M%9!W$G$O$J$/!V%(%i%H%9%F%M%9!W$G$9!#(B

#define N 10000
int sieve[N+1];

main()
{
	int i, j;

	for (i = 2; i <= N; i++)
		if (sieve[i] == 0) {
			printf("%d\n", i);
			for (j = i + i; j <= N; j += i)
				sieve[j] = 1;
		}
	return 0;
}


> $BIaDL$O#3$+$i=g$K(B($B#1$OAG?t$G$J$/!"#2$O:GDc?t$@$+$i(B
> $B<+L@(B)$B$O$8$a$FAG?t$J$i$=$NCM$rJ]B8$7$F<!!9$K(B
> $B3d$j;;$7$FD4$Y$^$9!#(B
>   $B$7$?$,$C$F4JC1$G$9$,!"?t$,Bg$-$/$J$k$H;~4V$,(B
> $B$+$+$j$^$9!#$D$^$j%3%s%T%e!<%?8~$-$N;E;v$G$9$M!#(B

$B;~4V$,$+$+$C$F$b$$$$$N$J$i!"(B2$B$+$i=gHV$K3d$C$F$$$1$P$9$_$^$9$M!#(B
$BAG?t$rJ]B8$9$k>l=j$bMW$j$^$;$s!#AG?t$NDj5A$=$N$b$N$H$$$&46$8!#(B

main()
{
	int i, j;

	for (i = 2; i <= 10000; i++) {
		for (j = 2; i % j; j++)
			;
		if (j == i)
			printf("%d\n", i);
	}
	return 0;
}

$BAG?t$H8@$($P!"(BEdsger W. Dijkstra $B$N!V9=B$2=%W%m%0%i%_%s%0!W$G$9$M!#(B

--
$B:dK\CRI'(B	sakamoto@sm.sony.co.jp
main(i,j){for(i=2;i<10000;j==i&&printf("%d\n",i),i++)for(j=2;i%j;j++);}