灯塔数问题

有一个八层的灯塔，每层灯塔的数目是上一层的一倍，一共765个灯，求每层的灯

#include<iostream>#include<stdio.h>#include<string>using namespace std;int main(){int n = 1, m, sum;//假设每层是1，int array[8];while (1)//因为不知道灯塔数到底多少，只能循环进行判断{array[0] = m = n;sum = 0;for (int i = 0; i < 8; i++){m = m * 2;array[i] = m;sum += m;}sum += n;if (sum == 765){for (int j = 0; j < 8; j++){cout << "每层灯塔数" << j << "塔数" << array[j] << endl;}break;}n++;}    system("pause");return 0;}