We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #78: Coin partitions

Project Euler #78: Coin partitions

Problem
Submissions
Leaderboard
Discussions

This problem is a programming version of Problem 78 from projecteuler.net

Let represent the number of different ways in which coins can be separated into piles. For example, five coins can separated into piles in exactly seven different ways, so .

OOOOO
OOOO   O
OOO   OO
OOO   O   O
OO   OO   O
OO   O   O   O
O   O   O   O   O

How many different ways can coins be separated into piles?

As answer can be large, print

Input Format

First line of the input contains , which is number of testcases. Each testcase contains .

Constraints

Output Format

Print the output corresponding to each testcase on a new line.

Sample Input

2
5
6

Sample Output

7
11

Author

shashank21j

Difficulty

Medium

Max Score

100

Submitted By

1763

Need Help?


View discussions
View top submissions

rate this challenge

MORE DETAILS

Download problem statement
Download sample test cases
Suggest Edits
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy