AMZRCK - Amz Rock
To many people in many cultures, music is an important part of their way of life.
AmzMohammad is a fan of rock music. and he have n rock tracks (labelled from 1 to n) now he wants to select a playlist.
in his opinion a good playlist is one that have no two successive tracks.
in how many ways?
Input
first line = number of test cases
each testcase in an integer n(number of tracks)
Output
Output number of good playlists he can make.
answer is less than 1000000000. it is the only constraint :)
Example
Input: 2 1 2 Output: 2 3
note: a good play list may consist 0 track :)
note 2: how many Persian rock tracks we have?
hide comments
B.R.ARVIND:
2012-08-22 16:23:23
one line says "AmzMohammad is a fan of rock music. and he have n rock tracks (labled from 1 to n)",another says
|
|
:D:
2012-08-08 06:11:17
No, incorrect. Also don't ask for so many results, because it spoils the problem quite a lot. |
|
Sanchit Manchanda:
2012-08-07 18:36:21
Last edit: 2012-08-08 07:38:57 |
|
david_8k:
2012-08-03 04:39:01
A little weird statement but nice concept indeed. |
|
spock:
2012-08-02 15:22:44
please give some strong test cases..
|
|
NeW AcP:
2012-08-01 18:27:28
got acc. Last edit: 2012-08-02 09:03:37 |
|
(Tjandra Satria Gunawan)(曾毅昆):
2012-08-01 09:17:00
The challenge is to solve this problem with BrainF**k programming language! ;) |
|
Vaishali Behl:
2012-08-01 07:11:12
is the answer to n = 4,
|
|
mohammad mahmoodi:
2012-08-01 07:11:12
answer is less than 1000000000. it is the only constraint :) |
|
Damian Straszak:
2012-08-01 07:11:12
It's a set. Answer fits in long long. |
Added by: | mohammad mahmoodi |
Date: | 2012-08-01 |
Time limit: | 0.100s-1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 GAWK BASH CSHARP GO ICON ICK WHITESPACE |
Resource: | AmzMohammad ( Mohammad Mahmoodi ) |