This feature is currently supported like this:
Select the first tab
Hold Ctrl
Click on additional tabs you wish to move.
Release Ctrl
Drag the tabs to a new window or outside of the current window and a new window will automatically be created.
Use ⌘ instead of Ctrl on Mac.
btw since you're active on crypto, are you a number theory guy? Just today I was at a talk about hyper elliptic curve cryptography from a guest speaker in our department
hyper-elliptic curves can be considered as projective curves of the form ZY^2 = f(X,Y,Z) where f is an arbitrary degree polynomial and the curve has genus g>1
they would allow for even shorter keys then ECC, but many problems are open there
@mbomb007 well the theory of elliptic curve is a vast topic, but in the end we are just using basically the discrete-logarithm-problem on an abelian group
and in ECC the abelian group is the elliptic curve
so there is nothing too fancy in terms of cryptography=)
Actually, one of the math classes I remember the most is Complex Analysis, and that's only because the homework was for a participation grade, so I actually enjoyed doing it.
@ГригорийПерельман Given an image and a regular expression, output another image whose bytes match that regex, making the image as close to the original as possible.
@flawr you need to read like at least two books to gain a basic understanding of quantum computers
the intution is though that you induce certain functions / amplitudes / whatever in the wave function, let them interfere and at the end everything but the useful information cancels out
Challenge
Given two numbers, output their quotient. In other words, integer divide one number by another.
Both divisor/dividend will be under 10001. Division must be performed using integer division, rounding down.
Here are some example inputs and outputs:
5 1 5
6 2 3
...
Challenge
Given two numbers, output their quotient. In other words, integer divide one number by another.
Both divisor/dividend will be under 10001. Division must be performed using integer division, rounding down.
Here are some example inputs and outputs:
5 1 5
6 2 3
...
Draw me the (weird) unit circle!
code-golf ascii-artmath
Introduction
You may know and love your normal unit circle. But mathematicans are crazy and thus they have abstracted the concept to any point that satisfies x*x+y*y=1. Because Cryptographers1 are also weird, they love finite fields (i...
To-Do: Come up with a Better Title
Specification:
This challenge is similar to kolmogorov-complexity, but with a twist. You goal is to output a finite string that resembles the following string of psuedo-random characters as closely as possible:
BABBBBAAABBAABBBBAABBBAABBBABBAABABABBBBABBBBB...
@ГригорийПерельман You can make it if you want, but after attempting to write it in the Sandbox, I just couldn't do it. I don't really want to make examples, and the challenge would sound incredibly open-ended or broad.
In Self-modifying BF, \x00 is used as kind of a break-point, to stop [<] at a specific position.
Which can shorten code by a lot.
@DownChristopher Well, if you're writing a program in Retina to replace every ASCII character with the one after it for example, you need to use the character range from \x00 to \x7F
Challenge to divide two numbers. Says "Both divisor/dividend will be under 10001". All test cases are positive. Then OP decides that inputs can be negative, spoiling some of the already posted answers. I wish I could downvote twice :-/
For a brief moment I considered posting a new version of the challenge limited to non-negative integers under 256, but then I realized it would be an almost exact dupe of the divmod challenge
Someone posted that they were surprised division was posted before subtraction... but wasn't subtraction already posted? (and downvoted and maybe closed)
aside from the fact that it could pretty much be closed as a dupe of the addition one
@LuisMendo Well, I think what Mego's seeing is that most languages can easily perform addition, and most of those can also easily perform negation. So in 90% of languages it's going to be very trivial to change from addition to subtraction
Given a string of ASCII art like such (This isn't ASCII art but it will do for the example):
abc
d e
fgh
Jumble it as if it was being displayed on a screen with one character per line, like so:
a
b
c
d
e
f
g
h
Print the result, wait one second, ±0.5 seconds before clearing the terminal and...
Introduction
A queue is an abstract data type where elements are added to the front (enqueue) and removed from the back (dequeue). This is also known as the FIFO (First In First Out) principle.
It is best shown with an example:
Challenge
Given a non-empty array that contains positive int...
This feature is currently supported like this:
Select the first tab
Hold Ctrl
Click on additional tabs you wish to move.
Release Ctrl
Drag the tabs to a new window or outside of the current window and a new window will automatically be created.
Use ⌘ instead of Ctrl on Mac.
Challenge
Given two numbers, output their quotient. In other words, integer divide one number by another.
Both divisor/dividend will be under 10001. Division must be performed using integer division, rounding down.
Here are some example inputs and outputs:
5 1 5
6 2 3
...
Draw me the (weird) unit circle!
code-golf ascii-artmath
Introduction
You may know and love your normal unit circle. But mathematicans are crazy and thus they have abstracted the concept to any point that satisfies x*x+y*y=1. Because Cryptographers1 are also weird, they love finite fields (i...
To-Do: Come up with a Better Title
Specification:
This challenge is similar to kolmogorov-complexity, but with a twist. You goal is to output a finite string that resembles the following string of psuedo-random characters as closely as possible:
BABBBBAAABBAABBBBAABBBAABBBABBAABABABBBBABBBBB...
Introduction
A queue is an abstract data type where elements are added to the front (enqueue) and removed from the back (dequeue). This is also known as the FIFO (First In First Out) principle.
It is best shown with an example:
Challenge
Given a non-empty array that contains positive int...
