in java or c++, attached both startup code, kindly complete the code in any of two languages, also please consider the constraints

Max is stumped by his new video game's unique trade system. There are n stones in the game, numbered 0 to n - 1. These unusual stones only work in pairs and reward or penalize accordingly. Formally, you are given a matrix power, of size nxn, with power(i) i) = 0 and power[i][] = power[][] for all (i, j), 0 > power,vector c){ 4} 5 int main() { int n; 7 8 9 cin>>n; vector vector > power(n,vector(n)); for(int i = @;i>power[i][j]; 10 11 12 13 14 } I vector int> c(n); for(int j = 0; j >[j]; 16 17 } 18 19 I int result; result = bestTrade (power,c); cout