To give you an idea: Given a function f find a function u such that u'' = f. This is not too difficult by integrating. But surely if u'' = f then u'' * v = f*v for all functions v which are "good enough" (i.e. smooth e.t.c.) but then integral(f*v over [a,b]) = integral(u''*v over [a,b]) = integral(u'*v over [a,b]) - u'(b)*v'(b)+u'(a)*v'(a).
Now you can show that (for some function spaces) you can also find solutions to the problem ` integral(f*v over [a,b]) = integral(u''*v over [a,b]) = integral(u'*v over [a,b]) - u'(b)*v'(b)+u'(a)*v'(a)`. But they are not necessarily two times differenti…
Vim, 35 bytes
iLoading... \-/|<Esc>qqdb:sl250m<CR>p@qq@q
The boring version. Here's a non-complying solution that's better:
Vim (1 second sleep), 27 bytes
idbgsp@@<C-U>Loading... \-/|<Esc>@.
Using gs not only is much shorter, but you don't have to hit Enter. That means the macro fits in-line...
Ascending Sequence of Characters (I-something I-something)
popularity-contest restricted-source
The full printable ASCII set (chars 32-126) in ascending order looks like this:
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
Your task is to cr...
