# No

You cannot output \$\Theta(n^2)\$ items in \$o(n^2)\$ time. Output size is a trivial lower bound of your algorithm.