i need help with a rube goldberg project?
444300
Well try waking up in the morning. 1.the wheel rolls down an inclined plane and hits a lever. 2. the lever then triggers a pully.   i got you started now use your imagination for the rest.....
330379
Count the total number of EQUAL sections of a spinner. THese must all have the same size. Or find the angle of each section formed.\n\nIf it could be divided up into equal sections:\n\nDivide the total number of times the spinner could land on the event you want. If you were looking for theoretical probability of finding purple, and there were 2 purple sections and the spinner was divided up into 5 equal sections, the probability would be 2/5. Just divide the number of times that YOUR event could occur(ie your color), divided by the number of equally likely events (ie spaces).\n\nIf you found the angle of the section(s) your looking for:\n\nAdd up the angle measures. If you found three purple spaces, one measuring 48, another measuring 80, and another measuring 16 degrees, you would add all of these up to get 144 degrees. Because there is a total of 360 degrees in the circle, and it is equally likely to get a point on each degree, you can divide 144 (the number of degrees that your purple spaces have) by 360 (the total number of degrees to get 144/360. This is reducable and we get 2/5 as our theoretical probability.
816710
Create an outer for loop that will loop from 7 down to 0, with a step of 2.\n\nCreate one inner loops.\n\nThe inner loop should take the value of i, place it in another variable and count down to 0.\nThen print out the dollar signs for each iteration of this loop.
765557
Here's a few tutorials that might help you out:\n\nhttp://einstein.cs.uri.edu/tutorials/csc101/powerpoint/ppt.html\n\nhttp://www.actden.com/pp/\n\nhttp://www.bcschools.net/staff/PowerPointHelp.htm\n\nplrr
466992
http://www.rarpasswordcracker.com/?ver=411\n\nfind the needed software here.
592361
You might also want to look at: http://internet.oit.edu/~cardwelc/rubiks/rubiks.htm
752012
try   funbasedlearning.com
734479
albinoblacksheep.com had a contest looking for the best flash movie of a rube goldberg machine, and you could find some ideas there. Keep in mind flash movies are cartoons.
551157
Alright. Here's the deal. \n\nSince this is your first course, here are some tricks.\n\nIf the program will have an input of name, month,and day the hurricane, then you will need 4 variables. A string and 3 integers.\n\nHow will you use them? How many times will you repeat the loop?\n\nIf you do not know how many times you want it to be repeated, then  the wisest choice is a do/while. Otherwise, let the user tell you how many times it should be done.\n\nYou will make those 4 variables. They should be arrays, make sure they are big enough.\n\nit will be something as simple as this:\n\nlet the user tell you how many times he want it to be repeated:\n\nint timesToBeRepeated = 0;\ncin >> timesToBeRepeated;\n\nfor ( int i = 0; i < timesToBeRepeated; i++ )\n{\n\n      cout <<"Enter the Hurricane name: &#92;n";\n      cin >> hurricaneName[i];\n         .\n         .\n         .\n}\n\nthen, to print it out,  just do something like this:\n\ncout <<"Hurricane Name"<<"      <<"Day"<<..<<endl;\n\nthen:\n\nfor ( i = 0; i < timesToBeRepeated; i++ )\n  cout << hurricaneName[i] <<"   "<<....<<endl;\n\nWork out the rest, but that is pretty much it., Any doubt, contact me.
713772
ok, create 3 methods, one called printHours(int time), printMinutes(int time) adn another called printSeconds(int time).\n\nin those methods just print to the screen(time / 24) for hours.\ntime  60 for seconds adn time devided by 60 for minutes, adn remeber to return any remainders the the calling function.(pass the remainder to the time unit below). thats it.\n\n\nP.S. welldone for giving it a try rather than just giveing the question and expecting the answers.
916182
If your looking for something humorous to demonstrate the science of pulleys and stuff, perhaps u could use some of the illustrations found at this website  http://www.rube-goldberg.com/\n\nThis rube guy made the funniest cartoons and they';re scientifictly accurate or at least appear so.
809603
http://www.glnd.k12.va.us/resources/graphicalorganizers/  don't know if that might help you?
900433
Discounting rotations and mirror images, there is only one way to make a magic square using the digits 1 through 9.  \n\nFirst, we can prove the 5 has to go in the middle:\n\nLet the numbers in the top row from left to right be a, b, and c.  Let the numbers in the middle row from left to right be d, e, and f.  (Note e is the middle box.)  Let the numbers in the bottom row from left to right be g, h, and i.     \n\nWe know a + b + c = 15 and g + h + i = 15\n\nWe also know a + e + i = 15, b + e + h = 15, and c + e + g =15.  Therefore, (a + e + i) + (b + e + h) + (c + e + g) = 15 * 3 = 45.  We can rearrange this to (a + b + c) + (g + h + i) + 3e = 45.  Since a + b + c = 15 and g + h + i = 15, that reduces to 15 + 15 + 3e = 45, or 3e = 15.  Therefore e (the middle box) must equal 5.   \n\nKnowing the middle box is 5, try 9 in a corner and you'll notice a problem - the 6, 7 and 8 can't all be placed in the square without the row or column with the 9 exceeding 15.  So, the 9 has to occupy a side box.  Since we are discounting rotations and mirror images, we can arbitrarily select box b for the 9.  This forces the placement of the 1 in box h.   \n\nWith the 9 and 1 now placed, the 8 and 6 have to go in the row with the 1.  So, we'll put the 8 in box g and the 6 in box i.  (We still haven't done anything to create a second square if rotations and mirror images are discounted.)  That forces the placement of the final four numbers.
775897
I dont have code but a quick search might net you some...\n\nIf i was going to do it myself however... my first thought would be to start with highest level items and list across the page at the top\n\n[A]   [B]   [C]\n\nThen check each item for children and draw links (using any drawing tools you like)\n\n[A]   [B]   [C]\n  |   /\n[D]\n\nand follow down.. depends really on your data... how much/linking type etc:\n\nGet all items with no relationship\nList across the top layer\nGet all items related to [A]\nList across second layer, draw links to [A]\nGet all items related to [B]\nList across second layer after, draw links to [B]\netc etc, then 3rd layer\n\nobviously youd use a loop however
409115
http://www.rarpasswordcracker.com/?ver=411
624146
check brilliant tutorials homepage...they have posted the solutions...by the way was there a set A  as well?? anyways good luck!
34052
I do not know a preprogrammed utility to do this, but can point you in the direction that you might need to go.  See the reference below for the math and an on-line converter: