Skip to main content

Featured Post

Your First Programming Language

What programming language you start with really all depends on where you want to go with programming/coding. The great thing about this field is that there are an absolute abundance of smaller fields that you can go into, all using programming in their own unique ways. For web applications, a good start would be with HTML and later moving your way through CSS, JavaScript, JQuery, PHP, SQL, and any of the JavaScript libraries. Ruby is also a popular choice, so I would recommend checking that out too. For more scientific fields or areas with more machine learning and A.I., Python is generally a great place to start as it is widely used in that field of study. C++ is also a very useful language to know for that, but it can be a little more challenging for beginners. For game and application design, languages such as C#, C, Swift, Kotlin, and Java are most often used for that.
Post a Comment

Bowling Frames Display

Description
Today's challenge will be a variation on a popular introductory programming task, scoring a game of bowling. However, in this challenge, we won't even actually have to calculate the score. Today's challenge is to produce the display for the individual frames, given a list of the number of pins knocked down on each frame.

The basic rules are as follows:

The game of bowling consists of 10 frames, where a player gets 2 attempts to knock down 10 pins.
If the player knocks down all 10 pins on the first roll, that should be displayed as X, and the next number will be the first roll of the next frame.
If the player doesn't knock down any pins, that should be displayed as -
If the player gets a spare (knocks down the remaining pins on the second roll of the frame, that should be displayed as /
If you want more details about the rules, see: Challenge #235 [Intermediate] Scoring a Bowling Game

Input Description
You will be given a list of integers that represent the number of pins knocked down on each roll. Not that this list is not a fixed size, as bowling a perfect game requires only 12 rolls, while most games would use more rolls.

Example:

6 4 5 3 10 10 8 1 8 0 10 6 3 7 3 5 3
Output Description
Your program should output the bowling frames including strikes and spares. The total score is not necessary.

Example:

6/ 53 X  X  81 8- X  63 7/ 53
Challenge Inputs
9  0  9  0  9  0  9  0  9  0  9  0  9  0  9  0  9  0  9  0
10 10 10 10 10 10 10 10 10 10 10 10
5  5  5  5  5  5  5  5  5  5  5  5  5  5  5  5  5  5  5  5  5
10 3  7  6  1  10 10 10 2  8  9  0  7  3  10 10 10
9  0  3  7  6  1  3  7  8  1  5  5  0  10 8  0  7  3  8  2  8
Challenge Outputs
9- 9- 9- 9- 9- 9- 9- 9- 9- 9-
X  X  X  X  X  X  X  X  X  XXX
5/ 5/ 5/ 5/ 5/ 5/ 5/ 5/ 5/ 5/5
X  3/ 61 X  X  X  2/ 9- 7/ XXX
9- 3/ 61 3/ 81 5/ -/ 8- 7/ 8/8

Solution

USING: arrays combinators formatting io kernel math math.parser pair-rocket
prettyprint sequences splitting.extras ;
IN: dailyprogrammer.bowling-display

: input  ( -- x )     lines [ " " split-harvest [ string>number ] map ] map ;
: frame  ( x -- x x ) dup first 10 = 1 2 ? cut swap ;
: zeros  ( x -- x )   [ dup 0 = [ drop "-" ] [ number>string ] if ] map ;
: spare  ( x -- x )   zeros first "/" append ;
: normal ( x -- x )   zeros "" join ;
: type   ( x -- x )   { { [ dup length 1 = ] [ drop "X" ] }
                        { [ dup sum 10 =   ] [ spare    ] }
                        { [ dup sum 0 =    ] [ drop "-" ] }
                        [ normal ] } cond ;
: .next  ( x -- x )   frame type "%-3s" printf ;
: first9 ( x -- x )   9 [ .next ] times ;
: thrice ( x -- )     frame dup length 2 =
                      [ type write first . ] [ 2drop "XXX" print ] if ;
: tenth  ( x -- )     dup length 2 = [ .next nl ] [ thrice t ] if drop ;
: main   ( -- )       input [ first9 tenth ] each ;

Comments

Post a Comment

Popular posts from this blog

Decipher A Seven Segment Display

Description Today's challenge will be to create a program to decipher a seven segment display, commonly seen on many older electronic devices. Input Description For this challenge, you will receive 3 lines of input, with each line being 27 characters long (representing 9 total numbers), with the digits spread across the 3 lines. Your job is to return the represented digits. You don't need to account for odd spacing or missing segments. Output Description Your program should print the numbers contained in the display. Challenge Inputs     _  _     _  _  _  _  _   | _| _||_||_ |_   ||_||_|   ||_  _|  | _||_|  ||_| _|     _  _  _  _  _  _  _  _ |_| _| _||_|| ||_ |_| _||_   | _| _||_||_| _||_||_  _|  _  _  _  _  _  _  _  _  _ |_  _||_ |_| _|  ||_ | ||_|  _||_ |_||_| _...
Post a Comment
Read more

Continued Fraction

Description In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. A continued fraction is an expression of the form             1     x + ----------                1         y + -------                   1             z + ----                  ... and so forth, where x, y, z, and such are real numbers, rational numbers, or complex numbers. Using Gauss notation, this may be abbreviated as [x; y, z, ...] To convert a continued fraction to an ordinary fraction, we just simplify from the right side, which may be an improper fraction, ...
Post a Comment
Read more

Kolakoski Sequence

Description A Kolakoski sequence (A000002) is an infinite sequence of symbols {1, 2} that is its own run-length encoding. It alternates between "runs" of symbols. The sequence begins: 12211212212211211221211212211... The first three symbols of the sequence are 122, which are the output of the first two iterations. After this, on the i-th iteration read the value x[i] of the output (one-indexed). If i is odd, output x[i] copies of the number 1. If i is even, output x[i] copies of the number 2. There is an unproven conjecture that the density of 1s in the sequence is 1/2 (50%). In today's challenge we'll be searching for numerical evidence of this by tallying the ratio of 1s and 2s for some initial N symbols of the sequence. Input Description As input you will receive the number of outputs to generate and tally. Output Description As output, print the ratio of 1s to 2s in the first n symbols. Sample Input 10 100 1000 Sample Output 5:5 49:51 502:498...
Post a Comment
Read more

Advanced pacman

Description This challenge takes its roots from the world-famous game Pacman. To finish the game, pacman needs to gather all pacgum on the map. The goal of this chalenge is to have a time-limited pacman. Pacman must gather as much pacgum as possible in the given time. To simplify, we will say that 1 move (no diagonals) = 1 unit of time. Formal Inputs & Outputs Input description You will be given a number, the time pacman has to gather as much pacgum as possible, and a table, being the map pacman has to explore. Every square of this map can be one of those things : A number N between (1 and 9) of pacgums that pacman can gather in one unit of time. "X" squares cannot be gone through. "C" will be where pacman starts. "O" (the letter, not zero ) will be a warp to another "O". There can be only 2 "O" on one map; Output description Your program should output the maximum number of pacgums pacman can gather in the given t...
Post a Comment
Read more

Puzzle Me This

Description First they took our jerbs, now they're taking our puzzles! (with your help) Today we're gonna find a way to solve jigsaw puzzles using computers Input Description As I am no designer the input will be purely numerical, feel free to make some visual version of the jigsaw puzzles :) You will first be given the dimension as X, Y Afterwards you will be given list of puzzle pieces and what type their 4 sides connect to (given as up, right, down, left) Their side-connection is given as a number, They connect with their negated number this means that a 1 and -1 connects, 2 and -2 connects etc. 0 means that it doesnt connect with anything. Assume pieces are rotated in the correct direction. fx: 2, 2 0: 0,1,2,0 1: 0,0,2,-1 2: -2,0,0,2 3: -2,-2,0,0 Output Description Output is a 2D picture/matrix of the pieces in their correct position for the example this would be 0 1 3 2 Challenge Input Challenges are generated, so there is a slight chanc...
Post a Comment
Read more

