Show more

... sell me.

I have started to do a bit more and lisp like language things. This just generally pushes me into the world (just feels wrong doing lisp stuff in Vim). But if I am going to gear up and retool Emacs to use, maybe it is time to reconsider Spacemacs.

I am open minded enough to consider facts in making a decision. :)

Just to clean it up a little, and add some more entertainment.

Okay, here's one with a story :) Let's see if this is entertaining enough :D

Here is a problem that involves being jerk.

You receive a parking ticket and decide to pay in the least
convient way possible... change. This decision comes to mind
because the tickets are in strange amounts because they use
the cents portion for some kind of internal encoding.

You decide to pay all in pennies but when you start to collect
them someone informs you that although change will be accepted,
if the counts of coins exceed the quantities required for a wrapper
then you must roll them. You also figure out that collecting all
these coins is a bit of a nuisance for you. So your goal is to
reduce the overall number of coin rolls while maximizing the
number of free (or unrolled individual coins).

US Coinage count to a roll
0.01 = 50
0.05 = 40
0.10 = 50
0.25 = 40
0.50 = 20
$1.00 = 25 (small) or 20 (large)

Question 1.
How many rolls and free coins of each can you provide to pay your
$100.37 ticket in order to use the highest count of unrolled coins
while using the least number of rolled coins?

Considering that a ticket can cost anywhere from $1.00 to $250.00.
You start telling everyone else about your plan and they decide to
play too, so you calculate how they should pay as well.

To make things a little more interesting, you show up at a city council
meeting and propose that because of the time involved in processing
unrolled coinage that the parking authority should, rather than
bother with unrolled coins, all unrolled coins they collect should
just be donated to the city coucil's general fund. They pass this
unanimously.

For example, 45 pennies 21 nickles for a $1.00 ticket might be
pretty obnoxious :).

Question 2. Which fine amount (in that range) would allow you to
provide the highest number of unrolled coins?

Question 3. The parking authority figures out what you are doing
and decides to change things up by hiring you. Your job is to
determine the best fine values to get paid in the least amount of
unrolled coins. What are those amounts what are those amounts (still
within that range of $1.00 to $250.00)

Show thread

Okay, here's one with a story :) Let's see if this is entertaining enough :D

Here is a problem that involves being jerk.

You receive a parking ticket and decide to pay in the least
convient way possible... change. This decision comes to mind
because the tickets are in strange amounts because they use
the cents portion for some kind of internal encoding.

You decide to pay all in pennies but when you start to collect
them someone informs you that although change will be accepted,
if the counts of coins exceed the quantities required for a wrapper
then you must roll them.

US Coinage count to a roll
0.01 = 50
0.05 = 40
0.10 = 50
0.25 = 40
0.50 = 20
$1.00 = 25 (small) or 20 (large)

Question 1.
How many rolls and free coins of each can you provide to pay your
$100.37 ticket in order to use the highest count of unrolled coins?

Considering that a ticket can cost anywhere from $1.00 to $250.00.
You start telling everyone else about your plan and they decide to
play too, so you calculate how they should pay as well.

For example, 45 pennies 21 nickles for a $1.00 ticket might be
pretty obnoxious :).

Question 2. Which fine amount (in that range) would allow you to
provide the highest number of unrolled coins?

Question 3. The parking authority figures out what you are doing
and decides to change things up by hiring you. Your job is to
determine the best fine values to get paid in the least amount of
unrolled coins. What are those amounts what are those amounts (still
within that range of $1.00 to $250.00)

@Lossberg by the way, I do a here, you can look at the origination of it all the way back the 'Ninety-Nine Bottles of Beer" challenge. qoto.org/@Absinthe/10280565958

Feel free to play at any of them that interest you. There is no timebox on these. Watch for the tag and include it on any answers you offer to any of them.

Okay folks, this should be simple, but maybe not.

The goal is to write a function that takes a positive integer and returns a list of its prime factors. So if you did 12 you should get the list [2, 2, 3]

