杭电ACM_2015_偶数求和

#include<iostream>
using namespace std;
int main()
{
	int n,m;
	while(cin>>n>>m)
	{
		if(n>100||m>n)
		{
			cout<<"input error!"<<endl;
			continue;
		}
		if(n%m==0)
		{
			int group_num=n/m;
			for(int i=0;i<group_num-1;++i)
			{
				int group_max=2*(i+1)*m;
				int sum=0;
				int mm=m;
				while(mm--)
				{
					sum+=group_max;
					group_max-=2;
				}
				cout<<sum/m<<' ';
			}
			int group_max=2*group_num*m;
			int sum=0;
			int mm=m;
			while(mm--)
			{
				sum+=group_max;
				group_max-=2;
			}
			cout<<sum/m<<endl;			
		}
		else
		{
			int group_num=n/m+1;
			for(int i=0;i<group_num-1;++i)
			{
				int group_max=2*(i+1)*m;
				int sum=0;
				int mm=m;
				while(mm--)
				{
					sum+=group_max;
					group_max-=2;
				}
				cout<<sum/m<<' ';
			}
			int lastgroup_max=2*group_num*m-(m-n%m)*2;
			int sum=0;
			int mm=n%m;
			while(mm--)
			{
				sum+=lastgroup_max;
				lastgroup_max-=2;
			}
			cout<<sum/(n%m)<<endl;			
		}	
	}
	return 0;
}