HDU——2015 ——偶数求和

#include <iostream>using namespace std;int main(){  int n,m;  int b[100];  while(cin>>n>>m)  {      if(n>100||n<=0)      break;    for(int i=0;i<n;i++)    {     b[i]=(i+1)*2;        }    int count=0;    double average;     for(int i=1;i<=(n/m)*m;i=m*count+1)     {         int sum=0,count1=0;         for(int j=i-1;count1<m;j++)         {         sum+=b[j];             count1++;        }        average=sum/(m*1.0);        if(i==1)        cout<<average;        else        cout<<" "<<average;       count++;     }     if(n%m!=0)     {          int sum2=0;          int x=0;         for(int i=count*m;x<n%m;i++)         {           sum2+=b[i];           x++;         }         average=sum2/((n%m)*1.0);         cout<<" "<<average;      }      cout<<endl;  }  return 0;}