{"id":"2ff643f3-c4be-4554-b28a-24e7cc122156","name":"Combinations - 1","description":"1. You are give a number of boxes (nboxes) and number of identical items (ritems).\r\n2. You are required to place the items in those boxes and print all such configurations possible.\r\n\r\nItems are identical and all of them are named 'i'.\r\nNote 1 -> Number of boxes is greater than number of items, hence some of the boxes may remain \r\n empty.\r\nNote 2 -> Check out the question video and write the recursive code as it is intended without \r\n changing signature. The judge can't force you but intends you to teach a concept.","inputFormat":"Input is managed for you","outputFormat":"Check the sample ouput and question video. - means empty box, i means occupied by item.","constraints":"0 < nboxes <= 10\r\n0 <= ritems <= nboxes","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static void combinations(int cb, int tb, int ssf, int ts, String asf){\r\n // write your code here\r\n }\r\n\r\n public static void main(String[] args) throws Exception {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int nboxes = Integer.parseInt(br.readLine());\r\n int ritems = Integer.parseInt(br.readLine());\r\n combinations(1, nboxes, 0, ritems, \"\");\r\n }\r\n\r\n}"},"python":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"5\r\n3","sampleOutput":"iii--\r\nii-i-\r\nii--i\r\ni-ii-\r\ni-i-i\r\ni--ii\r\n-iii-\r\n-ii-i\r\n-i-ii\r\n--iii\r\n","questionVideo":"https://www.youtube.com/embed/wOaxJAtJ2Mo?end=900","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"082986ae-d618-4a59-9ab3-6d79056679a4","name":"Recursion and Backtracking For Intermediate","slug":"recursion-and-backtracking-for-intermediate-330","type":0},{"id":"be1b7a05-682c-4014-a963-ce379dfa8b14","name":"Combinations - 1","slug":"combinations-1","type":1}],"next":{"id":"333aad8b-e126-4d7a-a754-5017873e9708","name":"Combinations -1 MCQ","type":0,"slug":"combinations-1-mcq"},"prev":{"id":"5ef6d01a-cf44-4715-99bc-f21abc2068b3","name":"Permutation -1 MCQ","type":0,"slug":"permutation-1-mcq"}}}

Combinations - 1

1. You are give a number of boxes (nboxes) and number of identical items (ritems). 2. You are required to place the items in those boxes and print all such configurations possible. Items are identical and all of them are named 'i'. Note 1 -> Number of boxes is greater than number of items, hence some of the boxes may remain empty. Note 2 -> Check out the question video and write the recursive code as it is intended without changing signature. The judge can't force you but intends you to teach a concept.

{"id":"2ff643f3-c4be-4554-b28a-24e7cc122156","name":"Combinations - 1","description":"1. You are give a number of boxes (nboxes) and number of identical items (ritems).\r\n2. You are required to place the items in those boxes and print all such configurations possible.\r\n\r\nItems are identical and all of them are named 'i'.\r\nNote 1 -> Number of boxes is greater than number of items, hence some of the boxes may remain \r\n empty.\r\nNote 2 -> Check out the question video and write the recursive code as it is intended without \r\n changing signature. The judge can't force you but intends you to teach a concept.","inputFormat":"Input is managed for you","outputFormat":"Check the sample ouput and question video. - means empty box, i means occupied by item.","constraints":"0 < nboxes <= 10\r\n0 <= ritems <= nboxes","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static void combinations(int cb, int tb, int ssf, int ts, String asf){\r\n // write your code here\r\n }\r\n\r\n public static void main(String[] args) throws Exception {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int nboxes = Integer.parseInt(br.readLine());\r\n int ritems = Integer.parseInt(br.readLine());\r\n combinations(1, nboxes, 0, ritems, \"\");\r\n }\r\n\r\n}"},"python":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"5\r\n3","sampleOutput":"iii--\r\nii-i-\r\nii--i\r\ni-ii-\r\ni-i-i\r\ni--ii\r\n-iii-\r\n-ii-i\r\n-i-ii\r\n--iii\r\n","questionVideo":"https://www.youtube.com/embed/wOaxJAtJ2Mo?end=900","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"082986ae-d618-4a59-9ab3-6d79056679a4","name":"Recursion and Backtracking For Intermediate","slug":"recursion-and-backtracking-for-intermediate-330","type":0},{"id":"be1b7a05-682c-4014-a963-ce379dfa8b14","name":"Combinations - 1","slug":"combinations-1","type":1}],"next":{"id":"333aad8b-e126-4d7a-a754-5017873e9708","name":"Combinations -1 MCQ","type":0,"slug":"combinations-1-mcq"},"prev":{"id":"5ef6d01a-cf44-4715-99bc-f21abc2068b3","name":"Permutation -1 MCQ","type":0,"slug":"permutation-1-mcq"}}}
plane

Editor

Loading...

Combinations - 1

medium

1. You are give a number of boxes (nboxes) and number of identical items (ritems). 2. You are required to place the items in those boxes and print all such configurations possible. Items are identical and all of them are named 'i'. Note 1 -> Number of boxes is greater than number of items, hence some of the boxes may remain empty. Note 2 -> Check out the question video and write the recursive code as it is intended without changing signature. The judge can't force you but intends you to teach a concept.

Constraints

0 < nboxes <= 10 0 <= ritems <= nboxes

Format

Input

Input is managed for you

Output

Check the sample ouput and question video. - means empty box, i means occupied by item.

Example

Sample Input

5 3

Sample Output

iii-- ii-i- ii--i i-ii- i-i-i i--ii -iii- -ii-i -i-ii --iii

Question Video

Discussions

Show Discussion

Related Resources

related resources

Turning Off Zen Mode