杨辉三角练习题

#include <iostream>
using namespace std;
long long int N;
long long int a[10000][10000];

int main() {
//	long long int N;
	cin >> N;
//	long long int a[10000][10000];
	a[0][0] = a[1][0] = a[1][1] = 1;
	int i, j ;
	for ( i = 0; i < 10; i++) { //遍历第i行
		for (j = 0; j <= i; j++) {
			if (j == 0 || j == i) {
				a[i][j] = 1;
			} else {
				a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
			}

			if (a[i][j] == N)

				break;
		}
		break;
	}

	int count = 0;
	cout << i << " " << j << endl;
	count = ((1 + i) * i) / 2 + j + 1;
	cout << count << endl;
	return 0;
}