SUMITR not working properly

[ranamihir]

I've written this code for the problem SUMITR: http://www.spoj.com/problems/SUMITR/. I haven't begun optimising it so that it's less than 256B, but it still doesn't work at this early stage. After taking input of a[1][1] (if n = 3 as in the example), the program stops working. Can someone please tell me why?

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int t, n, m;
	cin >> t;
	while(t--){
		cin >> n;
		int **a = new int*[n];
		for(int i = 0; i < n; i++){
			a[i] = new int[i+1];
			for(int j = 0; j < i+1; i++)
				cin >> a[i][j];
		}
		for(int i = n-2; i >= 0; i--)
  			for(int j = 0; j <= i; j++)
   				a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
		cout << a[0][0] << endl;
		for(int i = 0; i < n; i++)
			delete [] a[i];
		delete [] a;
	}
	return 0;
}

[leppyr64]

Why use pointers? Those new statements are not nearly as few keystrokes as int a[99][99]

[ranamihir]

At the time I was more concerned with making a program that occupies less memory while running, not the memory of the source file. That anyway shouldn't affect the answer being wrong, right? Can you please figure out and tell me?

[leppyr64]

Look carefully at your loops in the input segment.

[ranamihir]

First, I created an array of size n, the no. of lines. Then I pointed those n arrays(from i=0 to i=n-1) to arrays of size i+1 for each i in [0,n-1]. Finally I took inputs for those i+1 elements in each line for whole n lines. This is the logic I'm trying to implement. I still can't see what's wrong.

[leppyr64]

         for(int j = 0; j < i+1; i++)

[ranamihir]

Thanks!

[curieroy]

I was more concerned with making a program that occupies less memory while running, not the memory of the source file.