大数取余

• HOME
• PROBLEM
• STATUS
• CONTEST
  • Add Contest
  • Statistic
• LOGOUT
• dtl666
  • UPDATE

基础练习（一）

12:00:00

• Overview
• Problem
• Status
• Rank
• Discuss

A  B  C  D  E  F  G  H  I

C - Big Number

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

As we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B. 

To make the problem easier, I promise that B will be smaller than 100000. 

Is it too hard? No, I work it out in 10 minutes, and my program contains less than 25 lines. 

 

Input

The input contains several test cases. Each test case consists of two positive integers A and B. The length of A will not exceed 1000, and B will be smaller than 100000. Process to the end of file. 

 

Output

For each test case, you have to ouput the result of A mod B. 

 

Sample Input

       
       

        
        2 3
12 7
152455856554521 3250 
       
       

 

Sample Output

       
       

        
        2
5
1521 
       
       

 

题意：求大数的余数

思路：从低位向高位依次取余 循环操作  

            主要运用 了同余定理：

                                                      1.(a+b)%c=（a%c+b%c)%c

                                                       2.(a*b)%c=((a%c)*(b%c))%c

             定理的理解暂时借助一次函数图像

             1,2综合运用可推出快速幂。

代码如下：

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

int   kuaisumi(int x,int l,int b,int i)//快速幂取模

{
int y=l-i-1,m=1,k=10;
k%=b;
while(y!=0)
{
if(y%2==0)
{
y/=2;
k=k*k%b;
}
else
{
--y;
m=m*k%b;
}
}
m=((m%b)*(x%b))%b;
return m;
}
int main()
{
int b,i,j,k,l,t,max,m;
char a[1111];
   
    while( scanf("%s %d",a,&b)!=EOF)//调试过程中出现余数为负的结果 暂时不能解释
{
   l=i=strlen(a);
   --i;
   m=a[i]-'0';
   --i;
   while(i>=0)
   {
    m=(m%b+kuaisumi(a[i]-'0', l, b, i)%b)%b;
    --i;
}
printf("%d\n",m);
}
return 0;
}