Re: [algogeeks] Scanf in an infinite loop

2011-09-13 Thread Raghu Sarangapani
); printf(ret is %d\n,ret); } } Regards, Raghu On Tue, Sep 13, 2011 at 3:23 AM, Avinash Dharan avinashdha...@gmail.comwrote: #include stdio.h void main() { while(1) { int opt; scanf(%d,opt); printf(%d\n,opt); } } when i execute this program

[algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread RAghu
What about (9 pow 9) ! On May 6, 4:30 pm, uday kumar uda...@gmail.com wrote: 9 pow 9. On Fri, May 6, 2011 at 3:41 PM, Bala cmb...@gmail.com wrote: 99! Thanks Bala On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote:  *  LARGEST NUMBER PUZZLE What is the

[algogeeks] Re: [brain teaser ] TRICK BRAIN TEASER 2 May

2011-05-03 Thread RAghu
silly but nice one On May 2, 10:22 pm, neha lawaria lawaria...@gmail.com wrote: F On Mon, May 2, 2011 at 1:17 PM, Lavesh Rawat lavesh.ra...@gmail.com wrote: * TRICK BRAIN TEASER  S E Q U E N C _ What letter can you place on the line, other than E, to complete this sequence? *

[algogeeks] Re: Divisibility by five

2011-05-03 Thread RAghu
http://www.ken.duisenberg.com/potw/archive/arch05/050608sol.html On May 3, 9:25 am, Dave dave_and_da...@juno.com wrote: Given an integer n, give an O(log n) algorithm to determine if n is divisible by 5 without using division or mod. -- You received this message because you are subscribed to