More solutions (fewer than 15 lines) to some SPOJ classical problems using Python that will cause one to pause and think. Then optimize for a first-place time spot. Most of these were written in Perl or C++ and I have been converting them to Python. Many solutions have Perl-like references and influences in them. SPOJ […]
More solutions (fewer than 10 lines) to some SPOJ classical problems using Python. Note: SPOJ may prevent Python from being used for solving some problems or set time limits suitable only for compiled languages. some of these were originally written in Perl and have been rewritten in Python. Many solutions have Perl-like references and influences […]
102 concise rough-draft Python programs concentrating on formulaic solutions to easier problems on SPOJ.
Adding social icons and resources to your Elegant Themes Divi 2.4 theme
Integer partition equations
Find how many 18-digit numbers (without leading zeros) there are such that no digit occurs more than three times in base 10.
Find the number of triangles present in a cross-hatched triangle of size n.
Maximizing a weighted product
Counting the number of consecutive nines at the beginning of the fractional part of (√p+√q)2n
Find the volume (in m3) of the region through which the fragments of an air-burst firecracker move before reaching the ground.