View difference between Paste ID: 8pvvfFYB and zMAy2J8H

 int a(int[] input)
 {
-    return intsqrt(intsqrt(f(input[0])))
+    return intsqrt(intsqrt(sum_factors(input[0])))
-         + g(input[1])*11
+         + num_factors(input[1])*11
-         + intsqrt(intsqrt(f(input[2])))*2;
+         + intsqrt(intsqrt(sum_factors(input[2])))*2;
 }
 
-int f(int n)
+int sum_factors(int n)
 {
     int a=0,c=1;
     for (n = Math.abs(n)
          ;
          ++c*c <= n
          ;
          a += n % c < 1 ? c : 0,
          n /= n % c < 1 ? c-- : 1);
     return a + n;
 }
 
-int g(int n)
+int num_factors(int n)
 {
     int b=1,c=1;
     for (n = Math.abs(n)
          ;
          ++c*c <= n
          ;
          b += n % c < 1 ? 1 : 0,
          n /= n % c < 1 ? c-- : 1);
     return b;
 }
 
 int intsqrt(int $)
 {
     return (int)Math.sqrt($);
 }