2017-02-24 00:24:47 -06:00
|
|
|
// Author: Rodney Shaghoulian
|
2018-07-27 16:45:56 -07:00
|
|
|
// Github: github.com/RodneyShag
|
|
|
|
|
// HackerRank: hackerrank.com/RodneyShag
|
2017-02-24 00:24:47 -06:00
|
|
|
|
|
|
|
|
import java.util.*;
|
|
|
|
|
|
|
|
|
|
interface AdvancedArithmetic {
|
|
|
|
|
int divisor_sum(int n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
class MyCalculator implements AdvancedArithmetic {
|
2017-04-05 18:42:35 -05:00
|
|
|
// Time Complexity: O(n^(1/2))
|
2017-02-24 00:24:47 -06:00
|
|
|
// Space Complexity: O(1)
|
|
|
|
|
public int divisor_sum(int n) {
|
2017-04-05 18:42:35 -05:00
|
|
|
int sum = 0;
|
2017-02-24 00:24:47 -06:00
|
|
|
int sqrt = (int) Math.sqrt(n);
|
|
|
|
|
for (int i = 1; i <= sqrt; i++) {
|
|
|
|
|
if (n % i == 0) { // if "i" is a divisor
|
|
|
|
|
sum += i + n/i; // add both divisors
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
/* If sqrt is a divisor, we should only count it once */
|
|
|
|
|
if (sqrt * sqrt == n) {
|
|
|
|
|
sum -= sqrt;
|
|
|
|
|
}
|
|
|
|
|
return sum;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
class Solution {
|
2017-04-05 18:42:35 -05:00
|
|
|
public static void main(String[] args) {
|
2017-02-24 00:24:47 -06:00
|
|
|
MyCalculator my_calculator = new MyCalculator();
|
|
|
|
|
System.out.print("I implemented: ");
|
|
|
|
|
ImplementedInterfaceNames(my_calculator);
|
|
|
|
|
Scanner sc = new Scanner(System.in);
|
|
|
|
|
int n = sc.nextInt();
|
|
|
|
|
System.out.print(my_calculator.divisor_sum(n) + "\n");
|
|
|
|
|
sc.close();
|
|
|
|
|
}
|
|
|
|
|
/*
|
|
|
|
|
* ImplementedInterfaceNames method takes an object and prints the name of the interfaces it implemented
|
|
|
|
|
*/
|
|
|
|
|
static void ImplementedInterfaceNames(Object o) {
|
|
|
|
|
Class[] theInterfaces = o.getClass().getInterfaces();
|
|
|
|
|
for (int i = 0; i < theInterfaces.length; i++) {
|
|
|
|
|
String interfaceName = theInterfaces[i].getName();
|
|
|
|
|
System.out.println(interfaceName);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|