算法之路三：HUD OJ:2007

#include<stdio.h>
#define maxn 100000

int square(int a);
int cube(int a);
void swap(int *a,int*b);

int main()
{
    int m;
    int n;
    int a[maxn];
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        if(m>n)
        swap(&m,&n);//比較mn大小
        int ans1=0;
        int ans2=0;
        for(int i=m;i<=n;i++)
        {
            a[i]=i;
            if(a[i]%2==0)  ans1+=square(a[i]);
            else ans2+=cube(a[i]);
        }
        printf("%d %d\n",ans1,ans2);    
    }
    return 0;
}

int square(int a)
{
    return a*a;
}

int cube(int a)
{
    return a*a*a;
}

void swap(int *a,int*b)
{
    int t;
    t=*a;
    *a=*b;
    *b=t;
}

//注意點
m不一定比n小