« first day (3457 days earlier)      last day (1388 days later) » 

12:16 AM
0
Q: Can I play this?

merrybotI recently purchased a Spanish Scrabble set* and want to know what words I can play given what tiles are on the board. My set uses the following tiles: A, E x12 O x9 I, S x6 D, N, R, U x5 ...

 
12:31 AM
I made another terrible challenge
^^
 
 
2 hours later…
2:09 AM
@merrybot If you know your challenge is terrible, please don't post it. Or at least post it in the sandbox.
 
 
2 hours later…
4:08 AM
Might be of interest:
23
Q: Supercomputers around the world!

ThomasFor a matter modelling person, the most valuable resource is computing power. For many of us, computing power at hand limits the scale of problems we can solve. There are many national supercomputing facilities for academics. What are the resources available in each country?

 
 
2 hours later…
5:53 AM
0
Q: XOR two strings

Dom HastingsGiven two strings as input, return the result of XORing the code-points of one string against the code points of the other. For each character in the first input string, take the code-point (e.g. for A, this is 65) and XOR the value against the corresponding index in the second string and output ...

 
 
4 hours later…
9:25 AM
#define A m]
a[9999],*m=a;main(){for(2[A=4[A=1;;){for(;4[A;putchar(6[m-=3]+48));for(puts(a);7[A;2[A=4[A,4[A=1)if(4[A+=3[m+=3]-1,9<(3[A=2[A+=3[A))++5[A,7[A=1,3[A-=10;}}
167
I think I'm hitting the inevitable limit lol
 
0
Q: Shortest С++ A + B program with input and output in Windows

EvgenyIn my Similar Question I asked how to make shortest A+B program in Python. Now I'm aksing how to do the same with C++. Original Task My best 62 bytes solution at this moment is: #import <iostream> main(){ int a,b; std::cin >> a >> b; std::cout << a + b; } I have an idea, how to get good solution...

 
btw: isn't asking for solutions about ongoing contests somehow banned?
 
@KrzysztofSzewczyk If you're referring to the new question: the contest is going on indefinitely in that case.
 
10:16 AM
0
Q: When does hh:mm = mm.ss?

Third-party 'Chef'Let's begin with a thought experiment. You have a clock and a timer, in which you start the timer when the clock shows exactly hh:mm.00. Clock: The clock employs 24-hour time. So the range of hh is 0<=h<23. (Because 23 inputs are unsolvable, you aren't required to handle that) Timer: It starts e...

 
 
2 hours later…
12:00 PM
Main is boring. Chat is boring. Esolang design is boring. Everything is booooring.
 
12:12 PM
@Third-party'Chef' How are your APL skills these days?
 
@Adám I can't find a challenge to answer...
@Adám (I once won an entire challenge just by typing a string literal in APL!)
 
12:26 PM
@Third-party'Chef' Here are about 1000 challenges intended to be solved using APL.
 
12:41 PM
lol I wish I was capable mentally to learn J/APL to a satisfying degree
 
*Watches as Adám steals another person to APL Orchard again...*
But wait! Where's Adám?
 
@KrzysztofSzewczyk I'll teach you if you're willing. It seems my students are quite successful.
 
honestly, I once tried myself at J but nothing of great value has came out of it
I'll happily check out the Orchard
also, did Roger reply to your e-mail about this challenge from his slides?
 
I'm quite surprised, geniunely, to see Adám's waterfall of reputation in place of the successful students' answers.
 
my brain works in x86 assembly (but I wish it worked in APL, though)
 
12:56 PM
@KrzysztofSzewczyk Ping me in there some time during the week and I'll give you a personalised intro course.
 
sure thing
 
@KrzysztofSzewczyk Which one was that?
@Third-party'Chef' Happy? ^^
 
@KrzysztofSzewczyk Your brain has assembly lines (86 of them). It makes me want to create an esolang based on that idea.
@Adám Myth busted retained.
 
@Adám about sorting? or finding a maximum?
 
Bell is silent.
 
1:00 PM
uhh, give me a second
Jun 15 at 11:44, by Krzysztof Szewczyk
Greets! I'm working on Roger Hui's sorting task (sort a vector of n indices, where each is one byte big)
jsoftware.com/papers/indexof/indexof.htm
Jun 15 at 13:40, by Adám
@KrzysztofSzewczyk OK, email sent.
 
1:28 PM
Jun 15 at 14:12, by Adám
> Loop unrolling is a distasteful way to get speed-ups, and does not require much insight or skill. This view is of course depends on your point of view. Since I am posing the puzzle I get to make the rules. :-)

The context in which the puzzle is posed is a hint in itself. The "expert C programmers" to whom I posed the puzzle did not have the benefit of this hint.
 
what a cryptic answer :p
> Since I am posing the puzzle I get to make the rules
with this approach, people would eat him on CGCC
 
 
5 hours later…
6:15 PM
0
Q: JFor? More like XNor

fireflame241As it turns out, Python allows for 1j for to be compressed to 1jfor. However, jfor sounds like xnor. Since all similar-phonic phrases have something in common, there must be some property shared between jfor and xnor. If we look at the ASCII representation of the first two characters of jfor in b...

 
 
1 hour later…
7:27 PM
0
Q: Find the maximum sequence contained in the genetic material of a non corona virus living being and contained in GenBank MN908947.3 Sars-Cov-19 virus

RosLuPFind the maximum sequence contained in the genetic material of a non corona virus living being and contained in GenBank MN908947.3 Sars-Cov-19 virus We must write a function that has as input two strings s1 and s2 and a positive number n and returns as output all the substrings common to the two ...

 
 
2 hours later…
9:16 PM
0
A: Sandbox for Proposed Challenges

fireflame241Is this magic square uniquely determined? code-golfmatrixmath Background An order-n magic square is an n×n matrix consisting of one of each of the integers from \$1\$ to \$n^2\$ where every row, column, and diagonal sum to the same value. For example, a 3×3 magic square is as follows: 4 9 2 3 5 7...

 

« first day (3457 days earlier)      last day (1388 days later) »