Re: [algogeeks] Additive sequence

2011-10-11 Thread prasad jondhale
i dont see any other approach than brute force

On Mon, Oct 10, 2011 at 1:04 PM, anand karthik
anandkarthik@gmail.comwrote:

 Hi,

 I dont remember the question text exactly but the following should
 convey it well

 The question:

 A number is said to be an additive number if it has the following format:

 3268126844 : 32 6812 6844 :  32 + 6812 = 6844
 123581321 : 1 2 3 5 8 13 21 : 1+2  = 3 , 2+3 = 5 , 3+5=8, 5+8 = 13, 8+13
 -21
 347  : 3 4 7 : 3+4=7
 122331234346746 : 122 3312 3434 6746 : 122 + 3312 = 3434 , 3312+3434  =
 6746


 If the number is broken down into non zero ( 303 : 3+0 = 3 is not
 additive ) segments,and when these segments are taken in groups of
 consecutive 3 ,(so two digit or single digit inputs wont qualify), the
 first two should add up to the third number, such a number is called
 as an additive number.

 Given a range of numbers, print all the numbers  which are additive in
 the sequence.

 Give an approach other than brute force.

 --
 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
Prasad Y.Jondhale
M.Tech(software engg.),
Delhi College Of Engineering,
Main Bawana road,Delhi-110042
Ph-09540208001

-- 
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] Additive sequence

2011-10-11 Thread Rujin Cao
This looks like concatenation of Fibonacci sequence。




On Mon, Oct 10, 2011 at 3:34 PM, anand karthik
anandkarthik@gmail.comwrote:

 Hi,

 I dont remember the question text exactly but the following should
 convey it well

 The question:

 A number is said to be an additive number if it has the following format:

 3268126844 : 32 6812 6844 :  32 + 6812 = 6844
 123581321 : 1 2 3 5 8 13 21 : 1+2  = 3 , 2+3 = 5 , 3+5=8, 5+8 = 13, 8+13
 -21
 347  : 3 4 7 : 3+4=7
 122331234346746 : 122 3312 3434 6746 : 122 + 3312 = 3434 , 3312+3434  =
 6746


 If the number is broken down into non zero ( 303 : 3+0 = 3 is not
 additive ) segments,and when these segments are taken in groups of
 consecutive 3 ,(so two digit or single digit inputs wont qualify), the
 first two should add up to the third number, such a number is called
 as an additive number.

 Given a range of numbers, print all the numbers  which are additive in
 the sequence.

 Give an approach other than brute force.

 --
 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] Additive sequence

2011-10-10 Thread anand karthik
Hi,

I dont remember the question text exactly but the following should
convey it well

The question:

A number is said to be an additive number if it has the following format:

3268126844 : 32 6812 6844 :  32 + 6812 = 6844
123581321 : 1 2 3 5 8 13 21 : 1+2  = 3 , 2+3 = 5 , 3+5=8, 5+8 = 13, 8+13 -21
347  : 3 4 7 : 3+4=7
122331234346746 : 122 3312 3434 6746 : 122 + 3312 = 3434 , 3312+3434  = 6746


If the number is broken down into non zero ( 303 : 3+0 = 3 is not
additive ) segments,and when these segments are taken in groups of
consecutive 3 ,(so two digit or single digit inputs wont qualify), the
first two should add up to the third number, such a number is called
as an additive number.

Given a range of numbers, print all the numbers  which are additive in
the sequence.

Give an approach other than brute force.

-- 
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.