#include
#include
#include
#include
using namespace std;
int visit[70] = { 0 }, sticks[70];
int sum=0,n=0,len;
bool compare(int a, int b)
{
return a>b;
}
int main()
{
bool dfs(int start,int snowlen,int nowlen);
while (cin >> n)
{
if (n == 0)
break;
for (int i = 0; i < n; i++)
{
cin >> sticks;
sum += sticks;
}
sort(sticks, sticks + n, compare);
for (len = sticks[0]; len
天盟APP下载
