hdu 2015 偶数求和

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

const double inf=1e20;
const int maxn=2e5+10;
const int mod=1e9+7;

int main(){
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        int a=0;
        int num=0;
        int j=0;
        for(int i=1;i<n;i++){
            a+=2;
            num+=a;
            j++;
            if(i%m==0){
                printf("%d ",num/j);
                num=j=0;
            }
        }
        a+=2;
        num+=a;
        j++;
        printf("%d\n",num/j);
    }
    return 0;
}