id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

jebbert@volusia.k12.fl.us > awakenHL1
prev  |  next  |  chance

Write a method that returns the "mega-product" of two non-negative integers. The mega-product is found by adding the squares of each of the numbers and then finding the square-root of that sum, then rounding that result to the nearest integer.


awakenHL1(3, 4) → 5
awakenHL1(5, 12) → 13
awakenHL1(7, 7) → 10

...Save, Compile, Run (ctrl-enter)

public int awakenHL1(int a, int b) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 290

Copyright Nick Parlante 2017 - privacy