Here's a challenge Jow Forums

>given an array of ints - this is the only parameter allowed
>return a jagged 2D array with the following conditions
>each column contains all the prime factors WITH MULTIPLICITY of its corresponding index in the given array (exclude 1 and the original value)
>ex. if index 2 of the given array is 16, then for column 2, the array would be 2, 2, 2, 2
You can name the method whatever you want.The majority of Jow Forums won't be able to solve this.
Have fun!

Attached: hammerpepe.jpg (957x621, 55K)

Other urls found in this thread:

stackoverflow.com/a/21795129
twitter.com/SFWRedditVideos

BIRDMIN NO

If no one solves this, then Jow Forums should be renamed to /v/

>do my homework for me Jow Forums
fuck off

>butthurt /v/irgin

>vir/g/n

Solved it. That was fun, OP, but too easy.
public static int[][] factorItOP(int[] arr1d)
{
int[][] arr2d = new int[arr1d.length][];
for (int i = 0; i < arr2d.length; i++)
{
arr2d[i] = new int [numFactors(arr1d[i])];
for (int j = 0; j < arr2d[i].length; j++)
{
int factor = 2;
int myNum = arr1d[i];
while (factor

Just solved it, but dont care enough to copy/paste it here.

What is [][]? Is that even allowed

>THE ABSOLUTE STATE OF Jow Forums
I think the consumerist threads are really hurting this place now.

Attached: droolingidiot.png (408x450, 34K)