title: pascal tringle using lambda without variables or recursion
body: <p>Hi I have a task to use a lambda that print's a pascal tringle. The problem I'm having is that I can't use any variables nor can I use a recursive lambda. I need to submit my answer in the following way:</p>
  <pre><code>lambda x : &lt;code&gt;
  </code></pre>
  <p>because the answer is submitted in this way I can't use any variables nor can I use recursion.</p>
  <p>and the tringle need to look like this:</p>
  <pre><code>3: [[1], [1, 1], [1, 2, 1]]
  </code></pre>
  <p>so because I can't use any variables I searched for a way to print the tringle without the other lines.</p>
  <p>and I found that you can calculate a pascal tringle in the following way:</p>
  <pre><code>1: 0nCr0
  2: 1nCr0, 1nCr1
  3: 2nCr0, 2nCr1, 2nCr2
  </code></pre>
  <p>so I tried using it to solve my task and I reached this thing:</p>
  <pre><code>lambda x : (   [([(int)( ( __import__(&quot;math&quot;).factorial(i) ) / (__import__(&quot;math&quot;).factorial(j) * ( __import__(&quot;math&quot;).factorial(i - j) ) ) ) for j in range(i + 1)]) for i in range(x)]   )
  </code></pre>
  <p>the only problem is that I can't use import and I don't know how to use factorial inside a lambda without using the math library.</p>