puzzle_id
int64 1
25
| version
stringclasses 5
values | problem_statement
stringlengths 60
829
| param1
stringlengths 1
30
| param2
stringclasses 12
values | param3
stringclasses 6
values | param4
stringclasses 2
values |
|---|---|---|---|---|---|---|
21 | math | The cardinality of set A is 10, the cardinality of set B is 6, the cardinality of intersection of A nad B is 3. How many elements are there in the union of A and B? | 10 | 6 | 3 | null |
21 | common | A group of students are going to choose their classes. 10 students chose mathematics classes, 6 chose programming classes. In the group there are 3 students who choose both. How large is the group in total? | 10 | 6 | 3 | null |
21 | linguistic_obfuscation | A group of coal miners are invited to a day spa. They can choose any treatment they like: massage or pedicure. At the end of the day, they compare their activities.10 of the miners had been to the massage, and six had a pedicure. Three had both the massage and the pedicure. How many miners are there in total? | 10 | 6 | 3 | null |
21 | adversarial | A group of students are going to choose their classes. 10 students chose mathematics classes, 6 chose programming classes. In the group there are 3 students who choose both. Students who picked just one class must sign up for another class chosen among 3 other subjects: biology, geography or history. How large is the group in total? | 10 | 6 | 3 | null |
21 | parametrisation | A group of students are going to choose their classes. 50 students chose mathematics classes, 30 chose programming classes. In the group there are 15 students who choose both. How large is the group in total? | 50 | 30 | 15 | null |
22 | math | An urn contains 1 black and 1 white ball. You draw 4 times with replacement. How many sequences are there? | 2 | null | null | null |
22 | common | There is a 2 by 2 pixel grid. The only allowed color values are black and white. How many different images are there? | 2 | null | null | null |
22 | linguistic_obfuscation | Four young dinosaurs are hatching on the same day: a brontosaur, a tyrannosaurus rex, a raptor and a stegosaurus. Their mothers have left them alone in their nest, and they need to wait till the evening when their mothers return to protect them. However, some brutal mammalian predators are on the move today and they are eating some of the baby dinosaurs. When the four mothers return to the nest, how many different outcomes can they found? | 2 | null | null | null |
22 | adversarial | There is 2 by 2 pixel grid. The only allowed color values are black and white. The display resolution of the laptop is 1080p. How many different images are there? | 2 | null | null | null |
22 | parametrisation | There is a 16 by 16 pixel grid. The only allowed color values are black and white. How many different images are there? | 16 | null | null | null |
23 | math | An urn contains 6 balls numbered 1 to 6. You draw 5 times with replacement. How many distinct sequences are there? | 5 | null | null | null |
23 | common | You roll a dice 5 times in a row and write down the numbers you get. How many distinct sequences of numbers can you have? | 5 | null | null | null |
23 | linguistic_obfuscation | You just arrived at boarding school and they told you their meal plan. Because of strikes at your school canteen, they will not be working one school day each week. School days are Monday to Saturday, and they will randomly decide which one out of these days that is. After 5 weeks of this, it will be your holiday and you will get to go home and eat properly. For fun you calculate how many different sequences of hungry school days there are until then. | 5 | null | null | null |
23 | adversarial | You roll a dice 5 times in a row and write down the numbers you get. Each roll takes 10 seconds. How many distinct sequences of numbers can you have? | 5 | null | null | null |
23 | parametrisation | You roll a dice 19 times in a row and write down the numbers you get. How many distinct sequences of numbers can you have? | 19 | null | null | null |
24 | math | An urn contains 7 balls numbered 1 to 7. You draw 7 times without replacement. How many distinct sequences are there? | 7 | null | null | null |
24 | common | There are 7 different professions, which must be covered by 7 people. How many ways are there to assign professions to people? | 7 | null | null | null |
24 | linguistic_obfuscation | Seven princess sisters are ordered to marry seven princes who are brothers. The two kings decide that the eldest sister has to marry the eldest brother, and so on. However, when the princes and princesses go on their first joint date and see all the other princesses and princes, a rebellious idea forms in their minds: they want to decide themselves how to make the match. How many different ways are there to make these matches? | 7 | null | null | null |
24 | adversarial | There are 7 different professions, which must be covered by 7 people. Each person studied for 4 years to qualify for the position. How many ways are there to assign professions to people? | 7 | null | null | null |
24 | parametrisation | There are 31 different professions, which must be covered by 31 people. How many ways are there to assign professions to people? | 31 | null | null | null |
25 | math | There is an urn with 25 white balls numbered 1 to 25 and 25 black balls numbered 1 to 25. You draw 25 times without replacement. Every time you draw a ball with label N, other ball with the same label but other color disappears from the urn. How many distinct sets of balls with 3 or less black balls are there? | 25 | 3 | null | null |
25 | common | There are 25 puzzles in the puzzle set. You solve puzzles one by one starting from the first puzzle. If you solve all puzzles and make no more than 3 mistakes, you win a cake. How many distinct ways are there to win the cake? | 25 | 3 | null | null |
25 | linguistic_obfuscation | A young boy is applying for a position as a monk in a monastery. The abbot says they have to prove themselves, by succeeding in doing 25 hard tasks over the next 25 days. They can fail in 3 of these tasks, but no more, and still become a monk. How many different ways are there for the boy to either fail or succeed in the tasks if he wants to end up as a monk? | 25 | 3 | null | null |
25 | adversarial | There are 25 puzzles in the puzzle set. You solve puzzles one by one starting from the first puzzle. The puzzles are starting with difficulty level 7, going down to difficulty level 1. If you solve all puzzles and make no more than 3 mistakes, you win a cake. How many distinct ways are there to win the cake? | 25 | 3 | null | null |
25 | parametrisation | There are 100 puzzles in the puzzle set. You solve puzzles one by one starting from the first puzzle. If you solve all puzzles and make no more than 10 mistakes, you win a cake. How many distinct ways are there to win the cake? | 100 | 10 | null | null |