• Content count

  • Joined

  • Last visited

Community Reputation

100 Neutral

About Gink

  • Rank
  1. Kazgoroth and Fruny are retards

    yeah keep using acronyms that you make up stupid fuck
  2. My farewell

    I agree with the poster, there are many idiot moderators who are just hypocrits and dont enforce the rules for their buddies. They acn go fuck themselevs and their shitty elitist attitudes. (The elitist newbies Kazgoroth and Fruny who sit around and do nothing except be faggots)
  3. Hypocritical retard moderators stfu faggots thx seems ok for other people to post homework and their topic to stay up.. so fuck off you dumb piece of shit moderator elitist faggots ill post what i fucking want u dumb piece of shit and u can fucking ban me for all i care u dumb piece of shit. thanks
  4. consec. int. proof troubles

    if I got 5k at the end, would I just divide it by 5 and be done?
  5. consec. int. proof troubles

    Quote:Original post by pinacolada All you have to do to prove that N is divisible by D is to prove that when you divide N by D, you get an integer. In other words, prove there exists an integer X such that N/D = X. Or better yet, prove there exists an integer X such that N = DX. I think I've already made it too easy. How so? It cant even be factored so that it can be divided. The only way I could think of is assuming one of them is a multiple of 5 then proving that but i doubt that's acceptable.
  6. consec. int. proof troubles

    Quote:Original post by jjd Try writing the integers as: 5n, 5n+1, 5n+2, 5n+3, 5n+4, where n = 0,1,... -Josh Why would you write it as that?
  7. Can this be proven without induction? If so, any suggestions? The product of 5 consec. integers is divisible by 5 I can prove it informally, but can't put it into words... (n or n+1 or n+2 or n+3 or n+4 must be divisible by 5, and 5k = multiple of 5)
  8. Recursion in games

    Quote:Original post by TommySauder Just wondering if there's an actual use to recursion in games... seems kinda pointless and a complete waste of memory+cpu power. Recursion can simplify code, making hundred line algorithms into 20 line algorithms. Sometimes(not too often) it's the recursive algorithms that run faster than non-recursive due to less instruction generation
  9. Prime Proofs

    Thanks for the link, but I already wrote my own program and solved it but I havent been able to really disprove it. Not sure how I would do this because the equation can contain a variable that can be any number really.. no clue how to approach it without using something like induction.
  10. Help with snake clone

    you could just write a struct that maintains the current tiles coordinate then every x milliseconds you update all the other coordinates so that they're where the previous tile was then you can redraw the head of the snake. You can use most data structures for it imo, queues, deques, vectors,linked lists, whatever
  11. You're basically screwed unless you buy microsofts 2000 dollar ide. Too much of that stuff is automated my VS and it's really hard to find out how to go around their rip-off ide(since all their books etc rely on their IDE and so do many tutorials)
  12. Prime Proofs

    Can anyone suggest the best way to prove/disprove that an equation is prime without using mathematical induction(For all int > 1)?
  13. Heres the thing I want to do - I want to watch a clip of something ( like a movie trailer or whatever) and I want to save at least 8-12 images per second from the actual movie. Anyone know how to achieve this or do i need to use printscreen 100-200 times to do this?
  14. Pointless Pointers??

    Pointers aren't pointless at all. Pointers are just addresses that point to data. Dereferencing a pointer just says, go to this location in memory, return (or modify) the data at that address. Here is a quick example void modify(int var){ //modifies the value of a variable var = 10; } int main(){ int z = 5; modify(z); } This does not work correctly if you want z to be changed a temporary variable is created called var, with its own unique address. This causes some temporary variable to be modified, which was not the intention. To get around this, you need to pass in the address of a variable void modify(int *var){ *var = 10; //dereference var, modify the value stored at that location } int main(){ int z = 5; modify(&z); } Pass the address of the object to modify, a temporary copy is created (of the address) and the original variable is modified arrays and pointers are also closely related. When passing arrays by just their name, what really happens is the address of the 0th element is passed. So.. Pointers point to an address, always. For more understanding, I suggest you go play around in DEBUG and type D a few times, and look at how data is stored in memory. The hex addresses point to data in memory, but editing that memory location by storing a diff value will cause the value of the data at that address to be changed. Play around with E to know what I mean, but dont press G whatever you do(your cpu might get injured).