As neither 1 nor zero are prime, as a result should return an empty list.

This is taken from a , so if you have not done this one I encourage you to do so. If you are not into then solve it however you like.

Is anyone interested in, or has anyone been a part of a programming or coding club?

This is for python, but could be easily tweaked for any other development system.

Your suggestions and opinions are appreciated.

If you like to do code kata and you like to use Vim, here is a script that will create your 2 starter files (<kataname>.py and test_<kataname>.py)

#!/bin/sh
#
# kata, a script for starting up a new kata exercise
#
# Given a name for the kata the script will create 2
# files. One with the same name as the kata with '.py'
# extension added to the end and another named 'test_'
# followed by the kata name and '.py' extension. It will
# be opened in a 3 window layout of Vim with a vertical
# terminal to the left in which you can run 'pytest' or
# 'python -m unittest' or whatever appropriate runner
# you use.
#
# If these files don't alreay exist they will be created
# with an import , and basic docstrings.
#

if [ $# -eq 0 ]; then
printf "Usage:\n\t $0 <kataname>\n"
exit 0
fi

if [ ! -f "$1.py" ]; then
printf '"""%s module."""\n\n' "$1" > "$1.py"
fi

if [ ! -f "test_$1.py" ]; then
printf '"""Unit tests for %s module."""\n\n\n' "$1" > "test_$1.py"
printf 'import %s\n\n' "$1" >> "test_$1.py"
fi

vim -c ':vert topleft term' -c 'wincmd p' -o "$1.py" "test_$1.py"

TDD is awesome. is anyone out there using TDD? Anyone learning to use TDD? Do you want to?

@Absinthe It is non-intrusive on spacemacs and doom-macs. If you know the command you type it so quickly the help at the bottom never shows. If you dont know the command and stop half way through it shows after a few ms delay. So it only shows when its needed and even then doesnt really get in the way

@Absinthe What i like about vim is the keys are easy to remember, its why i like evil-mode flavors like spacemacs. The popup help as you type in spacemacs and doom-macs though is a clear winning feature for me

@Absinthe Actually last I checked in 2019 vim was still a pretty strong choice among developers. Checkout the stackoverflow survey it goes into some crazy detail.

@Absinthe yea Spacevim, but its far less popular. I've never done a real deep dive on vim or emacs until lately. So I'm really not sure what Vim would offer me that Emacs + Evil wouldnt.

IT curriculum should include way more ethics and social awareness

i find it very interesting that consent is mainly discussed within sexual scenarios

but i promise you need consent for any/every interaction online and offline. it’s not just for sex. it’s for hugs, for DMs, for flirting, for following, for collecting personal information too

just like. ask before doing things u giant doinks

exploiting intellectuals for my mathematical needs 

While pondering about a pointless optimization of a pointless feature of one of my pointless projects, I stumbled upon a similar to this one
qoto.org/@Absinthe/10319412553
but different.

A couple of ways to put it.

Colloquial(mathy jargon):
Given a prime factorization of a number, generate all of its factors(prime or otherwise) in ascending order.

Down to code(with fumbling):
Given a multiset(in ascending order) of prime numbers, generate all numbers... whose prime factors are subsets of that set... too mathy?... maybe then "that can be obtained by multiplying numbers from that set together"... in ascending order.

Examples:

Input: 30 = (2,3,5)
Output: ([1,]2,3,5,6,10,15[,30])

Input: 60 = (2,2,3,5)
Output: ([1,]2,3,4,5,6,10,12,15,20,30[,60])

@Absinthe @yohanandiamond @l0wk3y The nicest thing about it is the CSP stuff, I think. It's also ruthlessly simple. Ken Thompson is involved, he has done a lot of the language design and a lot of the compiler.
@Absinthe @yohanandiamond @l0wk3y Oh, you might like rosettacode.org, then. It's full of problems like that, and if you are learning something less common, there will be some algorithms that you can implement pretty easily.

Oh, one thing, @Absinthe what programming language are you using for AoC? I was using Rust.

Show more
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.