信心题

最新推荐文章于 2023-03-14 15:09:08 发布

weixin_33984032

最新推荐文章于 2023-03-14 15:09:08 发布

阅读量73

点赞数

原文链接：http://www.cnblogs.com/XDJjy/archive/2013/05/08/3067089.html

版权



http://ch.vijos.org/Contest/%E6%B9%96%E5%8C%97%E7%9C%81%E9%98%9F%E4%BA%92%E6%B5%8B%20Week1/Problem/Show/%E4%BF%A1%E5%BF%83%E9%A2%98

#include<stdio.h>
#include<math.h>
long long mod,t;
long long sum(long long x,long long y)
{
    t=x+y;
    if(x%2==0)x/=2;//x&1==0  不能用
    else if(y%2==0)y/=2;
    else t/=2;
    x%=mod;
    y%=mod;
    t%=mod;
    return x*y%mod*t%mod ;
}
int main()
{
    long long x1,x2,y1,y2;
    while(scanf("%lld %lld %lld %lld %lld",&x1,&y1,&x2,&y2,&mod)!=EOF)
    {
        //printf("%lld %lld %lld %lld\n",sum(x2,y2),sum(x1-1,y1-1),sum(x2,y1-1),sum(x1-1,y2));
        printf("%lld\n",(sum(x2,y2)+sum(x1-1,y1-1)-sum(x2,y1-1)-sum(x1-1,y2)+2*mod)%mod);
    }
    return 0;
}