Notices by La Fée Verte (absinthe@qoto.org)

#toyprogrammingchallenge

Okay, here is another freebie.

This problem was asked by Amazon.

There exists a staircase with N steps, and you can climb up either 1 or 2 steps at a time. Given N, write a function that returns the number of unique ways you can climb the staircase. The order of the steps matters.

For example, if N is 4, then there are 5 unique ways:

1, 1, 1, 1
2, 1, 1
1, 2, 1
1, 1, 2
2, 2

What if, instead of being able to climb 1 or 2 steps at a time, you could climb any number from a set of positive integers X? For example, if X = {1, 3, 5}, you could climb 1, 3, or 5 steps at a time.

#toyprogrammingchallenge #python #lisp #c #c++ #cpp #coding #programming

Ready for the next challenge?

"5 Guys and a Bunch of Coconuts"

Here is a link to the text description of the problem.

https://git.qoto.org/Absinthe/coconuts/blob/master/coconuts.txt

That link is to the repo, and my solution is in it as well.

care to play with some programming languages:

Here is a web page that lets you have a compillation environment for a whole bunch of them without having to install anything. Pick your language from the drop down.

https://rextester.com/

#toyprogrammingchallenge

I want to propose a programming challenge. This could be fun for beginners and experienced programmers as well. It is language agnostic. It might even be more about community than the programming part itself. The challenge itself should not take more than an hour. But it shouldn't be so simple that you don't have to put in a little effort. I will propose the first one, and those who participate are welcome to propose the next and as we can agree on it we can go off and knock it out.

Once you see other people's results you can modify your own, or even propose something to make someone else's better or faster or fix a bug that you find.

These can become toy programs for you to have around for testing concepts, and helping to try out other languages.

If you are interested or know someone else who might want to play too share this with them.

I guess we can use this thread to get started, and I guess i am supposed to use a hashtag for something like this so how about #toyprogrammingchallenge

I will try to work in Python at least in the beginning but you are welcome to work in whatever you are comfortable with.

#toyprogrammingchallenge
First challenge:

"Ninety-nine bottles of beer on the wall"

Generate the whole song from "Ninety-nine" to "No". The output should look like :

Ninety-nine bottles of beer on the wall.
Ninety-nine bottles of beer. Take one down,
pass it around... Ninety-eight bottles of beer.

(You know what the middle looks like)

Two bottles of beer on the wall.
Two bottles of beer. Take one down,
pass it around... one bottle of beer.

One bottle of beer on the wall.
One bottle of beer. Take one down,
pass it around... No bottles of beer.

I won't put too many specifics on how you get there, but the output should be words, not numerals :) Try to write clean, maintainable and visually understandable code.

Let see if I am alone or anyone wants to play along. :)

Here is my first attempt total time 48 minutes.

https://git.qoto.org/Absinthe/ninety_nine_bottles

@freemo Dead colony.

When a queen is raised and she hatches she will go around and tear apart any other queen cells and kill any other virgin queens she can find. Then she goes away and has her mating flight where she will have sex with as many drones (from other colonies) as possible. Likely about 20 of them. They mate in flight. The drones break off their penis inside the queen and she stores all their sperm in her spermatheca. When she returns to the hive her pheromone will start the proper behaviors. However, if after that point the workers detect any problems with the queen they will begin making queen cells (they can make a queen cell with any fertilized egg under 3 days old.) In preparation for her demise. However, if she fails and they haven't created queen cells, or whatever, this is when you can get a laying worker. If they have a laying worker they will no longer try to make a queen cell, and the laying worker's eggs are not of any use to make females anyway, and she lays a whole bunch of them in a cell not just one.

Once they have no viable egg to make into a queen, the colony will die (unless the keeper introduces a new queen)