Message from @Legiondude
Discord ID: 496451518803738639
someone help
this aint tech support yo
you pushed ``ctrl+Shift+F``
push it again
@Deleted User @M4Gunner @z80 This has been my day today, "I'm lovin it"!
sent me that just as I was about to go and sleep, now I'm going to have completely unrelated nightmares about Unreal Engine's retarded alternative programming thing
lol
@meratrix uml is gay af
nibba this shit is pre-uml
IT'S AN ERD
super gay
no var type either?
kys
varchar nibba
also shit, I just realized looking at this that the relationship going from "Patient_Medical_Record" to "Patient" is partially covered up by "Patient".
the fuck is a varchar
is it a char type, but gay?
no, just in the database it doesn't waste any space that isn't used in the attribute
Think of it like having an elastic storage range
varchar does not IIRC
yeah, it just has a hardcoded limit
but will only assign the space that it being used if below that limit.
These DB maps for a class or for a job @meratrix ?
class
part of a large project where we hopefully have a decent deliverable at the end.
There's also a "SYS ADMIN" entity, but it doesn't connect to the rest of the ERD anywhere.
Quick question. Why does Sargon have a comp-sci chat room?
this isnt his server, that's why
he isnt even here
But it's under the r/Sargon discord or do I not understand something about this space?
Sargon codes
Interesting, never knew that
Many of us are in Computer Science or Information Systems
Or recreational programmers like @M4Gunner
a few of us have interest in the field but are totally useless in it as well
Bottle filling.
A pharmacist has m pills and n empty bottles. Let bi denote the capacity of bottle i, that is,
the number of pills it can hold. Let vi denote the cost of purchasing bottle i. The objective is
find the least expensive combination of bottles that will hold all m pills.
Describe a greedy algorithm that, give the number of pills m, the bottle capacities bi
, and the
bottle costs vi, determines the least expensive set of bottles needed to store all the pills. Assume
that you pay only for the fraction of the bottle that is used. For example, if the ith bottle is half
filled with pills, you pay only vi/2. (This assumption is very important.) Prove the correctness
of your algorithm.
How would you solve this?
I'm thinking modified dijstras. Where each vertex is a bottle and each edge is weighted to the price. Obviously it's a directed graph
ni🅱🅱a, miss me with that gay shit.