def sub_partitions(n,k,min = 1)
return [] if k == 0 or n == 0 or (k == 1 and n<min)
return [[n]] if k == 1
result = []
(min..n).inject([]) {|result, t| result += sub_partitions(n-t,k-1,t).collect{|p| [t]+p}}
end

def partitions(n)
(1..n).inject([]){|result, k| result += sub_partitions(n,k)}.sort
end

def display_partitions(n)
partitions(n).each{|p| puts p.collect{|x| x.to_s}.join("+") + "=#{n}"}
end

display_partitions(ARGV‏⁰.to_i)

public class GCD {

public static int gcd(int m, int n) {

if (m < n) {
int t = m;
m = n;
n = t;
}

int r = m % n;

if (r == 0) {
return n;
} else {
return gcd(n, r);
}

}

}

def gcd(a,b)
a,b = a.abs, b.abs
a,b = b,a if a<b
return a if b == 0
return gcd(b, a % b)
end

int gcd(int a, int b) {
return (b == 0) ? a : gcd(b, a % b);
}

int gcd_abs(int a, int b) {
return gcd(Math.Abs(a), Math.Abs(b));
}

Math.Abs(a)‎

a.abs

abs(a)

abs(a)

return if (a<b) ‎

if (a<b) {
return
}

perl -MO=Deparse ugly-script.pl

perltidy

I should have known it better with a guy like you

#v&<     @.$<
:<\g05%p05:_^#