Look at sig.
|
|
|
v
Search found 14 matches
- Thu Mar 12, 2009 11:17 am
- Forum: The Hacker's Server
- Topic: HEY!
- Replies: 26
- Views: 19676
- Mon Nov 24, 2008 1:46 am
- Forum: Challenges Solved
- Topic: countdown calc
- Replies: 20
- Views: 1624
hmm, i got similar (probably the same) mathematical closed form formula (see it in my first post, writen in Mathematica syntax) but i was not sure how to mathematically calculate the int overflow. I see you used mod 2^32, but that won't explain how you get negative answers, which happens with int ov...
- Sun Nov 23, 2008 4:44 am
- Forum: Challenges Solved
- Topic: countdown calc
- Replies: 20
- Views: 1624
countdown calc
that one was pure evil ... first i wasted bunch of hours installing disassemblers which looked completely uncomprehensible to me... almost broke my virtual xp installation with softice. Then I decompiled with RemoteSoft samander and figured out the loops. Just when i figured out the exact value for ...
- Sat Nov 22, 2008 10:42 am
- Forum: Challenges Solved
- Topic: Forced Entry
- Replies: 17
- Views: 1621
Forced Entry
alright so I solved but I am not happy with the solution. I don't know much about SQL so basically used the code from here http://sqlzoo.net/hack/ and automized it with python... Of course since the password field for forced entry seems to escape special characters I just used the Secure Room form. ...
- Fri Nov 14, 2008 12:22 am
- Forum: Challenges Solved
- Topic: Breakout
- Replies: 35
- Views: 3219
- Thu Nov 13, 2008 6:00 am
- Forum: Challenges Solved
- Topic: Breakout
- Replies: 35
- Views: 3219
I tried very similar things but with lives variable, but somehow it never ran after i tweaked the code. I suspect the code for the lifes was seriously obfuscated since I changed MAXLIVES but nothing happened. What software did you guys use for editing bytecode? I tried some terrible homebrew softwar...
- Thu Nov 13, 2008 5:54 am
- Forum: Challenges Solved
- Topic: tic tac blah
- Replies: 1
- Views: 273
tic tac blah
So anybody else thinks the "clarification" in parenthesis for what not to do is actually the same as the problem?!? Here is my python code, since the problem was small enough there was no issues with recursion depth or speed. draws=0.0 game=0.0 def move(L,player): global draws,game if(L[0]...
- Mon Nov 10, 2008 6:16 pm
- Forum: Challenges
- Topic: stereograms
- Replies: 2
- Views: 6297
- Mon Nov 10, 2008 2:30 am
- Forum: Challenges Solved
- Topic: Breakout
- Replies: 35
- Views: 3219
just a brief warning to anybody stuck on breakout extreme... Forget about bytecode look into memory editting. I lost 10 hours reading about java bytecode commands and trying to get a good bytecode editor. However the obfuscation software made the bytecode such a mess that it was near impossible. Plu...
- Sun Nov 09, 2008 8:07 pm
- Forum: Challenges
- Topic: stereograms
- Replies: 2
- Views: 6297
stereograms
I believe one of the challenges involves a stereogram ... however I have never been able to see in one of those things ever. Anyone has some good tutorials or software for that sort of thing.
- Tue Nov 04, 2008 4:09 am
- Forum: Challenges Solved
- Topic: Lazy Maze
- Replies: 26
- Views: 2075
Lazy Maze
In case the admins are wondering about why I went though the maze two times, and the first time completely covered the whole maze...my program was looking for the string "edge" and considering it as a falure... which was quite unfortunate when it was contained in the password :) btw, I was...
- Mon Nov 03, 2008 4:26 pm
- Forum: Challenges Solved
- Topic: snake arithmetic
- Replies: 16
- Views: 1552
yeah i tried to sum it up in python but regular float didn't have enough percision, or maybe i should have just started summing it up from the smallest to the biggest ... Anyways the ratio N/D actually is a converging sum. So I just used the convergent value which is (1+7pi/8 ), now the answer for e...
- Mon Nov 03, 2008 7:12 am
- Forum: Challenges Solved
- Topic: snake arithmetic
- Replies: 16
- Views: 1552
snake arithmetic
As a mathematician I really enjoyed that one. I guess the best way to solve it is to realize that the number is question is connected to the infinite sum 1/1/3+1/5/7+1/9/11+1/13/15+.... I used mathematica which instantly spit out that the answer is pi/8, so I am wondering whats the best way to prove...
- Sun Oct 26, 2008 1:47 am
- Forum: Challenges
- Topic: Help please by the "NEWSGROUP Cipher" challenge
- Replies: 31
- Views: 41265
clues
I just solved this one but still have no idea what "newsgroup" means or what the clues given are supposed to tell you. All I can say is get a crypto book and read the first few chapters.