I’ve seen this interesting challange on Code Golf, and decided to compete. I’m losing miserably. I’ve managed to go as down as 65 byte in PHP, but i realised it won’t work, because i get the vars ($n, $k) from stdin. First, i don’t know how to work with stdin, second, that’d add up a nice bunch of bytes for my code (which is right now as follows)… Could someone tell me how stdin works and how could i make a 63 byte long code with that included?

Now i’m working on the admin area of the blog, because i’m tired of having to go to phpMyAdmin every single time i want to edit a post (and for some reason it loads dead slow). The funny thing is, that after such a long time of coding in Pascal, i always want to write then after each if, and put a do after while. It’s funny, i never expected it to be so…

After doing the last of the remaining exam training tests, i also made a program that decides if a number is prime or not. Naturally it’s range is limited, to |x|<2^31, though it’s still quite wide in my opinion. The fun thing is, that while testing with numbers over 12 million, for the third try i managed to hit a prime (12 437 519), so i’m proud now. You can also download the prog. Feel free to use it.

Question to everyone who could answer: in Pascal, how could i recognize all word characters? (Regular expression \w) I’m working with special characters like “ő” and “ű” too, please consider that.