2 OOPS
source | link

Julia, 87105 bytes

f(m,n)=for u=∪([p=collectreduce(vcat,map(i->collect(permutations(i)),partitions(m,n));map(reverse,p)]) println("$u"[2:end-1])end

This is a function that reads two integer arguments and writes the results to STDOUT with a single trailing line feed.

Ungolfed:

function f(m::Integer, n::Integer)
    # Get the integer partitions of m of length n
    p = partitions(m, n)

    # Join with theConstruct reversean andarray getof distinctall elementspermutations
    c = unique([collectreduce(p);vcat, map(reversei -> collect(permutations(i)), p)])

    # Loop over the partitionsunique elements
    for u in unique(c)
        # Print the array representation with no brackets
        println("$u"[2:end-1])
    end
end

Julia, 87 bytes

f(m,n)=for u=∪([p=collect(partitions(m,n));map(reverse,p)]) println("$u"[2:end-1])end

This is a function that reads two integer arguments and writes the results to STDOUT with a single trailing line feed.

Ungolfed:

function f(m::Integer, n::Integer)
    # Get the integer partitions of m of length n
    p = partitions(m, n)

    # Join with the reverse and get distinct elements
    c = unique([collect(p); map(reverse, p)])

    # Loop over the partitions
    for u in c
        # Print the array representation with no brackets
        println("$u"[2:end-1])
    end
end

Julia, 105 bytes

f(m,n)=for u=∪(reduce(vcat,map(i->collect(permutations(i)),partitions(m,n)))) println("$u"[2:end-1])end

This is a function that reads two integer arguments and writes the results to STDOUT with a single trailing line feed.

Ungolfed:

function f(m::Integer, n::Integer)
    # Get the integer partitions of m of length n
    p = partitions(m, n)

    # Construct an array of all permutations
    c = reduce(vcat, map(i -> collect(permutations(i)), p))

    # Loop over the unique elements
    for u in unique(c)
        # Print the array representation with no brackets
        println("$u"[2:end-1])
    end
end
1
source | link

Julia, 87 bytes

f(m,n)=for u=∪([p=collect(partitions(m,n));map(reverse,p)]) println("$u"[2:end-1])end

This is a function that reads two integer arguments and writes the results to STDOUT with a single trailing line feed.

Ungolfed:

function f(m::Integer, n::Integer)
    # Get the integer partitions of m of length n
    p = partitions(m, n)

    # Join with the reverse and get distinct elements
    c = unique([collect(p); map(reverse, p)])

    # Loop over the partitions
    for u in c
        # Print the array representation with no brackets
        println("$u"[2:end-1])
    end
end