Re: [algogeeks] Re: Power(n^n)
there would no problem of rang if K^(1/N)==N -- 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: Can anyone explain this strange behavior ?
Easy Buddy.. this is primary thing.. Surprise to know that ppls still don't
knw abt this..
for OR:-
if left expr evaluate non zero it won't compute right side.
For And:-
if left expr evalute zero , it won't compute right side
Prem
On Tue, Jun 12, 2012 at 11:10 AM, sengar.mahi wrote:
> Nope ,the output is correct.as I had studied somewhere ,i don't remember
> where exactly but
> in (x||y) type condition's,if x evaluates to true( non zero) then value of
> y doesn't matter and is not evaluated and condition turns out to be true
> anyhow without even checking y ,control never goes to y and y is never
> executed;
> now in your case m=++i || ++j && ++k;
> since precedence of && is more than or,so we can take it as m=++i || (++j
> && ++k);
> now expression evaluates to true just by checking i++ which is -2 now(non
> zero) and value of ++j && ++k is not even checked nor changed ,hence both j
> and k remain unchanged.
> This is a correct explanation u can rely an this.
> thank you :)
>
>
> On Tue, Jun 12, 2012 at 2:19 AM, Dave wrote:
>
>> This is the result of short-circuit evaluation. See, e.g.,
>> http://en.wikipedia.org/wiki/Short-circuit_evaluation, or this topic in
>> your language reference.
>>
>> Dave
>>
>> On Monday, June 11, 2012 2:28:52 PM UTC-5, ((** VICKY **)) wrote:
>>
>>> #includeint main(){int i,j,k,m,l;
>>> i=-3;
>>> j=2;
>>> k=0;m=++i || ++j && ++k ;printf
>>> ("\n%d
>>> %d %d %d",i,j,k,m);return 0;}
>>>
>>> o/p: -2 2 0 1
>>>
>>>
>>> k should be 1 right
>>>
>>>
>>> --
>>> Cheers,
>>>
>>> Vicky
>>>
>>> --
>> 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/-/8PoAya7NqjYJ.
>>
>> 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: Can anyone explain this strange behavior ?
Nope ,the output is correct.as I had studied somewhere ,i don't remember
where exactly but
in (x||y) type condition's,if x evaluates to true( non zero) then value of
y doesn't matter and is not evaluated and condition turns out to be true
anyhow without even checking y ,control never goes to y and y is never
executed;
now in your case m=++i || ++j && ++k;
since precedence of && is more than or,so we can take it as m=++i || (++j
&& ++k);
now expression evaluates to true just by checking i++ which is -2 now(non
zero) and value of ++j && ++k is not even checked nor changed ,hence both j
and k remain unchanged.
This is a correct explanation u can rely an this.
thank you :)
On Tue, Jun 12, 2012 at 2:19 AM, Dave wrote:
> This is the result of short-circuit evaluation. See, e.g.,
> http://en.wikipedia.org/wiki/Short-circuit_evaluation, or this topic in
> your language reference.
>
> Dave
>
> On Monday, June 11, 2012 2:28:52 PM UTC-5, ((** VICKY **)) wrote:
>
>> #includeint main(){int i,j,k,m,l;
>> i=-3;
>> j=2;
>> k=0;m=++i || ++j && ++k ;printf
>> ("\n%d
>> %d %d %d",i,j,k,m);return 0;}
>>
>> o/p: -2 2 0 1
>>
>>
>> k should be 1 right
>>
>>
>> --
>> Cheers,
>>
>> Vicky
>>
>> --
> 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/-/8PoAya7NqjYJ.
>
> 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] c++ webservice in linux machine
use gSOAP On Tue, Jun 12, 2012 at 5:24 AM, rgap wrote: > Hi > > i want to write a c++ webservice which should work in linux machine > with apache being the web server. > > Are there any libraries which allow you to write server-side > applications that handle the HTTP requests with Apache being the > webserver on Linux? > > 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. > > -- 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] c++ webservice in linux machine
Hi i want to write a c++ webservice which should work in linux machine with apache being the web server. Are there any libraries which allow you to write server-side applications that handle the HTTP requests with Apache being the webserver on Linux? 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.
[algogeeks] Re: Can anyone explain this strange behavior ?
This is the result of short-circuit evaluation. See, e.g.,
http://en.wikipedia.org/wiki/Short-circuit_evaluation, or this topic in
your language reference.
Dave
On Monday, June 11, 2012 2:28:52 PM UTC-5, ((** VICKY **)) wrote:
> #includeint main(){int i,j,k,m,l;
> i=-3;
> j=2;
> k=0;m=++i || ++j && ++k ;printf
> ("\n%d
> %d %d %d",i,j,k,m);return 0;}
>
> o/p: -2 2 0 1
>
>
> k should be 1 right
>
>
> --
> Cheers,
>
> Vicky
>
>
--
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/-/8PoAya7NqjYJ.
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: Power(n^n)
@Bashrc: The mathematical property is as I gave it: 0 <= N <= 4. Dave On Monday, June 11, 2012 4:43:21 AM UTC-5, .bashrc wrote: > @Guneesh Actually he says "But 0<=N , K<=1000 so N^N could be have 1000 > digits." I think this assertion is wrong.. > @dave sir.. The second part of question still remains unanswered.Is there > any mathematical property... > Saurabh Singh > B.Tech (Computer Science) > MNNIT > blog:geekinessthecoolway.blogspot.com > > > > On Mon, Jun 11, 2012 at 1:56 PM, Guneesh Paul Singh > wrote: > >> @abhisheikh read the problem statement again...it says 1000 digits not >> 1000 value.. >> >> >> -- >> 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 view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/KjF7UEfNtwAJ. 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: Power(n^n)
@Rammar: 0 <= N, K <= 1000 is standard notation for the pair of inequalities 0 <= N <= 1000 and 0 <= K <= 1000. Dave On Monday, June 11, 2012 3:50:11 AM UTC-5, rammar wrote: > @Guneesh > But 0<=N , K<=1000 so N^N could be have 1000 digits. > > There is no direct upper bound on N, but there is an upper bound on K > (i.e. K <= 1000). > And we need to check N^N == K, so N^N cant be more than 1000. > > On Monday, June 11, 2012 1:56:13 PM UTC+5:30, Guneesh wrote: >> >> @abhisheikh read the problem statement again...it says 1000 digits not >> 1000 value.. >> >> -- 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/-/-IE55lphP4sJ. 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] MS Q: how to test a driverless car?
There are certain things that one need to test while assessing a driverless car :- 1> *Gear* - Gears should be changed according to different speed lower limits. For example - 1 st gear upto speed 10 km/hr. 2nd gear upto speed 30 km/hr 3rd gear upto speed 40-50 km/hr 4th gear upto speed 80 km/hr there can be 5th gear also but that depends on gear box. 2> *Intelligent sensing* - car should automatically sense for different things on the road like speed breakers, Weather conditions, obstacle in front of the car, road signs, people etc. The car should sense this whether to turn on the wipers, headlights at night and long range on the highways, speed boards, road signs like zebra crossing etc. There can be many variables for the automatic car control system. -- Akshat Sapra Under Graduation(B.Tech) IIIT-Allahabad(Amethi Campus) *--* sapraaks...@gmail.com akshatsapr...@gmail.com rit20009008@ iiita.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] Need Valuable suggestions
thanks you guys !! On Mon, Jun 11, 2012 at 2:23 PM, amit kumar wrote: > Sandeep, I guess its easy in your case. As you said, one of the profile is > for testing and the other profile is for development. So, the decision to > be taken here is that you want to do testing or development. This decision > is going to affect you career path more than joining Juniper or Tally. > > Regards, > Amit. > On Jun 11, 2012 2:11 PM, "SANDEEP CHUGH" wrote: > >> Guys please tell ur suggestions.. I really need that !! >> >> Thnks in advance !! >> >> On Mon, Jun 11, 2012 at 11:58 AM, SANDEEP CHUGH >> wrote: >> >>> @Manjay Tally came to Our campus for recruitment... >>> >>> >>> On Mon, Jun 11, 2012 at 11:55 AM, Manjay kumar >>> wrote: >>> can you please tell me how to apply in Telly?? On Mon, Jun 11, 2012 at 11:45 AM, SANDEEP CHUGH < sandeep.aa...@gmail.com> wrote: > actually i am a fresher.. > > In juniper , its in testing .. > > In tally designation is sw developer at R&D.. > > so thats y i am confused > > On Mon, Jun 11, 2012 at 11:43 AM, rajesh singarapu < > rajesh0...@gmail.com> wrote: > >> depends on how experienced you are, >> if you are somewhere < 5yrs exp, >> you can go to small company and excel, >> but if you are too less experienced, then it is >> wise to go for brand, it is good for future jumps/opportunities. >> >> >> Congrats && thanks >> Rajesh >> >> >> On Mon, Jun 11, 2012 at 11:39 AM, SANDEEP CHUGH < >> sandeep.aa...@gmail.com> wrote: >> > Heys guys which is better option for growth?? >> > >> > Juniper networks or Tally Solutions Pvt Ltd ? >> > >> > Please do tell ur opinion..Both paying almost same >> > >> > >> > >> > -- >> > 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. > -- Manjay Kumar Dasaundhi Birla Institute of technology, Mesra B.E. (Information Technology) -- 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.
[algogeeks] Re: MS Question : find word in 2D array
A DFS can be used to search the word. Start the search from each element having the starting character of the string. The search will check all the 8- possible directions. However once a path is chosen at the starting character (1 from the 8), the function continues in that single direction direction. if charMap[i][j] = searchStr[0] Call function searchWord(int i, int j, int offsetX, int offsetY) offsetX and offsetY will have values (0,1)-Right (1,1)-Right-Down (1,0)-Down (-1, 1)-Down-left (0, -1)... (-1, -1)... (0, -1).. (1, -1).. The function searchWord will proceed with (i+offserX, j+offSetY). We return failure whenever any out of order character is encountered or we return success when the searchStris exhausted. The question remains... "Can we do better?" On Wednesday, June 6, 2012 7:52:06 PM UTC+5:30, ashgoel wrote: > > WAP to find a word in a 2D array. The word can be formed on > row/col/diagnal/reverse diagnal > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > -- 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/-/oRgLr48Ywj0J. 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] Need Valuable suggestions
Sandeep, I guess its easy in your case. As you said, one of the profile is for testing and the other profile is for development. So, the decision to be taken here is that you want to do testing or development. This decision is going to affect you career path more than joining Juniper or Tally. Regards, Amit. On Jun 11, 2012 2:11 PM, "SANDEEP CHUGH" wrote: > Guys please tell ur suggestions.. I really need that !! > > Thnks in advance !! > > On Mon, Jun 11, 2012 at 11:58 AM, SANDEEP CHUGH > wrote: > >> @Manjay Tally came to Our campus for recruitment... >> >> >> On Mon, Jun 11, 2012 at 11:55 AM, Manjay kumar >> wrote: >> >>> can you please tell me how to apply in Telly?? >>> >>> >>> On Mon, Jun 11, 2012 at 11:45 AM, SANDEEP CHUGH >> > wrote: >>> actually i am a fresher.. In juniper , its in testing .. In tally designation is sw developer at R&D.. so thats y i am confused On Mon, Jun 11, 2012 at 11:43 AM, rajesh singarapu < rajesh0...@gmail.com> wrote: > depends on how experienced you are, > if you are somewhere < 5yrs exp, > you can go to small company and excel, > but if you are too less experienced, then it is > wise to go for brand, it is good for future jumps/opportunities. > > > Congrats && thanks > Rajesh > > > On Mon, Jun 11, 2012 at 11:39 AM, SANDEEP CHUGH < > sandeep.aa...@gmail.com> wrote: > > Heys guys which is better option for growth?? > > > > Juniper networks or Tally Solutions Pvt Ltd ? > > > > Please do tell ur opinion..Both paying almost same > > > > > > > > -- > > 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. >>> >>> >>> >>> -- >>> Manjay Kumar Dasaundhi >>> Birla Institute of technology, Mesra >>> B.E. (Information Technology) >>> >>> -- >>> 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: Power(n^n)
@Guneesh But 0<=N , K<=1000 so N^N could be have 1000 digits. There is no direct upper bound on N, but there is an upper bound on K (i.e. K <= 1000). And we need to check N^N == K, so N^N cant be more than 1000. On Monday, June 11, 2012 1:56:13 PM UTC+5:30, Guneesh wrote: > > @abhisheikh read the problem statement again...it says 1000 digits not > 1000 value.. > > -- 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/-/dswHt9ucfDEJ. 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] Need Valuable suggestions
Tally without any doubt. If you do quality work you will land up in any big brand company in future if you want. For first few years give more preference to WHAT work you do than WHERE you do it. On Mon, Jun 11, 2012 at 2:11 PM, SANDEEP CHUGH wrote: > Guys please tell ur suggestions.. I really need that !! > > Thnks in advance !! > > > On Mon, Jun 11, 2012 at 11:58 AM, SANDEEP CHUGH > wrote: > >> @Manjay Tally came to Our campus for recruitment... >> >> >> On Mon, Jun 11, 2012 at 11:55 AM, Manjay kumar >> wrote: >> >>> can you please tell me how to apply in Telly?? >>> >>> >>> On Mon, Jun 11, 2012 at 11:45 AM, SANDEEP CHUGH >> > wrote: >>> actually i am a fresher.. In juniper , its in testing .. In tally designation is sw developer at R&D.. so thats y i am confused On Mon, Jun 11, 2012 at 11:43 AM, rajesh singarapu < rajesh0...@gmail.com> wrote: > depends on how experienced you are, > if you are somewhere < 5yrs exp, > you can go to small company and excel, > but if you are too less experienced, then it is > wise to go for brand, it is good for future jumps/opportunities. > > > Congrats && thanks > Rajesh > > > On Mon, Jun 11, 2012 at 11:39 AM, SANDEEP CHUGH < > sandeep.aa...@gmail.com> wrote: > > Heys guys which is better option for growth?? > > > > Juniper networks or Tally Solutions Pvt Ltd ? > > > > Please do tell ur opinion..Both paying almost same > > > > > > > > -- > > 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. >>> >>> >>> >>> -- >>> Manjay Kumar Dasaundhi >>> Birla Institute of technology, Mesra >>> B.E. (Information Technology) >>> >>> -- >>> 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. > -- Thanks & Regards, Saurabh -- 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: Power(n^n)
@Guneesh Actually he says "But 0<=N , K<=1000 so N^N could be have 1000 digits." I think this assertion is wrong.. @dave sir.. The second part of question still remains unanswered.Is there any mathematical property... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Mon, Jun 11, 2012 at 1:56 PM, Guneesh Paul Singh wrote: > @abhisheikh read the problem statement again...it says 1000 digits not > 1000 value.. > > > -- > 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] Need Valuable suggestions
Guys please tell ur suggestions.. I really need that !! Thnks in advance !! On Mon, Jun 11, 2012 at 11:58 AM, SANDEEP CHUGH wrote: > @Manjay Tally came to Our campus for recruitment... > > > On Mon, Jun 11, 2012 at 11:55 AM, Manjay kumar wrote: > >> can you please tell me how to apply in Telly?? >> >> >> On Mon, Jun 11, 2012 at 11:45 AM, SANDEEP CHUGH >> wrote: >> >>> actually i am a fresher.. >>> >>> In juniper , its in testing .. >>> >>> In tally designation is sw developer at R&D.. >>> >>> so thats y i am confused >>> >>> On Mon, Jun 11, 2012 at 11:43 AM, rajesh singarapu >> > wrote: >>> depends on how experienced you are, if you are somewhere < 5yrs exp, you can go to small company and excel, but if you are too less experienced, then it is wise to go for brand, it is good for future jumps/opportunities. Congrats && thanks Rajesh On Mon, Jun 11, 2012 at 11:39 AM, SANDEEP CHUGH < sandeep.aa...@gmail.com> wrote: > Heys guys which is better option for growth?? > > Juniper networks or Tally Solutions Pvt Ltd ? > > Please do tell ur opinion..Both paying almost same > > > > -- > 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. >>> >> >> >> >> -- >> Manjay Kumar Dasaundhi >> Birla Institute of technology, Mesra >> B.E. (Information Technology) >> >> -- >> 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: Power(n^n)
@abhisheikh read the problem statement again...it says 1000 digits not 1000 value.. -- 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: MS Question : find word in 2D array
@utsav in cases where u have repeating character in ur search string how would u assign the numbers eg in abaac -- 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.
