hdu 2015 偶數求和

標籤：blog   os   io   for   div   代碼   amp   log   

水題啦 直接貼代碼

 

#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#include<queue>#include<stack>#define mem(a,b) memset(a,b,sizeof(a))#define ll __int64#define MAXN 1000#define INF 0x7ffffff#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;int a[500];int main(){    int m,n,i,j;    while(scanf("%d%d",&n,&m)!=EOF)    {        for(i=1;i<=n;i++)        {            a[i]=i*2;        }        int sum=0;        if(m!=1)        {for(i=1;i<=n;i++)        {            sum+=a[i];            if(i%m==0)            {                printf("%d",sum/m);                if(i!=n) printf(" ");                sum=0;            }        }        if(n%m!=0)                printf("%d",sum/(n%m));                printf("\n");        }        else        {            for(i=1;i<=n;i++)            {                printf("%d",i*2);                printf("%c",i==n?‘\n‘:‘ ‘);            }        }    }    return 0;}