Coin Exchange Problems

Original question:

Coin Exchange Problem time limit: 2000/1000 ms (Java/other) memory limit: 65536/32768 K (Java/other) total submission (s): 2 accepted submission (s): 2 Font: times New Roman | verdana | Georgia font size: Regular → Problem description only has one cent, two cent, and three cent coins in a country. There are many methods to convert money N into coins. Compile a program to calculate the total number of exchange methods. Each input row has only one positive integer N, and N is less than 32768. Output corresponds to the number of exchange methods for each input. Sample Input

293412553

Sample output

71883113137761

I didn't do it at the beginning. I wrote the following program based on many algorithms on the Internet.

There are some minor changes.