ot;opt is %d\n",opt);
printf("ret is %d\n",ret);
}
}
Regards,
Raghu
On Tue, Sep 13, 2011 at 3:23 AM, Avinash Dharan wrote:
> #include
> void main()
> {
> while(1)
> {
> int opt;
> scanf("%d",&opt);
>pri
What about (9 pow 9) !
On May 6, 4:30 pm, uday kumar wrote:
> 9 pow 9.
>
> On Fri, May 6, 2011 at 3:41 PM, Bala wrote:
> > 99!
>
> > Thanks
> > Bala
>
> > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat wrote:
>
> >> *
> >> LARGEST NUMBER PUZZLE
>
> >> What is the largest number you can get using
http://www.ken.duisenberg.com/potw/archive/arch05/050608sol.html
On May 3, 9:25 am, Dave 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 the Google Groups
"Al
silly but nice one
On May 2, 10:22 pm, neha lawaria wrote:
> F
>
> On Mon, May 2, 2011 at 1:17 PM, Lavesh Rawat 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?
>
> > *
> > *Update Your Answers at* : Cl
