hacker.org

whattheh@ck

I made it work in web page format with...

javascript:alert(MAX_CYCLES  = 1000000);

got the answer pretty quickly. You could also just look at the pattern and get it with (9**4+16)

whattheh@ck

I sort of cheated :wink: 0<1</9*0^52*/3>3<25**-3<+g1<p!000000000000000000000000000000000<p! all of those 0's seem to be a good enough buffer to pass all the tests... I just fixed it to be more exact: 1<0<1</9*0^52*/3>3<25**-3<+0^52*/3>3<25**-3<+3/gp!00<p! it works due to an interesting fact that the...

whattheh@ck

it turns out that the HVM doesn't store decimal numbers so i just used division to see which was bigger...

Code: Select all

0<1</4?0<p!1<p!

whattheh@ck

I think that any solution accepted by the server is a valid solution. Even if that means playing the numbers game and having it get the correct number only most of the time :wink: The idea with these challenges is to force hackers to come up with novel solutions to problems. We should not frown on t...

whattheh@ck

http://www.virtualpiano.net/

this site helped me out a ton... Just took a bit of practice listening for individual notes

whattheh@ck

a fun bit of overkill...

Code: Select all

javascript: var x=document.getElementsByTagName('b')[0].innerHTML;frm.answer.value=x;frm.submit();void(0);

whattheh@ck

I just used a simple perl script for bigger fib and biggest fib. It got both solutions almost instantaneously: #! /usr/bin/perl -w $root5 = sqrt(5); $phi = (1+$root5)/2; $fib = 150000000000000; $answer = ((2*$fib)*log($phi))-($fib*log($phi))-(log($root5)); printf "%.1f\n",$answer; this is ...

whattheh@ck

I didn't have to do anything to enhace it. I literally got this one the moment i saw it... At first i thought it couldn't be all that simple but i tried it and it worked

whattheh@ck

I'm surprised nobody else used GreaseMonkey... it's great for automation and allows you direct accesses to information the way your browser would show it. Here's my code: function timedRefresh(timeoutPeriod) { setTimeout("location.reload(true);",timeoutPeriod); } var oracle=document.getEle...

whattheh@ck

The fastest way to learn a programming language is by using it for multiple tasks. I would suggest working on the challenges on this site. They are designed to help you progressively learn how to program/hack. Most major programming languages today are well documented on the web. Read the tutorials ...

whattheh@ck

I was able to do it in about 10 minutes using Python... It's very good at handling large integers. The answer is 16 digits long so the actual number has to be over 320,000 digits long.

whattheh@ck

Did it in Python using 8 variables and a "while" statement... not too hard.

whattheh@ck

the chinese basically says that Cain sucks and needs to actually learn how to program

whattheh@ck

I used python...
it handles large numbers well and i simply wrote a program to increment divisors that matched some simple tests for integer factors and prime numbers. it came up with only six possible values.... just tried them all from there and found the answer

whattheh@ck

in PHP the "^" acts as a boolean XOR gate. you should be able to do this by hand.

Search found 16 matches