HDOJ2015 偶数求和

思路:当n<m时，直接输出n个数的和除以m；当n>m时，分两种情况，n%m==0和！=0  

#include <iostream>
#include<stdio.h>
using namespace std;

int main()
{
    int n,m;
    int sum,ans;
    while(cin>>n>>m)
    {
        sum=0;
        ans=0;
        if(n<=m)
        {
            for(int i=1; i<=n; i++)
            {
                sum+=2;
                ans+=sum;
            }
            printf("%d\n",ans/n);
        }
        else
        {
            int count=0;
            for(int i=1; i<=n; i++)
            {
                sum+=2;
                ans+=sum;
                count++;
                if(m==count)
                {
                    if(i!=n)
                    {
                        printf("%d ",ans/m);
                        count=0;
                        ans=0;
                    }
                    else
                        printf("%d\n",ans/m);
                }
                if(i==n&&(n%m)!=0)
                    printf("%d\n",ans/(n%m));
            }
        }

    }
    return 0;
}