Scribd
Upload
53 views2 pages

Prob E

Jojo created the Jobonacci series where each term is the sum of the previous term and the term 3 places before it. The friend wants to create a program to quickly answer Jojo's questions about Jobonacci numbers. The program is to use recursion to output the Nth Jobonacci number given N as input between 1 and 25.

Uploaded by

nozetsubounolife
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
53 views2 pages

Prob E

Jojo created the Jobonacci series where each term is the sum of the previous term and the term 3 places before it. The friend wants to create a program to quickly answer Jojo's questions about Jobonacci numbers. The program is to use recursion to output the Nth Jobonacci number given N as input between 1 and 25.

Uploaded by

nozetsubounolife
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

E

COMP6047 – Algorithm and Programming

T
T
NO
BU
Jobonacci
Jojo is a genius in mathematics especially in numerical sequence. He also created his own
series, “Jobonacci”. Jobonacci is a series which adds the numbers before and 3 numbers
before it to make a number (jobonacci[x] = jobonacci[x − 1] + jobonacci[x − 3]).

I
You are a friend of Jojo, who is making guesses about the Jobonacci series, because you

R
O
don’t want to lose from him, then you will create a program so that you can answer Jojo’s
questions quickly.
T
You are encouraged to use recursive techniques to solve this problem..
D

Format Input
S
Input consists of 1 integer N , Jojo’s question about the Jobonacci series.
DI

Format Output
Output a single line containing the N th Jobonacci numbers.
OT
UT
Constraints
RE

• 1 ≤ N ≤ 25

Sample Input 1 (standard input)


N
13
IB
Sample Output 1 (standard output)
TR
DO

60

Note
Assume that jobonacci[0] = 0, jobonacci[1] = 1, jobonacci[2] = 1;
IS
ED

© School of Computer Science - BINUS, 2021. No part of the materials available may be copied,
photocopied, reproduced, translated, or reduced to any electronic medium or machine-readable form,
in whole or in part, without prior written consent of School of Computer Science - BINUS. Any other
reproduction in any form without the permission of School of Computer Science - BINUS is probihited.
Violators of this clause may be academically sanctioned.
E
COMP6047 – Algorithm and Programming

T
T
NO
BU
Jobonacci
Jojo adalah seorang yang sangat jenius dalam matematika. Khususnya dalam bidang
deret angka. Ia pun menciptakan deret nya sendiri yaitu “Jobonacci”. Jobonacci adalah
deret yang menjumlahkan angka sebelum dan 3 angka sebelum nya untuk membuat suatu
angka (jobonacci[x] = jobonacci[x − 1] + jobonacci[x − 3]).

R I
O
Anda adalah teman dari Jojo, yang sedang melakukan tebak-tebakan mengenai deret
Jobonacci tersebut, karena anda tidak ingin kalah dari Jojo, maka anda akan membuat
program agar dapat menjawab pertanyaan Jojo dengan cepat.
T
D

Anda disarankan untuk menggunakan teknik rekursif untuk menyelesaikan


masalah ini.
S
Format Input
DI

Input terdiri dari 1 buah i nteger N - pertanyaan Jojo mengenai deret Jobonaccinya.

Format Output
OT
UT
Output yang dikeluarkan berupa angka Jobonacci ke N .
RE

Constraints
• 1 ≤ N ≤ 25
N
IB
Sample Input 1 (standard input)
13
TR
DO

Sample Output 1 (standard output)


60

Note
IS

Asumsikan bahwa jobonacci[0] = 0, jobonacci[1] = 1, jobonacci[2] = 1;


ED

© School of Computer Science - BINUS, 2021. No part of the materials available may be copied,
photocopied, reproduced, translated, or reduced to any electronic medium or machine-readable form,
in whole or in part, without prior written consent of School of Computer Science - BINUS. Any other
reproduction in any form without the permission of School of Computer Science - BINUS is probihited.
Violators of this clause may be academically sanctioned.

You might also like