【杭电】5666 快乘

最新推荐文章于 2021-03-27 10:38:15 发布

idealistic

最新推荐文章于 2021-03-27 10:38:15 发布

阅读量222

点赞数

分类专栏： ==数学and思维== 快速幂杭电acm~bestcoder 编程语言技巧性

本文链接：https://blog.csdn.net/idealistic/article/details/61421176

版权

编程语言同时被 3 个专栏收录

307 篇文章 0 订阅

订阅专栏

==数学and思维==

131 篇文章 0 订阅

订阅专栏

杭电acm~bestcoder

111 篇文章 1 订阅

订阅专栏

Segment

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1803 Accepted Submission(s): 664

Problem Description

Silen August does not like to talk with others.She like to find some interesting problems.

Today she finds an interesting problem.She finds a segment

x+y=q .The segment intersect the axis and produce a delta.She links some line between

(0,0) and the node on the segment whose coordinate are integers.

Please calculate how many nodes are in the delta and not on the segments,output answer mod P.

Input

First line has a number,T,means testcase number.

Then,each line has two integers q,P.

q is a prime number,and

2≤q≤1018,1≤P≤1018,1≤T≤10.

Output

Output 1 number to each testcase,answer mod P.

Sample Input

Sample Output

Source

BestCoder Round #80

直线x+y=q与坐标轴围成的三角形区域内有多少个整数点，x=1时，有q-2个整数点，x=2时，有q-3个.......以此类推最后有1个，所以一共有（q-2）*(q-1)/2个整数点

直接算会超时，所以用快乘法

code:

#include<cstdio>
#include<algorithm>
using namespace std;
long long kuaicheng(long long a,long long b,long long p){//计算a*b%p 快乘 
    long long ans=0;
    while(b){
        if(b%2!=0) ans=(ans+a)%p;
        a=(2*a)%p;
        b=b/2;
        }
        return ans;
    }
int main()
{
   int t;
   scanf("%d",&t);
   while(t--){
        long long n,p;
        scanf("%lld%lld",&n,&p);
    long long sum;
    if((n-1)%2==0)//为偶数 
    sum=kuaicheng((n-1)/2%p,(n-2)%p,p);
    else
    sum=kuaicheng((n-1)%p,(n-2)/2%p,p); 
    printf("%lld\n",sum%p);
        } 
    return 0;}