AC代碼:
//
// main.cpp
// 2015
//
// Created by showlo on 2018/4/14.
// Copyright © 2018年 showlo. All rights reserved.
//
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int n,m,num;
int a[110],b;
int ans[110];
while (scanf("%d %d",&n,&m)!=EOF) {
memset(ans, 0, sizeof(ans));
memset(a, 0, sizeof(a));
num=0;
b=0;
a[0]=2;
for (int i=1; i<n; i++) {
a[i]=a[i-1]+2;
}
for (int i=0; i<n; i+=m) {
for (int j=0; j<m; j++) {
b=b+a[i+j];
}
if(n-i<m)
ans[num]=b/(n-i);
else
ans[num]=b/m;
num++;
b=0;
}
printf("%d",ans[0]);
for (int i=1; i<num; i++)
printf(" %d",ans[i]);
printf("\n");
}
return 0;
}