take cube of both sides and proceed
(a+b+c)^3 = C1^3 rest do it yourself.
On Thu, May 16, 2013 at 12:28 AM, Soumya Prasad Ukil
ukil.sou...@gmail.comwrote:
If a+b+c=C1 and ab+bc+ac=C2, how do you get abc?
C1,C2 are constant.
--
regards,
soumya prasad ukil
--
You received this message
@shady : look for the implementation of Matcher class.. may be that could
help .
On Sun, Dec 23, 2012 at 11:01 PM, shady sinv...@gmail.com wrote:
that's the point, Have to implement it from scratch... otherwise java has
regex and matcher, pattern to solve it...
On Sun, Dec 23, 2012
yes ofcourse... dats the easiest i suppose...
but in one of my interviews, i told this approach, but was then asked not
to use space (which i was ,to store inorder)
So for such cases, you must try other approaches as well. (DO inorder,keep
track of previously visited node and compare it with
XOR option wont work for floating points so being generic, using temp
variable is the best option for swapping.
Anyways, the question requirement was to swap without temp, hence above
given solutions go right.
On Mon, Nov 5, 2012 at 10:43 AM, atul anand atul.87fri...@gmail.com wrote:
a=a^b;
then please post it here as others might also be in need for the same.
On Sat, Oct 6, 2012 at 2:09 PM, vindhya chhabra vindhyachha...@gmail.comwrote:
m sorry for this ques:) i got to know about it.
On Sat, Oct 6, 2012 at 1:42 PM, vindhya chhabra
vindhyachha...@gmail.com wrote:
any one has
external merge sort could be handy.
On Fri, Oct 5, 2012 at 8:51 PM, Raghavan its...@gmail.com wrote:
You mean 1 to 300million is given and any one number is missing midst of
it?
On Fri, Oct 5, 2012 at 12:19 AM, Sanjay Rajpal srn...@gmail.com wrote:
We are given 300 million 9-digit numbers
whats the need for such a hack
On Wed, Sep 12, 2012 at 10:56 AM, bharat b bagana.bharatku...@gmail.comwrote:
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
cmon.. what logic are you applying ? its the arrangements.. so basically
this is what will happen
there are three places __,__,__ first can be filled in 6 ways,Since
repetition is not allowed,second place could be filled in 5 ways and third
in 4
So total arrangements so far = 6*5*4 = 120 . Now
I guess 720 must be the ans.
Its like forming three-letter words out of given 6 without repetition.
In that case = 6p3 * 3!
On Thu, Sep 6, 2012 at 3:53 PM, atul anand atul.87fri...@gmail.com wrote:
seems output should be 20.
On Thu, Sep 6, 2012 at 3:26 PM, tendua bharat.kra...@gmail.com
I guess it might be
finding maximum sum path for left subtree + max sum path for right subtree
+ root-data
As in case of finding the diameter which say
height(root-left)+height(root-right)+1
Please correct me!
On Mon, Aug 27, 2012 at 11:46 PM, kunal rustgi rustogi.ku...@gmail.comwrote:
@ravi
its DU . please guide with watever details you have.
thanks
On Fri, Aug 24, 2012 at 4:42 PM, JITESH KUMAR jkhas...@gmail.com wrote:
Which college?
I can help you.
On Wed, Aug 22, 2012 at 11:23 PM, Arun Kindra arunkin...@gmail.comwrote:
Anyone know the paper pattern or ques of snapdeal?
Abstract class are used for Abstraction
Interface are used for Polymorphism
On Thu, Aug 23, 2012 at 6:06 PM, Amit Tiwari amit.monu...@gmail.com wrote:
With an abstract class, the subclass of that inheritance tree only can and
should provide the definitions of the methods. With an interface,
U r passing x in the method stringTimes and in loop there is 'n' .. so
complier error :P
make it x and u'll get HiHi
On Wed, Aug 22, 2012 at 2:36 AM, Rohit Singhal rsinghal.it...@gmail.comwrote:
what error it is showing
On Wed, Aug 22, 2012 at 12:41 AM, Rajesh Kumar
doubly linked list by each time selecting middle node
and recursively calling left part of linked list and right part of linked
list.
On Tue, Aug 7, 2012 at 10:23 PM, vaibhav shukla
vaibhav200...@gmail.comwrote:
Hi all
The problem is to convert a binary tree into Binary Search Tree
My
Hi all
The problem is to convert a binary tree into Binary Search Tree
My approach was :
1. Store the Inorder traversal of BT in an array.
2. Sort the array in ascending order.
3. Again do inorder traversal and write the Node's data from array one by
one.
This approach takes O(n) extra space.
Given a singly linked list with a random pointer pointing to any node(can
be even null).
Create a clone of the list.
node structure can be :
struct node {
struct node *next;
struct node *random;
...
Basically they want to make Sure U understand the question..
Implementation is jst a copy of the content of the current SLL Node and
rewiring the rest.
On Sun, Aug 5, 2012 at 6:39 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
Given a singly linked list with a random pointer pointing
you had the java class so now wats the need of any implementation :P
well jokes apart
Specify the exact requirement ie when u say method which returns the
respective object of the class based on given data(instance variable : what
type of object you want from this method?
and what does these
Stack will do it...
and min or max can be even retrieved in O(1) ...
On Sun, Jul 15, 2012 at 6:36 PM, adarsh kumar algog...@gmail.com wrote:
Oh ya sorry. I thought we have to retrieve kth min and max, in which case
heap can be used.
Here, we can either use stack or map. Map can be from a
For such case .. circular linked list will come handy to be able to delete
last node.
On Tue, Jul 10, 2012 at 8:28 AM, deepikaanand swinyanand...@gmail.comwrote:
No there is no way to delete the last node in such a situation
though u can replace the info part of such a last node with
This might Help
http://en.wikipedia.org/wiki/Quine_(computing)
On Thu, Jun 28, 2012 at 2:01 PM, Mad Coder imamadco...@gmail.com wrote:
Please explain the output of following C code
#includestdio.hchar *str = char *str = %c%s%c; main(){ printf(str, 34,
str, 34);};
int main()
{
4 boys , 3 girls ..
7 children
b: no. of boys
g: no of girls
b-1=g (1st condition)
b=2(g-1) (2nd condition) gives the answer
On Thu, Oct 6, 2011 at 3:42 PM, shady sinv...@gmail.com wrote:
7, try thinking by yourself...
if anyone has some different answer only then post
On Oct 6, 3:05
if there is no bond then u must go... after all its money and technology for
which japan is good..
gud luck
On Thu, Sep 1, 2011 at 12:39 PM, rahul sharma rahul23111...@gmail.comwrote:
salary is good...u can gobe with in technology with japannn..gud
luck
On Thu, Sep 1, 2011 at 12:37
newton raphson will do it.. :)
On Tue, Aug 30, 2011 at 3:55 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
i don't whethe you have studied a subject cbnst from that use newton
raphson method
On Tue, Aug 30, 2011 at 2:39 AM, Ankuj Gupta ankuj2...@gmail.com wrote:
U can use binary
given three sorted arrays not necessary of same length (length is given)
we have to determine the middle element such that the element will be the
middle one of the such an array which will be formed if all three given
arrays are merged in
sorted order.
input :- arr1 : 1,3,5,7
arr2
:)
On Sun, Aug 21, 2011 at 10:34 AM, Puneet Chawla puneetchawla...@gmail.com
wrote:
Here by just applying merge on these array as they are sorted and
calculate the middle element..Am i rt..???
On Sun, Aug 21, 2011 at 10:59 PM, vaibhav shukla vaibhav200...@gmail.com
wrote:
given three sorted
, 2011 at 11:09 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
@puneet : but u cant use extra memory
On Sun, Aug 21, 2011 at 11:08 PM, Sanjay Rajpal srn...@gmail.com wrote:
Take three pointers to the beginning of each array say i,j,k.
Now let sum = len a +len b + len c.
k=0
now start from
area of coin = pie * 1^2 = n(e)
area of square= 2^2 * 4(as there are four such squares)= n(S)
probablility = n(E)/n(S) = pie/16 . the ans ;)
On Fri, Aug 19, 2011 at 10:20 PM, priya ramesh
love.for.programm...@gmail.com wrote:
A 1 inch diameter coin is thrown on a table covered with a
current node deletion is possible
just copy the next value to the current value,now u are required to delete
the next node.Simple.
but if the deleted node is last one...this will give problem but that too
can be solved if using circular link list
On Mon, Aug 8, 2011 at 9:54 PM, Debabrata Das
@raj : its about to come to our campus too..questions hv been uploaded
already in grp. Do send the questions which they ask please
On Tue, Aug 9, 2011 at 12:09 AM, raj kumar megamonste...@gmail.com wrote:
hi friends ,
thoughtworks is coming to our campus after two days.
please send me the
@somya : pls mail me the questions which they asked
On Tue, Aug 9, 2011 at 12:20 AM, somya mishra somya.bvm...@gmail.comwrote:
5.85 ctc
On Tue, Aug 9, 2011 at 12:19 AM, somya mishra somya.bvm...@gmail.comwrote:
firstly there will be a written round whose questions will be modelled to
test
first transpose it
now reverse colums if u want a clockwise rotation
else reverse rows for anti clockwise rotation
On Sat, Aug 6, 2011 at 11:48 PM, Algo Lover algolear...@gmail.com wrote:
Can anyone solve this problem without using extra matrix
--
You received this message because you are
Given a string,remove all duplicates words:
input: where there is a will there is a way
o/p : where will way.
--
best wishes!!
Vaibhav
MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
give it in C/C++
On Fri, Aug 5, 2011 at 1:57 PM, aj aj.jaswa...@gmail.com wrote:
you can write a python program to do that easily.
program starts here :
c=str.split(raw_input())
d=[]
for x in c:
d[x]=0
print list(d)
--
You received this message because you are subscribed to
sorry one more constraint : no extra memory
On Fri, Aug 5, 2011 at 2:03 PM, payel roy smithpa...@gmail.com wrote:
Hash table ???
On 5 August 2011 13:58, vaibhav shukla vaibhav200...@gmail.com wrote:
give it in C/C++
On Fri, Aug 5, 2011 at 1:57 PM, aj aj.jaswa...@gmail.com wrote:
you
provide a solution whether greater than O(n)
On Fri, Aug 5, 2011 at 2:09 PM, saurabh singh saurab...@gmail.com wrote:
use maps for implementation of hash table...
if no extra memory allowed then no possible solution within o(n) i
think.
On Fri, Aug 5, 2011 at 2:07 PM, ankit sambyal
, vaibhav shukla vaibhav200...@gmail.com
wrote:
provide a solution whether greater than O(n)
On Fri, Aug 5, 2011 at 2:09 PM, saurabh singh saurab...@gmail.com
wrote:
use maps for implementation of hash table...
if no extra memory allowed then no possible solution within o(n) i
think
we can use radix sort
On Tue, Aug 2, 2011 at 7:41 PM, payel roy smithpa...@gmail.com wrote:
It may create duplicate numbers while converting into base N. How
do recognize them while converting into base(N^2)??
On 2 August 2011 17:20, Harshit Kapoor kapoor...@gmail.com wrote:
I think that
@saurabh : then please explain the algorithm even of using 8 ints
On Tue, Aug 2, 2011 at 7:24 PM, saurabh singh saurab...@gmail.com wrote:
and optimize as much as you can...even if the interviewer says that he is
satisfied
I was asked Q.1 mentioned above.I first used bitset.He asked me
side of the largest square = H.C.F of length and breadth
total no. of squares = (length*breadth) / side^2
On Tue, Aug 2, 2011 at 7:27 PM, vaibhavmitta...@gmail.com wrote:
A and B are length and breath of current rectangle to fill..
in above example in the ques if i fill 1x1 squares along
and finallize
the objects.
3: when we call using System.gc or Runtime.getruntime.gc
pls correct me if i m wrong
On Sat, Jul 30, 2011 at 11:10 AM, vaibhav shukla
vaibhav200...@gmail.comwrote:
please give a glimps of how garbage collection is done in java.
how *System.gc()* works ?
--
best
please give a glimps of how garbage collection is done in java.
how *System.gc()* works ?
--
best wishes!!
Vaibhav
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
concept of sequence points.search wiki
On Sun, Jul 31, 2011 at 1:38 AM, aditi garg aditi.garg.6...@gmail.comwrote:
it would be undefined...
On Sun, Jul 31, 2011 at 1:34 AM, Kamakshii Aggarwal kamakshi...@gmail.com
wrote:
3.it is same as b=b+1;
On Sun, Jul 31, 2011 at 1:32 AM, aseem
If u have 2GB of data file which has one string per line and u have to sort
it, and X MB of memory is available.then divide the file into 'K' chunks of
X MB each. Bring each chunk into memory and sort lines by any usual O(nlgn)
algorithm \. Save the lines back to files.
D this for all chunks and
will there be any difference in size on 32 machine and on 64 bit machine ?
how and what ?
On Tue, Jul 26, 2011 at 7:58 PM, kavitha nk kavithan...@gmail.com wrote:
sry frendzma above posts were wrongans is 28 if ptr takes 4
bytes...
//BE COOL// kavi
--
You received this message
add printf(\b); after while loop
On Sun, Jul 24, 2011 at 7:54 PM, nullpointer nullpointer...@gmail.comwrote:
#includestdio.h
main()
{int a,b,n,fib=0;
a=0,b=1;
scanf(%d,n);
if(n==0||n==1)
printf(%d\n,n);
while(n--!=0)
{
fib=a+b;
a=b;
b=fib;
printf(%d+,fib);
}
}
for n = 3 o/p
generate all possible permutations and check each permutation whether it is
palindrome or not.
On Sun, Jul 24, 2011 at 7:55 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
Using the all characters of a given String how to specify either
a palindrome or not.
Ex:-
1) String=teste
After
then too it will work. the purpose is just to eliminate the last plus sign
On Sun, Jul 24, 2011 at 8:04 PM, naveen ms naveenms...@gmail.com wrote:
hey if n is 0 or 1..then \b wont work...i mean there ll be no output at all
--
You received this message because you are subscribed to the Google
:) :)
On Sun, Jul 24, 2011 at 8:14 PM, naveen ms naveenms...@gmail.com wrote:
ya...coz new line is printed in the first PRINTF..it works fine..:)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
maintain just a tail pointer
On Sat, Jul 23, 2011 at 12:45 AM, rShetty rajeevr...@gmail.com wrote:
Come Up with an Algorithm to implement the insertion of a node in
circular linked list without actually traversing the list ?
--
You received this message because you are subscribed to the
.
On Sat, Jul 23, 2011 at 12:50 AM, rShetty rajeevr...@gmail.com wrote:
Algorithm Please ... Thank You
On Jul 23, 12:17 am, vaibhav shukla vaibhav200...@gmail.com wrote:
maintain just a tail pointer
On Sat, Jul 23, 2011 at 12:45 AM, rShetty rajeevr...@gmail.com
one solution could be:
#includestdio.h
#includestring.h
char non_repetition(char *p,int size)
{
int i,j,flag=0;
for(i=0;isize;i++)
{
for(j=0;jsize;j++)
{
if(j==i)
continue;
if(p[i]==p[j])
flag=1;
}
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google
to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received
, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message
...@gmail.comwrote:
@vaibhav: no it wont coz its printing empty strings.. nothing will be
printed
On Wed, Jul 13, 2011 at 4:42 PM, vaibhav shukla
vaibhav200...@gmail.comwrote:
@anika : ur ans will give the sum but will also leave that much amount of
space before printing the sum
one betther idea
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because
evaluate not other two increments :)
On Sun, Jul 10, 2011 at 11:31 PM, rShetty rajeevr...@gmail.com wrote:
Got it Thanks .
On Jul 10, 10:40 pm, vaibhav shukla vaibhav200...@gmail.com wrote:
associativity comes into play when operators are of same precedence.
On Sun, Jul 10, 2011 at 11:08 PM
Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU
/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks
to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received
to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
time.when the first ptr reaches end then
seconf ptr will be at middle
On Mon, Jul 11, 2011 at 6:15 PM, vaibhav shukla
vaibhav200...@gmail.comwrote:
i have considered it (n/2+1)th
and didn't bothered much :P
On Mon, Jul 11, 2011 at 4:57 PM, Anika Jain anika.jai...@gmail.comwrote:
*if i
this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because
to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you
with n=(height*width)/side^2 .. u can calculate the side if n would be
given.
On Sun, Jul 10, 2011 at 10:37 PM, vaibhav agarwal
vibhu.bitspil...@gmail.com wrote:
@vaibhav this fails as n will be provided in the question.
On Sun, Jul 10, 2011 at 9:56 PM, vaibhav shukla
vaibhav200
associativity comes into play when operators are of same precedence.
On Sun, Jul 10, 2011 at 11:08 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
has higher precedence than ||
the expression is evaluated as
z=j || ( k i );
hence the output i.e 1 ;)
On Sun, Jul 10, 2011 at 11:06 PM
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you
, 2011 at 10:20 PM, surender sanke
surend...@gmail.comwrote:
always maintain front and rear pointers, updating them accordingly
during insertion and deletion can achieve this in O(1)
surender
On Mon, Jul 4, 2011 at 9:59 PM, vaibhav shukla
vaibhav200...@gmail.com wrote:
How to implement
How to implement a QUEUE using a singly link list such that the operations
ENQUEUE and DEQUEUE takes O(1) time ?
--
best wishes!!
Vaibhav Shukla
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
, 2011 at 9:59 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
How to implement a QUEUE using a singly link list such that the operations
ENQUEUE and DEQUEUE takes O(1) time ?
--
best wishes!!
Vaibhav Shukla
--
You received this message because you are subscribed to the Google Groups
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm
://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
h.yup
On Mon, Jun 27, 2011 at 10:18 PM, vaibhav agarwal
vibhu.bitspil...@gmail.com wrote:
@vaibhav just like u swap two int variable without using 3rd
On Mon, Jun 27, 2011 at 10:17 PM, vaibhav shukla
vaibhav200...@gmail.comwrote:
and how will swap without using temp variable
#includestdio.h
#define power(a) #a
int main()
{
printf(%d,*power(432));
return 0;
}
ans is 52 on gcc. Explain plss
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
position of the string, 52, which
is the ascii value of 4, will be printed.
On Thu, Jun 23, 2011 at 3:40 PM, vaibhav shukla
vaibhav200...@gmail.comwrote:
#includestdio.h
#define power(a) #a
int main()
{
printf(%d,*power(432));
return 0;
}
ans is 52 on gcc. Explain plss
--
best
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav
group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed
@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed
Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU
@utkarsh : that we've came to know from your last to last
post...Anyways..stay cool
On Thu, Apr 28, 2011 at 7:52 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
But i am a BAD boy.
On Thu, Apr 28, 2011 at 7:48 PM, vaibhav shukla
vaibhav200...@gmail.comwrote:
@utkarsh : thats like
.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You
!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options
for or against it.
*
So the pirate proposing the distribution can't vote for himself.
--
Shuaib
http://twitter.com/ShuaibKhan
http://bytehood.com/
On Thursday, April 21, 2011 at 4:43 PM, vaibhav shukla wrote:
lets consider if there were only 1 pirate. obviously he would take it all
for himself
://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
On Thu, Apr 14, 2011 at 6:49 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote:
* Mathematical Equation Puzzle
By moving one of the following digits, make the equation correct. 62 - 63 =
1
*
move 6 above 2 as its power ie 2^6-63=64-63=1
--
best wishes!!
Vaibhav Shukla
DU-MCA
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
://groups.google.com/group/algogeeks?hl=en.
--
best wishes!!
Vaibhav Shukla
DU-MCA
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
Find the sum of digits of all the numbers whose digits are all in ascending
order from left to right. All these numbers lie between 500 to 1000 and
satisfy M divides (M-1)* !* + 1 , where M is any natural number.
(* ! * denotes factorial of the number)
--
best wishes!!
Vaibhav Shukla
DU
1 - 100 of 106 matches
Mail list logo
