hacker.org

I manipulated the clipboard in endless loop too remove 'FOO'. After start of the groovy script I did copy and paste in browser. import java.awt.datatransfer.StringSelection import java.awt.Toolkit import java.awt.datatransfer.* String currentContent = '' while (currentContent != 'stop') { sleep(100)...

This is my solution in groovy. It calculated 13 min String pi = new File("Pi_1Mio.txt").text int max = pi.size() int len = 1 int index = 0 while(index+len < max) { while(true) { int s = pi[index..<max].findAll(pi[index..<index+len]).size() if(s > 1) { println "${pi[index..<index+len]}...

I spend hours to check my solution until I saw, my program printed a 'comma' instead of a decimal point. (OK, I am a german)
This was not accepted as solution. After changing this, I recognized, my result was right.

after decoding the characters I put the result in a minimal html page. Then the browser showed me the decoded html entities.

After several tries I startetd guessing character for character and build up a dictionary. To do this I wrote this little groovy script which showed me the ciphertext and under it the plaintext as far as conversion from dictonary was possible. All other characters where shown as '.' I started fillin...

def dic = [ 'A' : 'is', 'B' : 'mm', 'C' : 'oo', 'D' : 'rgr', 'E' : 'ryg', 'F' : 'dth', 'G' : 'you', 'H' : 'esol', 'I' : 'ionA', 'J' : 'GDaBarA', 'K' : 'veECFHutI', 'L' : 'PQ', 'M' : 'n', 'N' : 'm', 'O' : 'oaNcho', 'P' : 'MO', 'Q' : 'NR', 'R' : 'sky', 'S' : 'JKL'] def text = 'S' while(text.any{dic[i...

I got the hint in "the lightest touch" and found a translater at this website:
https://www.cbm.de/aktiv-werden/interak ... 11587.html

tried a one liner in groovy "01110101 01110011 01100101 00100000 01110111 01100101 01100100 01101110 01100101 01110011 01100100 01100001 01111001 00100000 01100110 01101111 01110010 00100000 01110100 01101000 01100101 00100000 01100001 01101110 01110011 01110111 01100101 01110010".split()....

I produced all 26 possibilities for the key of caesar encryption and looked for something readable. 'AVE' gave the hint for Caesar. def cipher = 'cqrb lryqna rb fjh, fjh qjamna cqjw axc cqracnnw. qnan, hxd wnena twxf qxf oja cx bqroc! xq kh cqn fjh, cqn jwbfna rb mnjmvjwblqnbc.' as byte[] def asciiB...

I solved it in groovy in straight forward programing BigInteger number = 28679718602997181072337614380936720482949 def pow = 50 print "septal number: " while(pow >= 0) { def digitValue = 7.power(pow) def currentDigit = 0 while(number >= digitValue) { currentDigit++ number -= digitValue } p...

I startet with a big solution containing a Bacteria class with age and 'liveOneDay' method, which seem to calculate correct numbers. But it also seemed to be running forever. So I startet again with this little groovy script. The generations list contains the bacteria generations with 1,2,3 and 4 da...

I solved it in this way (groovy): def rabbits=0 for(i in 10..17) { rabbits += fib(i) } println rabbits def fib(n) { switch(n) { case 1: case 2: return 1 default: return fib(n-2) + fib(n-1) } } Since the fibonacci for 1 and 2 are defined as 1 I had no trouble with fibonacci of 0.

I read it straightbackward
my solution in groovy:
and I also learned, that pythons xrange area is exlusive upper bound.

I found the sequence by this Pi search engine:

http://pi.gerdlamprecht.de/

I solved it in groovy. For the key k, it seems, that there is no way to calculate it and so the 1st plaintext byte (plain[0]) can just be guessed. Of course in this case, the first plain byte was not needed and guessing it after resolving was easy. def cipherString = '310a7718781f73...' def cipher =...