Search found 5 matches

by keiya
Tue Jun 22, 2010 7:24 pm
Forum: Challenges Solved
Topic: Valuation
Replies: 103
Views: 23712

Yours are all WAY overcomplicated: you're adhering to the definition too closely and actually removing the xes and going back. It's easier if you don't: a = 0 pp = 0 p = 0 vs = '93752xxx746x27x1754xx90x93xxxxx238x44x75xx08750912738x8461x8759383xx328x4x4935903x6x5550360535004x0xx945958961296x267x8842...
by keiya
Tue Jun 22, 2010 8:16 am
Forum: Challenges
Topic: Compression requires Buyware
Replies: 14
Views: 18450

You should really switch it from sitx to an older version of the format. Preferably one old enough that I can do it in an emulator running an old version of Mac OS.

I've had too many bad experiences with the pile of shit to be willing to let it anywhere near my computer.
by keiya
Tue Jun 22, 2010 7:09 am
Forum: Challenges Solved
Topic: Protected Password 1
Replies: 14
Views: 2543

Protected Password 1

How many of you brute forced it... and how many of you fed it to a java decompiler? :P
by keiya
Tue Jun 22, 2010 6:43 am
Forum: Challenges Solved
Topic: Lorem Ipsum
Replies: 34
Views: 8428

import string lorem = '''omitted for obvious reasons''' lorem = lorem.replace('/n',' ').replace(',',' ').replace('.',' ').replace(';',' ').upper() loremwords = lorem.split() wordcount = {} for word in loremwords: if word in wordcount: wordcount[word] = wordcount[word] + 1 else: wordcount[word] = 1 ...
by keiya
Tue Jun 22, 2010 3:15 am
Forum: Challenges Solved
Topic: A little php
Replies: 6
Views: 1743

The PHP one was deliberately obfuscated. The only tricky part for me was remembering whether php used ^ for xor or exponentiation.