Working on my own mod for Ollydbg. Was working on the managed/unmanaged system.
[media]http://img232.imageshack.us/img232/1660/10666887.png[/media]
hacker
[QUOTE=efeX;17298631]hacker[/QUOTE]
not a ~!batch!~ hacker though
Anyone have any advice on my previous post though? Are XHR requests cached by a browser if I give it the appropriate headers, and does it include a referer header?
[QUOTE=Senney;17298835]not a ~!batch!~ hacker though[/QUOTE]
true
[QUOTE='-[ Fizzadar ]-;17293256']there's a fuckton of examples of regular expressions on the internet, I personally suck at them, although they are awesomesauce :)[/QUOTE]
[url]http://xkcd.com/208/[/url] :D
I got a program called RegexBuddy, it's really useful for creating and debugging regexes.
I do the exact same thing, by the way.
[QUOTE=ZeekyHBomb;17299054][url]http://xkcd.com/208/[/url] :D[/QUOTE]
:D
I'm slowly picking it up, they just look so messy its hard to navigate @_@
[QUOTE=Loli;17291849]Isn't Pythagoras Thereom the one where you take the 2 sides and take the sqaure root of them to get the Hypotinuse?[/QUOTE]
Yes what's your point?
Pythagoras theorum is pythagoras theorum no matter how much you swap it around and things.
I used pythagoras backwards to find the lengths of the non hypotenuse sides using the desired length of the hypotenuse.
a = b and a^2 + b^2 = c^2
So a = sqrt(c^2 - b^2)
It's still pythagoras. I didn't use trig so it's not like I popped the numbers out of the air.
[QUOTE=Jallen;17299781]Yes what's your point?
Pythagoras theorum is pythagoras theorum no matter how much you swap it around and things.
I used pythagoras backwards to find the lengths of the non hypotenuse sides using the desired length of the hypotenuse.
a = b and a^2 + b^2 = c^2
So a = sqrt(c^2 - b^2)
It's still pythagoras. I didn't use trig so it's not like I popped the numbers out of the air.[/QUOTE]
a = b = sqrt(c^2/2)
:buddy:
[QUOTE=noctune9;17299833]a = b = sqrt(c^2/2)
:buddy:[/QUOTE]
Yes that also :buddy:
[QUOTE=high6;17298523]Working on my own mod for Ollydbg. Was working on the managed/unmanaged system.
[/QUOTE]
For OllyDbg v1.1? I want plugins for 2.0! :bang:
[QUOTE=arienh4;17291083]He's just an idiot who thinks he's smart. Java isn't used to code websites, it's used to code apps. CSS is not coding, it's designing. Facepunch.com runs on vBulletin which is written entirely in PHP, and garrysmod.org probably is too. Definitely not Java though.[/QUOTE]
I know that garry is using PHP, but you can use Java. Ever heard of Google Apps Engine?
[B]Edit:[/B]
I'm late. I didn't see page 5 when I posted this. :frown:
[QUOTE=arienh4;17298401]I stand corrected. It isn't [b]usually[/b] used to code websites.[/quote]
Java web frameworks are quite popular in business.
[QUOTE=zyxxyz;17301188]Java web frameworks are quite popular in business.[/QUOTE]
Definitely not more popular than PHP.
[editline]04:17PM[/editline]
[QUOTE='-[ Fizzadar ]-;17299561']:D
I'm slowly picking it up, they just look so messy its hard to navigate @_@[/QUOTE]
They're quite easy once you know what everything means.
I'm working on getting a basic REPL to run on my TI-84, now that they've factored TI's signing keys.
JSP isn't as rare as you make it sound.
[QUOTE=arienh4;17301589]
They're quite easy once you know what everything means.[/QUOTE]
I do, but it's just, I dunno, I fail still xD
Finding prime factors for my C++ class. First steps, hooray!
[code]int n;
int main()
{
cout << "Zahl eingeben:";
cin >> n;
cout << "\n";
for (int i=2; i <= n ;i++)
{
while(n%i==0)
{cout << "Primfaktor:" << i << "\n";
n=n/i;}
}
return 0;}[/code]
[QUOTE=Killuah;17301769]Finding prime factors for my C++ class. Frst steps, hooray!
[code]int n;
int main()
{
cout << "Zahl eingeben:";
cin >> n;
cout << "\n";
for (int i=2; i <= n ;i++)
{
while(n%i==0)
{cout << "Primfaktor:" << i << "\n";
n=n/i;}
}
return 0;}[/code][/QUOTE]
Though I'm sure that works... Let your IDE do your indentation for you!
[code]int n;
int main()
{
cout << "Zahl eingeben:";
cin >> n;
cout << "\n";
for(int i = 2; i <= n; i++)
{
while(n%i==0)
{
cout << "Primfaktor:" << i << "\n";
n = n/i;
}
}
return 0;
}[/code]
It should look like that.
[QUOTE=Killuah;17301769]Finding prime factors for my C++ class. Frst steps, hooray!
[code]int n;
int main()
{
cout << "Zahl eingeben:";
cin >> n;
cout << "\n";
for (int i=2; i <= n ;i++)
{
while(n%i==0)
{cout << "Primfaktor:" << i << "\n";
n=n/i;}
}
return 0;}[/code][/QUOTE]
My god what is your teacher teaching you.
[editline]11:10PM[/editline]
what is this i dont even
[QUOTE=Killuah;17301769]Finding prime factors for my C++ class. First steps, hooray!
[code]int n;
int main()
{
cout << "Zahl eingeben:";
cin >> n;
cout << "\n";
for (int i=2; i <= n ;i++)
{
while(n%i==0)
{cout << "Primfaktor:" << i << "\n";
n=n/i;}
}
return 0;}[/code][/QUOTE]
Now see what's the least characters you could do it in, eh?
ryandaniels what are you going to do with that thingy you are making? It looks pretty awesome :)
[QUOTE=Chandler;17288402]:3: dawww
What happens if you have multiple objects rotating one larger object? Do they collide and possibly fling off into the distance :v:
Also for the guy doing the Python Text RPG take a look at
[url]http://roguebasin.roguelikedevelopment.org/index.php?title=Main_Page[/url]
It might come in handy[/QUOTE]
Thankyou, this actually inspired me to make a rougelike. I was aiming more towards and MUD type thing but rouge likes are way more interesting.
[QUOTE=noctune9;17302381][img]http://imgkk.com/i/fMySnV.png[/img]
:saddowns:[/QUOTE]
Did you use boost function? I have the same problems in Visual Studio...
[QUOTE=Fox32;17303103]Did you use boost function? I have the same problems in Visual Studio...[/QUOTE]
Yes I did, but I also used other boost stuff. Probably function though, it uses boost's preprocessor library heavily to do some neat tricks.
I'm working on a Drum Machine/Drum Sequencer/Drum Kit Called Funk-i
[QUOTE=Baldr;17302621]ryandaniels what are you going to do with that thingy you are making? It looks pretty awesome :)[/QUOTE]
It's a top-down asteroid belt with high level continuity to maximize immersion.
Hopefully :D
Where is Qurl? :frown:
Sorry, you need to Log In to post a reply to this thread.
