Golden cornucopia

[admin]

You have found the golden cornucopia, lucky you. This magic device multiplies coins according to its own magical rule. The magical rule is simple, when you insert p coins in the cornucopia, it returns the initial p coins plus the coins produced by entering p-1,p-2,...,p-7 coins in the cornucopia.



Since the number of coins returned by the cornucopia is extremely large, the goal is to write a program to return that number modulo 1000000007.

Go to puzzle

[MimiEA]

I was wondering if we were adding the negative number of coins when P-i < 0 also or just consider it to be 0 (which i think is the cases)

[admin]

Yes, negative values become 0.

[NeoRea]

I think the example's output is wrong. For 9 inserted coins there is a result 510 but instead i think it should be 511.

[admin]

Are you sure or did you figure it out after asking the question ?

[NeoRea]

Are you sure or did you figure it out after asking the question ?

I've missed ",p-7" when i was reading description. Imo, p-1,p-2,... would be quite easier and saves few lines of code

[Alexey Solodovnikov]

Additional testcase:

7
1
2
3
4
5
10
100000

Output:

1
3
7
15
31
1018
636392404

[anu_chat]

thanks!