Display a Progress Bar
The goal of this challenge is simple: given a ratio of whole numbers, output a 50-character long progress bar representing the ratio.
Rules
Input
- Your program must take two numbers as input. These numbers will be the numerator and denominator of the ratio, in that order. Your program cannot take the calculated result of the ratio as input. So, an input of $1/4$ is fine, but not $0.25$.
- The numbers may be entered separately, or together with a
/as a separator, whichever works best with your chosen language. - The numerator can be any integer greater than or equal to $0$, and the denominator can be any integer greater than $0$.
- The ratio cannot be greater than 1, or less than zero. So $0 \le r \le 1$ where $r$ is the ratio. Thus, ratios like $12/3$ are not allowed.
Output
- Your program must output a progress bar that is 50 characters in length, not counting the enclosing brackets.
- The progress bar must fill from left to right.
- The "filled" part of the progress bar must be made of pipes
|, and the "empty" part of the progress bar must be made of dashes-. - The progress bar must be enclosed in square brackets
[]. - Whitespace is fine at the end of the output, but not anywhere else.
- When calculating the number of "filled" characters to output, you may round in whichever direction your language supports. So a number of 33.1 can be rounded either up to 34 or down to 33, whichever you choose.
Scoring
This is a code-golf challenge, so the shortest code in bytes wins!
Examples
Example 1
Input: 1/2
Output: [|||||||||||||||||||||||||-------------------------]
Example 2
Input: 2/3
Output: [|||||||||||||||||||||||||||||||||-----------------]
or
Output: [||||||||||||||||||||||||||||||||||----------------]
Example 3
Input: 234/300
Output: [|||||||||||||||||||||||||||||||||||||||-----------]
Example 4
Input: 5/50
Output: [|||||---------------------------------------------]
Vyxal 3, 26 bytes ``` ÷50× …
11d ago
[Jelly], 13 bytes 50R>× …
1mo ago
Japt, 18 bytes "[{/V50 …
1mo ago
Uiua, 19 bytes ``` $"[]"⊏⊙ …
1mo ago
[C (gcc)], 88 bytes …
30d ago
[Python 3], 48 bytes …
1mo ago
6 answers
You are accessing this answer with a direct link, so it's being shown above all other answers regardless of its score. You can return to the normal view.
Jelly, 13 bytes
50R>×ɗị⁾-|Ø[j
Full program only--insofar as supporting the input requirements is concerned. Jelly implicitly Python evals the arguments to every program, so slash-separated input of two numbers becomes a float.
50R For every [1 .. 50],
> is it strictly greater than
×ɗ 50 times the ratio?
ị⁾-| Replace 0 with | and 1 with -,
Ø[j and surround with [].
0 comment threads
Vyxal 3, 26 bytes
÷50×.5+:'|×'[p$51$-'-×']W“
÷50×.5+:'|×'[p$51$-'-×']W“
÷50×.5+ # compute (50xratio)+0.5
: # push it twice
'|× # "|" that many times
'[p # prepend "["
$51$- # retrieve the second copy of the number, and subtract it from 51
'-× # "-" that many times
'] # "]" literal
# stack is now ["[||..."] ["--..."] ["]"]
W“ # wrap the entire stack in an array and join it on nothing, yielding the correct string
💎
Created with the help of Luminespire.
Uiua, 19 bytes
$"[_]"⊏⊙"-|">÷⟜⇡50÷
$"[_]"⊏⊙"-|">÷⟜⇡50÷
÷ # divide arguments
÷⟜⇡50 # range from 0 to 1 in steps of 1/50
> # are greater than?
⊏⊙"-|" # select using booleans: - if false and | if true
$"[_]" # format with square brackets
💎
Created with the help of Luminespire.
C (gcc), 88 bytes
char a[53]={91},*p=a+1,i;f(n,d){for(;i<50;)p[i++]=1.*n/d<=i/50.?45:124;p[i]=93;puts(a);}
There's two approaches to this in C that I came up with - either write into an array then print it, or print everything at once but use conditionals. I tried both but got about the same result so this version is the array one.
Dumping all variables at file scope makes initialization easier and we can abuse the usual C89 tricks of "implicit int" (but this makes the function "call once", so tests will have to restore all variables between multiple calls).
The actual algorithm is just floating point division then scale that from 0 to 50. < instead of <= would give incorrect rounding and that would be my on my algorithm, not the language, so I used <=.
Also this code has some pretty severe UB abuse with the i++... :)
2 comment threads
1 comment thread