蓝桥杯历届试题-分糖果 （C++代码）

解题思路:





注意事项:





参考代码:

#include<iostream>
#define N 100
using namespace std;
int flag[N]={};
int cnt=0;
int n;
int test(int *A)
{
       for(int i=0;i<n-1;i++)
       {
              if(A[i]!=A[i+1])
                return 1;
       }
       return 0;
}
int output(int *A)
{
       for(int i=0;i<n;i++)
         cout<<A[i]<<" ";
       cout<<endl;
}
int changeflag(int *A)
{
       for(int i=0;i<n;i++)
       {
         if(A[i]%2==1)
           flag[i]=1;
       }
}
int change(int *A)
{
       int bake[n];
       for(int i=0;i<n;i++)
              bake[i]=A[i];
       while(1)
       {
              for(int i=n-1;i>=0;i--)
              {
                     if(i==n-1)
                     bake[i]=(A[i]+A[0])/2;
                     else
                     bake[i]=(A[i]+A[i+1])/2;
              }
        output(bake);
              if(test(bake))
              {
                     changeflag(bake);
                     for(int i=0;i<n;i++)
                     {
                            if(flag[i]==1)
                            {
                                 bake[i]=bake[i]+1;
                                 flag[i]=0;
                                 A[i]=bake[i];
                                 cnt++;
                            }
                            A[i]=bake[i];
                     }
                     output(A);
                     if(!test(bake))
                       break;
              }
              else
                break;
       }
}
int main()
{
       cin>>n;
       int *A=new int[n];
       for(int i=0;i<n;i++)
         cin>>A[i];
       change(A);
       cout<<cnt;
       return 0;
}