Sort by time | Sort by thread (beta)
Link to this comment:
Share to:
Loading...
- Your queue is empty. Add videos to your queue using this button:
or sign in to load a different list.
Loading...Saving...
HAK THE PLANET!!!!!!!!!!!!!!!!!!!!!
viewmaster617 2 months ago
harrison is hot
wasssup10960 1 year ago
Had to stop the video u guyz bored the shit out of me
stefisking 2 years ago
'We picked up the laser pointer from Think Dick'
Nice one.
SlimeOfDoom 2 years ago
You be man or woman there doctor?
206Nish 2 years ago
great videos ! i have tagged along for over all 4 seasons!
radiofriendlypro 2 years ago
This has been flagged as spam show
Hey, good video! I really like it! Make sure to come check out 10,000+ TV Shows, Movies, Sports at Uneevision . Com
oraleepettietdu 3 years ago
that boy name john is soooo EFFIN CUTE!!!!!!!!
Closertoperfection 4 years ago
This has been flagged as spam show
There are 20 angels in this world
10 are sleeping
9 are playing
1 is reading this
put this on 4 video comments within 15 mins,if u do, sum one u love will surprise u sum how!! If u don't , u will lose ur love.!!
zirach 4 years ago
This comment has received too many negative votes show
jesus , any 12 grader in eastern europe can do that stupid C++ program presented in the beggining . stupid yanks
petisnnake 4 years ago
That's only mono right?
Duhwee 4 years ago
This comment has received too many negative votes show
this is the lamest shit
onecyrenus 5 years ago
um, the question (in the beginning) was HOW MANY combinations.that's actually a calculation you can do once.
if you want to print them out,why use recoursion and waste memory? just use k-1 iterations. something like: for (i1=1 to n-k) { for (i2=i1 to n-k { for ...
until you get i(k-1). that way you get each combination of k-1 numbers that sums up to LESS than n. the kth number is the difference.
run it till (n-k)/2 to avoid dupes. that way each number, i1..ik , is bigger than the former one.
ailaG 5 years ago
That code section was way over my head. I'm a baby hackling.
podojones 5 years ago
Anyone who can get leo to do a guest spot deserves me as a subscriber!
IRTheBorg 5 years ago
I love how you call it hacking, when it's not. Using an open source program such as metasploit.
Idiots.
youloveityouslags 5 years ago
I hate to argue online but seriously, in a previous episode they clearly explain that using metasploit is NOT hacking (but its still a useful tool). You just posted that comment to be rude.
045355 5 years ago 6
JOHN IS SOOO EFFIN FYNE!
Closertoperfection 5 years ago
awesome video, keep them coming
denebgarza 5 years ago 2