I improved the caching a bit for codegolf.xyz, it's now about 6% faster than codegolf.stackexchange.com. Authentication coming soon, to make the site browse-able for logged-in users.
important note: Because this challenge only applies to square matrices, any time I use the term "matrix", it is assumed that I am referring to a square matrix. I am leaving off the "square" description for brevity's sake.
Background
Many matrix-related operations, such as computing the determin...
@BassdropCumberwubwubwub Seriously? I'm jealous I started coding at 12 on code academy, got bored, then took a class in C# as part of the duke tips program now I'm self taught. I'm probably the worst programmer who frequents TNB, but I don't have any programmer friends IRL so
Is there a word for "expert among experts"? Like, I consider myself an expert since I've probably surpassed the 10,000 hours for mastery, but among other experts, I feel like I'm at the bottom of the barrel.
There should still be a word for expert among experts though. There are some people who just seem to have all the background in every topic and the insight to put things together effortlessly from apparently unrelated topics
@El'endiaStarman it's a hard metric to measure... I felt the same about JavaScript, and then you get people like @Downgoat that come in and make you hesitate a little :p
@trichoplax True experts
Being a jack of all trades in every area gives you enough context to piece together CLI, DB, Web conversations
I think I'll get better As I take higher math classes... Much of the challenges on PPCG I can't due because of math, not code. (Not saying PPCG judges programming ability)
In Chinese sayings, there's "there's always a taller mountain" to mean "there's always someone better than you", but unfortunately since the age of orienteering that's not really applicable any more
Evoke gerund (`:) is what you want. Please refer to this short documentation for good examples. And in your case:
str=: '+ @ >: @ %'
(;: str) `:6
+@>:@%
You may want to review Tie (`) to understand this. ;: returns gerunds in our case (atomic representations), and m `: 6 converts gerund ...
@Sp3000 funny enough, I actually only signed 1 NDA agreement when I interviewed at google, and it was an agreement that I wouldn't violate other NDAs that I had signed with other companies
You have this huge book and want to know how often a sequence of chars (the needle) occurs in the text (the haystack).
However your Frameworks search count function is broken, so you have to implement the algorithm yourself. TL;DR How many needles are in the haystack
Input
String of any lengt...
@PhiNotPi The unit coupons are really complex (</sarcasm>). I'd design a qubit sandbox and let new users solve different quantum problems (e.g. complete this algorithm etc.) to get more units.
IMO (IDK anything) Quantum computing is a terrible Idea because with great (processing power) comes great responsibility. Hashes could be decrypted much faster, so all security would be easily hackable. Encryption relies on how long it takes to decrypt, and quantum computers could decrypt hashes easily, which is bad for security and good for bitcoin mining
I was using libquantum when it was developed and teached a class on quantum systems in general. But I have to re-learn like 80%. I've been fooling around with qCAD, since it more accurately resembles IBM's quantum composer.
@PhiNotPi If you are learning, there's a partial JS port of libquantum that has a nice 3D representation of the running system and some really advanced examples at qcplayground.withgoogle.com. It simulates up to 22 quBits.
Post-quantum cryptography refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against an attack by a quantum computer. This is not true of the most popular public-key algorithms which can be efficiently broken by a sufficiently large quantum computer. The problem with the currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic curve discrete logarithm problem. All of these problems can be easily solved on a sufficiently large...
@BaldBantha Yes, it seems that current public key protocols are vulnerable to quantum brute forcing (so new ones are needed), but current hash functions should still be secure.
How many needles are in the haystack?
You have this huge book and want to know how often a sequence of chars (the needle) occurs in the text (the haystack).
However your Frameworks search count function is broken, so you have to implement the algorithm yourself.
Input
String of any length > 0 ...
Quick language survey -- if your language doesn't have explicit casting, and you keep incrementing an integer (e.g., a loop) ... does the data type overflow into the next-higher-size int value, or into something else?