杭电2015偶数求和

​
#include<iostream>
using namespace std;
int main()
{
	int n, m,a[1000];
	while (cin >> n >> m)
	{
		int p = n / m;
		if (n%m == 0)
		{
			a[0] = m + 1;
			for (int i = 0;i < p-1;i++)
			{
				a[i + 1] = a[i] + 2 * m;
			}
			for (int i = 0;i < p - 1;i++)
			{
				cout << a[i] << " ";
			}
			cout << a[p - 1] << endl;
		}
		else
		{
			a[0] = m + 1;
			for (int i = 0;i < p - 1;i++)
			{
				a[i + 1] = a[i] + 2 * m;
			}
			a[p] = a[p - 1] + m + n % m;
			for (int i = 0;i < p ;i++)
			{
				cout << a[i] << " ";
			}
			cout << a[p] << endl;
		}
	}
}