Re: [algogeeks] Find THE NUMBERS URGENT PLZZZZZ HELP...........
This Question is from ACM-ICPC 2011 Amritapuri online round which ends today at 1pm so no answers to this post till 1 pm On Sun, Oct 16, 2011 at 11:12 AM, Pradex wrote: > Given two number A and B, count all the number lies between them > including both which have no more than two digit in common 1 <= A <= B > <= 10^18 > eg. : 100 120 > output : 20 excluding 111 > please help very important ?? > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Find THE NUMBERS URGENT PLZZZZZ HELP...........
Given two number A and B, count all the number lies between them including both which have no more than two digit in common 1 <= A <= B <= 10^18 eg. : 100 120 output : 20 excluding 111 please help very important ?? -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Given a String with unnecessary spaces, compact it in place
This is doing a leftshift equivalent right? its asked if there is another solution.. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/vc7DL3vWVy8J. 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.
Re: [algogeeks] Amazon Question - Find Pythagorean triplet in an unsorted array
This appears to be n^(3/2) complexity, looking at one of the solutions in
http://stackoverflow.com/questions/575117/pythagorean-triplets
assuming elements as sorted. (x cannot be greater than sqrt(2z) as x2+y2 =
z2 --> for the worst value of y2 --> 2x^2 = z2
MaxX = ( 2 * N - 1 ) ** 0.5
for x in 3..MaxX {
y = x+1
z = y+1
m = x*x + y*y
k = z * z
while z <= N {
while k < m {
z = z + 1
k = k + (2*z) - 1
}
if k == m and z <= N then {
// use x, y, z
}
y = y + 1
m = m + (2 * y) - 1
}
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/UjRPZ8oIbmkJ.
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.
[algogeeks] print vertical sums of a binary tree
Hi, A binary tree is given we need to print vertical sums of nodes. for example 12 34 5 | | 5| | | | / | \ | | | | / |8 | | | / | / |\| | 4 |/| 10 |/ | \9| | | / | \ | | 7 | 6 | | | | | | | | | | | --- 7 4 20 8 10 Here we need to print sum 7,4,20,8,10. -Thanks -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Inplace Array Convertion
cheers.. clear explanation. thanks for the effort.. :) so.. we swap 3 elements and.. run for one complete cycle of N/3 time in this prob.. Anika has a recusion of N/3 depth.. may be.. a loop that runs N/3 time should suffice. :) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/fypIulpcmZ8J. 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.
Re: [algogeeks] Re: Counting Diagonals in a Polygon
Are you talking about 7th application th wiki of catalan numbers?? i think here case is differentregions are not necessarily triangles.. ??? On Sun, Oct 16, 2011 at 3:43 AM, sravanreddy001 wrote: > This is calalan Number. where n = k+1 > > very interesting and complex probs... > > http://en.wikipedia.org/wiki/Catalan_number > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/OQ_qMqpAP0YJ. > > 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. > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Inplace Array Convertion
In/Out Shuffle are two shuffling algorithms used for shuffling cards consider a pack of cards (so N = 52) and let cards are numbered from 1, 52 *In Shuffle *: cards are divided into 2 piles (k = 2) (1,2,3.26) (27,28,...52) afer one shuffle operation cards will be like (27,1)(28,2) ..(52,26) and it can be found that the card at position i(0 indexed) has moved to its new position given by formula *i <- 2*i %(N+1) N = 52 *for k piles answer will be simply *k*i % (N+1) N = 52* *Out Shuffle *: cards are divided into 2 piles (k = 2) (1,2,3.26) (27,28,...52) afer one shuffle operation cards will be like (1, 27)(2,28) ..(26,52) and it can be found that the card at position i(0 indexed) has moved to its new position given by formula *i <- 2*i %(N-1) N = 52 *for k piles answer will be simply *k*i % (N-1) N = 52 *now relating this to the Question in this thread k = 3 N = total no of elements in the array shuffle is Out shuffle now for writing program i think it can be done in O(2*n) ...will try to code soon :) On Sun, Oct 16, 2011 at 3:16 AM, sravanreddy001 wrote: > Anika, > Your algorithm appears to take O(n^2) time and also O(n) space in recursion > stack space, storing the 3 elements in recursion level. > > The direct shifting of elements to the right will take O(n2) time and O(1) > space. > > Please comment if my assumptions are incorrect. > > Can anyone provide weblink for IN?OUT shuffle card shuffling prob related > to this scenario. > and Memory efficient rearragnement of array elements. > > Thanks, > sravanreddy001 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/RdrlNoIGpBEJ. > > 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. > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Counting Diagonals in a Polygon
This is calalan Number. where n = k+1 very interesting and complex probs... http://en.wikipedia.org/wiki/Catalan_number -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/OQ_qMqpAP0YJ. 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.
Re: [algogeeks] Re: Inplace Array Convertion
Anika, Your algorithm appears to take O(n^2) time and also O(n) space in recursion stack space, storing the 3 elements in recursion level. The direct shifting of elements to the right will take O(n2) time and O(1) space. Please comment if my assumptions are incorrect. Can anyone provide weblink for IN?OUT shuffle card shuffling prob related to this scenario. and Memory efficient rearragnement of array elements. Thanks, sravanreddy001 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/RdrlNoIGpBEJ. 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.
Re: [algogeeks] Re: Inplace Array Convertion
Hi Anika, Can you comment on the complexity of the algorithm? It appears to be like an O(n^2). By the way, we are asked for a inplace sort, and this recursive call stores the 3 element(a,b,c) in each level. So, i iterations, and starting value of i is n/3.. so this takes an additional O(n) time. If we have additional space, it can done in O(n) time. The direct moving of elements towards the right takes O(n^2) time and no additional space. @All: please comment on the above explanation. (I couldn't find the link or source for the IN/OUT Shuffle card shuffle problems, hence looked at your code ) plz provide an weblink of the card shuffle or memory efficient rearrangement problem. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/juVr-bx5fVoJ. 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.
Re: [algogeeks] Re: Inplace Array Convertion
initial call to this function is arrange(arr,n/3,n/3) where n is actually
3*n as per the question , like n=30 for a1,...,a10,b1,...,b10,c1,c10
The idea used here is that for some i-1 ranging from 1 to 9 for above
example, i-1 goes to 3*(i-1), n+i-1 to 3*(i-1) +1, and 2*n+i-1 to
3*(i-1)+2.. recursive function calls are used
void arrange(int arr[], int n, int i)
{
if(i == 1)
{
arr[1] = arr[n];
arr[2] = arr[2*n];
return;
}
int a = arr[i - 1];
int b = arr[n + i - 1];
int c = arr[2*n + i - 1];
arrange(arr, n, i - 1);
int x = 3 * (i - 1);
arr[x] = a;
arr[x + 1] = b;
arr[x + 2] = c;
}
On Sat, Oct 15, 2011 at 11:14 AM, Ankur Garg wrote:
> @Dan ..can you post the algo here or link to the book??
> @Anika ...yes please post the code here..but please explain a bit about
> underlying algo ...(algo is more important than actual code )
>
>
>
> On Sat, Oct 15, 2011 at 1:54 AM, Dan wrote:
>
>> On Oct 13, 7:52 pm, "shiva@Algo" wrote:
>> > Convert an array "a1 a2 a3...an b1 b2 b3...bn c1 c2 c3...cn" to "a1b1c1
>> > a2b2c2...anbncn", inplace
>>
>>
>> See the algorithm for memory efficient rearrangement of array elements
>> in one of the books by Robert Sedgewick such as Algorithms in C++ or
>> Algorithms in Pascal, etc.
>>
>> Dan
>>
>> --
>> 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, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
> --
> 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, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
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, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Inplace Array Convertion
i have already mentioned the source it is famous shuffling algorithm. u can seach some papers on In-Shuffle and Out-Shuffle the original question in the shuffling is like how many times we need to shuffle the cards after which they will return back to initial sequence. On Sat, Oct 15, 2011 at 5:35 PM, Ankur Garg wrote: > @Sunny ..Superb Algo ..but can you share some link where we can read abt it > :)..especially where the info abt the equation u used is given > > > Thanks in Advance > > > On Sat, Oct 15, 2011 at 12:37 PM, Kunal Patil wrote: > >> @Sunny: Thanks for the info !! That's gr8..& your logic also seems to be >> working perfectly fine.. >> >> >> On Sat, Oct 15, 2011 at 12:16 PM, shady wrote: >> >>> u can always post the code.,... but before posting code, you must state >>> your algorithm >>> else code becomes useless for other users >>> >>> On Sat, Oct 15, 2011 at 1:10 AM, Anika Jain wrote: >>> i have the code solution to this.. if m allowed to post it here then i can i post it. m i allowed to post code here? On Fri, Oct 14, 2011 at 9:40 PM, gaurav yadav < gauravyadav1...@gmail.com> wrote: > @shiva...keep swapping the underline elements > > a1*a2*a3a4a5*b1*b2b3b4b5c1c2c3c4c5 > a1b1*a3*a4a5a2b2b3b4b5*c1*c2c3c4c5 > a1b1c1*a4*a5*a2*b2b3b4b5a3c2c3c4c5 > a1b1c1a2*a5*a4*b2*b3b4b5a3c2c3c4c5 > a1b1c1a2b2*a4*a5b3b4b5a3*c2*c3c4c5 > a1b1c1a2b2c2*a5*b3b4b5*a3*a4c3c4c5 > a1b1c1a2b2c2a3b3*b4*b5a5a4*c3*c4c5 > a1b1c1a2b2c2a3b3c3*b5*a5*a4*b4c4c5 > a1b1c1a2b2c2a3b3c3a4*a5*b5*b4*c4c5 > a1b1c1a2b2c2a3b3c3a4b4*b5*a5*c4*c5 > a1b1c1a2b2c2a3b3c3a4b4*c4*a5*b5*c5 > a1b1c1a2b2c2a3b3c3a4b4c4a5b5c5 > > > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. >>> >>> -- >>> 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, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> 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, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Inplace Array Convertion
@Sunny ..Superb Algo ..but can you share some link where we can read abt it :)..especially where the info abt the equation u used is given Thanks in Advance On Sat, Oct 15, 2011 at 12:37 PM, Kunal Patil wrote: > @Sunny: Thanks for the info !! That's gr8..& your logic also seems to be > working perfectly fine.. > > > On Sat, Oct 15, 2011 at 12:16 PM, shady wrote: > >> u can always post the code.,... but before posting code, you must state >> your algorithm >> else code becomes useless for other users >> >> On Sat, Oct 15, 2011 at 1:10 AM, Anika Jain wrote: >> >>> i have the code solution to this.. if m allowed to post it here then i >>> can i post it. m i allowed to post code here? >>> >>> >>> On Fri, Oct 14, 2011 at 9:40 PM, gaurav yadav >> > wrote: >>> @shiva...keep swapping the underline elements a1*a2*a3a4a5*b1*b2b3b4b5c1c2c3c4c5 a1b1*a3*a4a5a2b2b3b4b5*c1*c2c3c4c5 a1b1c1*a4*a5*a2*b2b3b4b5a3c2c3c4c5 a1b1c1a2*a5*a4*b2*b3b4b5a3c2c3c4c5 a1b1c1a2b2*a4*a5b3b4b5a3*c2*c3c4c5 a1b1c1a2b2c2*a5*b3b4b5*a3*a4c3c4c5 a1b1c1a2b2c2a3b3*b4*b5a5a4*c3*c4c5 a1b1c1a2b2c2a3b3c3*b5*a5*a4*b4c4c5 a1b1c1a2b2c2a3b3c3a4*a5*b5*b4*c4c5 a1b1c1a2b2c2a3b3c3a4b4*b5*a5*c4*c5 a1b1c1a2b2c2a3b3c3a4b4*c4*a5*b5*c5 a1b1c1a2b2c2a3b3c3a4b4c4a5b5c5 -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. >>> >>> -- >>> 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, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> 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, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] I want "Pointers in C" ebook. please forward it
offtopic thread closed * On Sat, Oct 15, 2011 at 12:39 PM, kumar raja wrote: > > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > 10it60...@iitkgp.ac.in > > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Sms Api
* thread closed On Sat, Oct 15, 2011 at 2:15 PM, Mohak Naik wrote: > SMSLib API > > > On Sat, Oct 15, 2011 at 10:02 AM, Sehaj Singh Kalra wrote: > >> Does anyone knows any sms api which i can integrate with my own api? >> Reply asap.. its urgent... >> >> Sehaj >> IIT-Delhi >> Computer Science, 2nd sem >> >> -- >> 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, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Counting Diagonals in a Polygon
CSI : Computer Science Integrated (5yr) CSE is 4 year On Sat, Oct 15, 2011 at 1:59 PM, hary rathor wrote: > sunny : are you in 5th year . i have heard that b-tech is 4 year degree?. > > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Sms Api
SMSLib API On Sat, Oct 15, 2011 at 10:02 AM, Sehaj Singh Kalra wrote: > Does anyone knows any sms api which i can integrate with my own api? > Reply asap.. its urgent... > > Sehaj > IIT-Delhi > Computer Science, 2nd sem > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] I want "Pointers in C" ebook. please forward it
-- Regards Kumar Raja M.Tech(SIT) IIT Kharagpur, 10it60...@iitkgp.ac.in -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Counting Diagonals in a Polygon
sunny : are you in 5th year . i have heard that b-tech is 4 year degree?. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Inplace Array Convertion
@Sunny: Thanks for the info !! That's gr8..& your logic also seems to be working perfectly fine.. On Sat, Oct 15, 2011 at 12:16 PM, shady wrote: > u can always post the code.,... but before posting code, you must state > your algorithm > else code becomes useless for other users > > On Sat, Oct 15, 2011 at 1:10 AM, Anika Jain wrote: > >> i have the code solution to this.. if m allowed to post it here then i can >> i post it. m i allowed to post code here? >> >> >> On Fri, Oct 14, 2011 at 9:40 PM, gaurav yadav >> wrote: >> >>> @shiva...keep swapping the underline elements >>> >>> a1*a2*a3a4a5*b1*b2b3b4b5c1c2c3c4c5 >>> a1b1*a3*a4a5a2b2b3b4b5*c1*c2c3c4c5 >>> a1b1c1*a4*a5*a2*b2b3b4b5a3c2c3c4c5 >>> a1b1c1a2*a5*a4*b2*b3b4b5a3c2c3c4c5 >>> a1b1c1a2b2*a4*a5b3b4b5a3*c2*c3c4c5 >>> a1b1c1a2b2c2*a5*b3b4b5*a3*a4c3c4c5 >>> a1b1c1a2b2c2a3b3*b4*b5a5a4*c3*c4c5 >>> a1b1c1a2b2c2a3b3c3*b5*a5*a4*b4c4c5 >>> a1b1c1a2b2c2a3b3c3a4*a5*b5*b4*c4c5 >>> a1b1c1a2b2c2a3b3c3a4b4*b5*a5*c4*c5 >>> a1b1c1a2b2c2a3b3c3a4b4*c4*a5*b5*c5 >>> a1b1c1a2b2c2a3b3c3a4b4c4a5b5c5 >>> >>> >>> >>> -- >>> 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, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> 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, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
