/**[][]
 n  k  k 
 n
n 32
 1:
n = 5
:

 
 
2.
 2:
n = 8
:

 
  
 
3.
*/

/*




*/

/*
1
sumlongINT_MAX,int
*/
class Solution {
public:
    int arrangeCoins(int n) {
        int k = 0;
        long sum = 0;
        while(sum