#Making X using matchsticks

3 messages · Page 1 of 1 (latest)

vapid shard
#

Hi basically i have to make a working code that takes number of matchsticks in line and jump size
The program must calculate how many ways can i arrange that array of matchsticks to make array full of X instead of I (Using recursion). Also each matchstick can be moved only once and i cannot put matchstick on place where used to matchstick (not that it would help)
the output should say which matchstick did i move (indexed from zero) and a direction of move/jump right-R and left-L, example 0R, 3L for 4 matchstick and jump 0 (next matchstick) for all possible ways and the count of all possible ways.
Here is my code. Any help would be really nice ❤️

📎 matches_1.c
jovial epochBOT
#

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question run !howto ask.

jovial epochBOT
#

This question thread is being automatically closed. If your question is not answered feel free to bump the post or re-ask. Take a look at !howto ask for tips on improving your question.