Jump to content
  • Advertisement


This topic is now archived and is closed to further replies.


VB help

This topic is 5964 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

here is the problems -A right triangle can have sides that are all integers. The set of three integer values for the sides of a right triangle is called a pythagorean triple. These three sides must satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the hypotenuse. Write a program to find all pythangorean triples for side1, side2, and the hypotenuse, all no larger than 500. Use a triple-nested For/Next loop that tries all possibilities. This is an example of "brute force" computing. You will learn in more advanced computer science courses that there are large numbers of interesting problems for which there is no known algorithmic approach other than using sheer brute force. -Write a program that prints the following diamond shape. You may use an output statement that prints a single asterisk (*). Maximize your use of reptition (with nested For/Next structures) and minimize the number of output statments. Print the diamond on the form. - Modify the program above to allow the user to imput an odd number in the range 1 to 25. The odd number input specifies the number of rows in the diamond. Your program should provide a button which when clicked displays the diamond on the form.

Share this post

Link to post
Share on other sites

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!