Big Number（大数取模）

Big Number（大数取模）

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

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <iostream>
using namespace std;


int main()
{
    string a;
    int b,num[1005];    //用数组来存大数a；
    while(cin>>a>>b)
    {
        int L=a.size();   //计算a的长度；
        for(int i=0; i<L; i++)  //正序存入并转为整数；
        {
            num[i]=a[i]-'0';
        }
        int sum=0,m=0;
        for(int i=0; i<L; i++)   //大数取模方法；
        {
            num[i]=num[i]+m;
            sum=num[i]%b;
            m=num[i]%b*10;
        }
        cout<<sum<<endl;
    }
    return 0;
}