Everyone's A Winner

Description Today's challenge comes from the website fivethirtyeight.com, which runs a weekly Riddler column. Today's dailyprogrammer challenge was the riddler on 2018-04-06. From Matt Gold, a chance, perhaps, to redeem your busted bracket: On Monday, Villanova won the NCAA men’s basketball national title. But I recently overheard some boisterous Butler fans calling themselves the “transitive national champions,” because Butler beat Villanova earlier in the season. Of course, other teams also beat Butler during the season and their fans could therefore make exactly the same claim. How many transitive national champions were there this season? Or, maybe more descriptively, how many teams weren’t transitive national champions? (All of this season’s college basketball results are here. To get you started, Villanova lost to Butler, St. John’s, Providence and Creighton this season, all of whom can claim a transitive title. But remember, teams beat those teams, too.) Outp...
Post a Comment
Read more

Star Battle solver

Background Star Battle is a grid-based logic puzzle. You are given a SxS square grid divided into S connected regions, and a number N. You must find the unique way to place N*S stars into the grid such that: Every row has exactly N stars. Every column has exactly N stars. Every region has exactly N stars. No two stars are horizontally, vertically, or diagonally adjacent. If you would like more information: Star Battle rules and info YouTube tutorial and written tutorial of solving Star Battle puzzles by hand There are many Star Battle puzzles available on Grandmaster Puzzles. Just be aware that some are variants that follow different rules. Challenge Write a program to solve a Star Battle puzzle in a reasonable amount of time. There's no strict time requirement, but you should run your program through to completion for at least one (N, S) = (2, 10) puzzle for it to count as a solution. Feel free to use whatever input/output format is most convenient for you. In the ...
Post a Comment
Read more