Interpret the interpreted Task

You must write a program in Language A that will output the source code for a program in Language B which will then output the source code for a program in Language C and so on and so forth. The final program must output the x root y where x and y are the inputs e.g. in Python:

print(int(input()) ** (1/int(input())))


Your score is L / N where L is the total length of all your programs and N is the number of languages.

N must be greater or equal to 3 to allow for a proper challenge.

Different versions don't count as different languages

As usual, lowest score wins. 

Example submission

# C++/brainfuck/Python, 223 points

## C++

    #include &lt;iostream&gt;

    int main() {
      printf("+[-------&gt;++&lt;]&gt;++.++.---------.+++++.++++++.+[---&gt;+&lt;]&gt;+.-----[-&gt;+++&lt;]&gt;.+++++.++++++.+[---&gt;+&lt;]&gt;+.-----[-&gt;+++&lt;]&gt;.+++++.++.+++++.-.+[---&gt;+&lt;]&gt;+.+..---------.++++++++++..----------.++++++++.+++++++++.--.[---&gt;+&lt;]&gt;++++.+++++.++++++.+[---&gt;+&lt;]&gt;+.-----[-&gt;+++&lt;]&gt;.+++++.++.+++++.-.+[---&gt;+&lt;]&gt;+.+....");
    }

## brainfuck

    +[-------&gt;++&lt;]&gt;++.++.---------.+++++.++++++.+[---&gt;+&lt;]&gt;+.-----[-&gt;+++&lt;]&gt;.+++++.++++++.+[---&gt;+&lt;]&gt;+.-----[-&gt;+++&lt;]&gt;.+++++.++.+++++.-.+[---&gt;+&lt;]&gt;+.+..---------.++++++++++..----------.++++++++.+++++++++.--.[---&gt;+&lt;]&gt;++++.+++++.++++++.+[---&gt;+&lt;]&gt;+.-----[-&gt;+++&lt;]&gt;.+++++.++.+++++.-.+[---&gt;+&lt;]&gt;+.+....

## Python

    print(int(input()) ** (1/int(input())))
05AB1E/GolfScript/Jelly 11 6 bytes / 3 languages = 2

"'İ*@'


Both 05AB1E and GolfScript have the nice property that they do implicit prints of strings, so we only lose 3 bytes on them (because 05AB1E doesn't need the closing quote).

Also, my first 05AB1E, GolfScript, and Jelly programs.