[algogeeks] Re: 10 digit problem
i don't think another answer 50 is best answer according to your constraints may sum1 else can think but i found its correct Thanks Shashank -- 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] [brain teaser ] 14march
* Riddle Problem Solution* ** * *The part of the bird that is not in the sky, which can swim in the ocean and always stay dry. *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/14march.html Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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] [brain teaser ] 14march
Wood On Mon, Mar 14, 2011 at 1:45 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * Riddle Problem Solution* ** * *The part of the bird that is not in the sky, which can swim in the ocean and always stay dry. *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/14march.html Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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. -- B. Praveen -- 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] [brain teaser ] 14march
shadow... Regards, Akash Agrawal http://tech-queries.blogspot.com/ On Mon, Mar 14, 2011 at 1:57 PM, Praveen praveen200...@gmail.com wrote: Wood On Mon, Mar 14, 2011 at 1:45 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * Riddle Problem Solution* ** * *The part of the bird that is not in the sky, which can swim in the ocean and always stay dry. *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/14march.html Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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. -- B. Praveen -- 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: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers
@sukhmeet: plz explain ur method if the no is 50 On Sun, Mar 13, 2011 at 8:24 PM, sukhmeet singh sukhmeet2...@gmail.comwrote: I think it can be done like this that assume that the number is represented as 1.. like 4= , 3= 111 ans so on now if u have to fint the total number of ways then it is similar to placing a '+' sign in the mid places Like 3= 1 1 1 so possible are 1+11 (1+2) or 11+1 (2+1) or 1+1+1(1+1+1) hence 3 ways...!! similar approach can be taken .. hence the problem reduces to placing + sign in b/w .. placing 1 '+' , 2 '+' uptill the number it can be formed...!! Correct me if i am wrong..!! On Fri, Mar 11, 2011 at 10:02 PM, saurabh agrawal saurabh...@gmail.comwrote: Do it assuming as two cases. On Fri, Mar 11, 2011 at 9:46 PM, Dave dave_and_da...@juno.com wrote: This is a good place to use recursion. One thing you have to know is whether order matters. E.g., are 2 + 1 and 1 + 2 the same or different ways to represent 3 as a sum of positive integers. This choice will affect the way you write the recursive function. Dave On Mar 11, 9:33 am, saurabh agrawal saurabh...@gmail.com wrote: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers -- 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] SPoj maximum sum subseuence
@ankur: can u plz xplain ur approach?? On Sun, Mar 13, 2011 at 12:26 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote: https://www.spoj.pl/problems/MAXSUMSQ/ Hi in above problem , i am getting TLE but according to given contraints , i think my code is good enough to run. Can any body help me here #include vector #include map #include algorithm #include cstring #include iostream #include cstdio #include cmath #include cstdlib #include climits #define VI vector int typedef long long int LL; using namespace std; VI v; LL x,nos; //finding maximum sum subsequence LL findx() { int sz=v.size(); LL maxsum=INT_MIN; int maxstart=0,maxend=0; LL currentsum=0; int currentstart=0,currentend=0; for(currentend=0;currentendsz;currentend++) { currentsum=currentsum+v[currentend]; if(currentsummaxsum) { maxsum=currentsum; maxstart=currentstart; maxend=currentend; } if(currentsum0) { currentstart=currentend+1; currentsum=0; } } return maxsum; } // main Program int main() { // freopen(input.txt,r,stdin); int test; int num; map LL , LL m; cintest; LL sum=0; int n; int i; while(test--) { sum=0; nos=0; m.clear(); m[0]=1; scanf(%d,n); v.resize(n); for(i=0;in;i++) { scanf(%d,v[i]); } x=findx(); nos=0; for(i=0;in;i++) { sum=sum+v[i]; nos=nos+m[sum-x]; m[sum]++; } coutx nosendl; } return 0; } -- 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: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers
Use DP -- 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] Link list Problem
Are you sure that node is not exit in Link list and also memory is free? On Sun, Mar 13, 2011 at 9:57 AM, abhijith reddy abhijith200...@gmail.comwrote: copy data from the next node and then delete that next node. Say you need to delete 3 1 - 2 - 3 - 4 - 5 1 - 2 - 4 - 4 - 5 * Now delete node which is next to '*'. On Sun, Mar 13, 2011 at 10:23 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote: hi Given a singly Link list but Head of the List is unknown so my question is that How to delete a given node from the List??? -- 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] Need immediately Hyperion Developer -- MA -- Need GC or US Citizen Only !!!!!
Dear Folks, Wishes for the Day !!! We Need consultant for Hyperion Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Hyperion Developer Location : Waltham, MA Duration : 6+Months Rate : Market Need GC or US Citizen Only !* Looking for a Hyperion Developer with 5+ years of experience. The person needs to know Essebase and be able to design and implement new cubes, create Calc Scripts and develop complicated reports. They are not looking for a Hyperion Admin. A Plus would be someone who knows Hyperion Planning. Also a finance background is a plus - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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 an integer n , you have to print all the ways in which n can be represented as sum of positive integers
On Mar 11, 9:33 am, saurabh agrawal saurabh...@gmail.com wrote: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers I suggest you 1) generate the numeric partitions of n. That's the lists of numbers in sorted order whose sum is n. e.g. The numeric partitions of 3 are: {(1,1,1), (1,2), 3} 2) For each partition generate its multiset permutations. Note: there is a formula for how many of sums of positive integers to n there are but I don't what it is. Regards, Ralph Boland -- 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] Interesting Text Editor , Word Question
We have a text editor application where we can choose 1)between 100s of different fonts like arial, calibri, etc.. 2)different text sizes 3) different formatting such as bold, Italics, regular, etc.. Imagine that the application is similar to word(there we will have these options). Now give different test cases to test this application. Thanks Shashank -- 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] Need Java Developer with UI Exp -- OH
Dear Folks, Wishes for the Day !!! We Need consultant for Java Developer with UI Exp Please share suitable profiles to s...@panzersolutions.com *Job Title : ** Java Developer with UI Exp* *Location : Columbus, OH Duration : 6 Months Rate : $45/Hr* Java developer that is strong on the UI. 3-5 years with Javascript. Experience developing using Spring 3.X Experience with AJAX. Experience working with Oracle Stored Procedures. Ability to write medium complex stored procedures - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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] SPoj maximum sum subseuence
i used the following code.. getting wa #includeiostream #includealgorithm #includevector #includelimits.h #includemap using namespace std; typedef unsigned long long int ull; int main() { int t; cint; while(t--) { int n,sm=0; scanf(%d,n); vectorint v(n); mapint,int mp; for(int i=0;in;i++) scanf(%d,v[i]); int sum=INT_MIN,cur=0; for(int i=0;in;i++) { cur+=v[i]; mp[cur]++; if(cursum) { sum=cur; } if(cur0) cur=0; } //coutsum\tmp[sum]+mp[0]\n; printf(%d %d\n,sum,mp[sum]+mp[0]); } } On Mon, Mar 14, 2011 at 7:41 PM, tech rascal techrascal...@gmail.comwrote: @ankur: can u plz xplain ur approach?? On Sun, Mar 13, 2011 at 12:26 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote: https://www.spoj.pl/problems/MAXSUMSQ/ Hi in above problem , i am getting TLE but according to given contraints , i think my code is good enough to run. Can any body help me here #include vector #include map #include algorithm #include cstring #include iostream #include cstdio #include cmath #include cstdlib #include climits #define VI vector int typedef long long int LL; using namespace std; VI v; LL x,nos; //finding maximum sum subsequence LL findx() { int sz=v.size(); LL maxsum=INT_MIN; int maxstart=0,maxend=0; LL currentsum=0; int currentstart=0,currentend=0; for(currentend=0;currentendsz;currentend++) { currentsum=currentsum+v[currentend]; if(currentsummaxsum) { maxsum=currentsum; maxstart=currentstart; maxend=currentend; } if(currentsum0) { currentstart=currentend+1; currentsum=0; } } return maxsum; } // main Program int main() { // freopen(input.txt,r,stdin); int test; int num; map LL , LL m; cintest; LL sum=0; int n; int i; while(test--) { sum=0; nos=0; m.clear(); m[0]=1; scanf(%d,n); v.resize(n); for(i=0;in;i++) { scanf(%d,v[i]); } x=findx(); nos=0; for(i=0;in;i++) { sum=sum+v[i]; nos=nos+m[sum-x]; m[sum]++; } coutx nosendl; } return 0; } -- 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] [brain teaser ] 14march
shadow :) -- Dabendra Singh -- 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] Need immediately Oracle DBA -- Boston,MA (Only Local to MA)
Dear Folks, Wishes for the Day !!! We Need consultant for Oracle DBA Please share suitable profiles to s...@panzersolutions.com *Job Title : Oracle DBA Location : Boston,MA (Only Local to MA) Duration : 6 Months Rate : Market* Need Oracle DBA consultants who are local to MA only !! - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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: Spoj Problem : String based
Could you please explain ..whts the difference b/w KMP Algorithm and This problem. KMP also finds all occurrences of a string in text -- 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] Need Exp IT Recruiters for our offshore office
*Need Exp IT Recruiters for our offshore office.* We are currently looking for exp IT Recruiters (No Sales please) who has 6 Months to 2 years of exp and are has good exp with the pro’s and con’s of IT Field for our offshore office in Abids, Hyderabad. If interested please send me the resumes to rashid...@gmail.com Thanks Gourav Jaiswal -- 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] Need Business Intelligence Administrator /Developer // IL // EAD, US Citizen or Green Card Only !!!!!
Dear Folks, Wishes for the Day !!! We Need consultant for Business Intelligence Administrator /Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Business Intelligence Administrator /Developer Location : Evanston, IL Duration : 3+ Month Rate : $45/Hr EAD, US Citizen or Green Card Only !* Successful Business Intelligence Administrator possess the following characteristics: Minimum BA/BS with record of high academic achievement Certified in Business Intelligence Applications 2-3 years of Business Intelligence design, development, and support Experience in a professional services firm/environment a plus Eagerness to contribute in a team-oriented environment Excellent communication and organizational skills Strong customer service skills Technical expectations include proficiencies in the following: Business Objects XI Release 3 Enterprise, Webi, and Data Integrator Cognos 8 Business Intelligence Informatica PowerCenter 8.5 Data mining and reporting capabilities from enterprise applications/data Proficiency in schema data modeling Proficiency with Business Intelligence Security models General database and data warehousing best practices Working knowledge of Windows, Linux, Unix, Java, XML, .NET, SQL, and Oracle Test, implement, and support applications/reports - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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] Very Very HOT// HOT // HOT Need Oracle Forms Developer -- Pittsburgh, PA ( Only Local to PA)
Dear Folks, Wishes for the Day !!! We Need consultant for Oracle Forms Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Oracle Forms Developer Location : Pittsburgh, PA Duration : 6 – 12 months Rate : Market* Urgent need for: Oracle Forms Developer Send me resumes with 2 professional references. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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] Need ETL Informatica Developer // Boston, MA //
Dear Folks, Wishes for the Day !!! We Need consultant for ETL Informatica Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : ETL Informatica Developer Location : Boston, MA Duration : 6 +Months Rate : $ 50/Hr* *Must Have : Must have HealthCare experience !* Description: • Experience ETL Development using Informatica product • Development experience with Informatica v8 (8.1 8.5, 8,6), v9 • Development experience with Informatica PowerExchange and CDC • Development experience with Informatica PowerCenter, Meta data manager • Development experience with Informatica Data Quality • Experience with Informatica Developer and Informatica Analyst • Development experience with Informatica Data Explorer • Development experience with extract and load data from/to Oracle, MS Server, DB2, VSAM, IMS, Mainframe, MS Access, flat files, XML etc. • Development experience with real-time Informatica data service and web service • Able to understand complex business mapping rules • Experience with implementation of complex data mapping rules • Experience with UML • Experience with InfoSphere Data Architect and ERWin • Design Documentation experience of complex ETL work • Healthcare Servicing Provider experience. - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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] Need SAP Basis Administrator -- Birmingham AL
Dear Folks, Wishes for the Day !!! We Need consultant for SAP Basis Administrator Please share suitable profiles to s...@panzersolutions.com *Job Title : SAP Basis Administrator Location : Birmingham AL Duration : 6 Months Rate : Market* SAP Basis Administrator for 6 Months Contract - Thanks and Best Regards, Sam Riley | Sr Technical Recruiter Email: s...@panzersolutions.com Direct: 201-710-8278 -- 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: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers
My approach : partition(n) = 1 + partition(n-1) 2+partition(n-2) 3+partition(n-3) .. .. n-1+partition(1) n Assuming 1+2 and 2+1 as different. On Mon, Mar 14, 2011 at 11:53 PM, Aviral Gupta aviral@gmail.com wrote: you can use coin change problem as one of the solutions. Regards Aviral Gupta http://coders-stop.blogspot.com/ On Mar 14, 8:43 pm, Ralph Boland rpbol...@gmail.com wrote: On Mar 11, 9:33 am, saurabh agrawal saurabh...@gmail.com wrote: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers I suggest you 1) generate the numeric partitions of n. That's the lists of numbers in sorted order whose sum is n. e.g. The numeric partitions of 3 are: {(1,1,1), (1,2), 3} 2) For each partition generate its multiset permutations. Note: there is a formula for how many of sums of positive integers to n there are but I don't what it is. Regards, Ralph Boland -- 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. -- regards, chinna. -- 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: Spoj Problem : String based
I don't Know what's KMP algorithm..i am just trying to solve this problem on my own On Tue, Mar 15, 2011 at 1:55 AM, ritu ritugarg.c...@gmail.com wrote: Could you please explain ..whts the difference b/w KMP Algorithm and This problem. KMP also finds all occurrences of a string in text -- 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.