tag:blogger.com,1999:blog-7336864764840390648.post5571408250037672992..comments2012-01-16T17:56:09.700+07:00Comments on Sibook: [programming] x + y + z = constanta | berapa banyak siolusi non-negaif yang dapat terjadi?cimenxhttp://www.blogger.com/profile/06541491102323235172noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-7336864764840390648.post-48260789487168838652012-01-16T17:56:09.700+07:002012-01-16T17:56:09.700+07:00@cimenx harusnya dikasih chekpoint jadi loop-nya g...@<a href="#c8286114905453684702" rel="nofollow">cimenx</a> harusnya dikasih chekpoint jadi loop-nya ga kebanyaken. misal 1-30, 31-60, 61-100. Jadinya ga perlu counting 1-100 bwt liat mana yang memnuhi persamaan.cimenxhttps://www.blogger.com/profile/06541491102323235172noreply@blogger.comtag:blogger.com,1999:blog-7336864764840390648.post-82861149054536847022011-12-28T06:27:54.765+07:002011-12-28T06:27:54.765+07:00belum effisien!belum effisien!cimenxhttps://www.blogger.com/profile/06541491102323235172noreply@blogger.com