DCP-78: String_bonacci Back to All Problems

Easy Beginners Problems > Ad-hoc


Let, f[0] = "a" f[1] = "b" f[n] = f[n-2] + f[n-1] , (n>1); so,f[2] = f[0] + f[1] = "ab" Give you **n** & an integer **i**. Output the **ith** character of **f[n]**. Input: ------ First line contains the number of test case **T(1 <= T <= 10000)**. For each test case contain two integer **n(0 <= n <= 80)** and **i(1 <= i <= |f[n]|)**. Output: ------- For each test case, print a line “Case x: y” where x is replaced by the test case number and y is the ith character of f[n]. Sample Input ------------ 2 2 1 3 3 Sample Output ------------- Case 1: a Case 2: b


Problem Setter:

MD Musfiqur Rahman Sanim

Please login to submit solution to this problem.

Problem Limits

Language Time Limit (seconds)
C 1.00
C++ 1.00
C++14 1.00
C# 1.00
Go 1.00
Java 1.00
JavaScript 1.00
Objective-C 1.00
Perl 1.00
PHP 1.00
Python 1.00
Python3 1.00
Ruby 1.00
VB.Net 1.00

Problem Stats

46/191

Solve/Submission

Ranking

# User Language Timing
01 Robbinb1993 Cpp 0.00s
02 tariqiitju Cpp14 0.00s
03 showmic Cpp 0.00s
04 murad_al_wajed Cpp14 0.01s
05 feodorv C 0.01s
06 Morass Cpp14 0.01s
07 MAHRahat Cpp14 0.01s
08 rayhan50001 Cpp 0.02s
09 nazmulpcc Cpp 0.02s
10 Mahmudul_Tushar Cpp 0.02s
11 _c_k_r_ Cpp14 0.03s
12 Tanjila_Joti Cpp 0.06s
13 RandyWaterhouse Python3 0.19s
14 abuasifkhan Cpp14 0.27s
15 raihatneloy Cpp14 0.30s
16 abinash Cpp14 0.33s
17 moinul_shaon Cpp14 0.33s
18 mtmohim Cpp14 0.33s
19 shagor_hasan Cpp14 0.33s
20 ddhrubo Cpp14 0.34s
21 mamun4122 Cpp14 0.36s
22 dipta007 Cpp14 0.37s
23 I_See_You Cpp14 0.39s
24 pinanzo Cpp14 0.39s
25 swapnil Cpp14 0.40s
26 nfssdq Cpp14 0.40s
27 Oishee30 Cpp14 0.41s
28 khatribiru Cpp14 0.41s
29 Matrix_code Cpp14 0.41s
30 mahbubcseju Cpp14 0.48s
31 Nirjhor Cpp14 0.49s
32 akazad_cse13_ruet Cpp14 0.49s
33 Roll_Number_27 Cpp14 0.50s
34 sahedsohel Cpp14 0.50s
35 swapnilsaha Cpp14 0.51s
36 Jobayer__ Cpp14 0.51s
37 roxter Cpp14 0.52s
38 faisal47 Cpp14 0.52s
39 KIRIN_36 Cpp14 0.53s
40 ddevilred1 Cpp14 0.65s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support