KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
Source: Facebook Hacker Cup Qualification Round 2011 A double-square number is an integer X which can be expressed as the sum of two perfect squares. For example, 10 is a double-square because 10 = 3 2 + 1 2 . Given X, how can we determine the number of ways in which it can be written as the sum of two squares? For example, 10 can only be written as 3 2 + 1 2 (we don't count 1 2 + 3 2 as being different). On the other hand, 25 can be written as 5 2 + 0 2 or as 4 2 + 3 2 . You need to solve this problem for 0 ≤ X ≤ 2,147,483,647. Examples: 10 => 1 25 => 2 3 => 0 0 => 1 1 => 1
Tags (comma-separated)
Save Edits
Cancel