Large number division (divisor in int range)

#include <iostream> #include <cstdio> #include <cstring> #define N 1000using namespace Std;void Division (Char Bcs[],int Cs,char res[])//divisor is a large number, divisor is int in range {    int i,k,len,t=0,s=0;    BOOL Flag=false;   Whether the quotient has the first effective bit to prevent the business header from appearing 0    Len=strlen (BCS);    for (i=0,k=0; i<len; i++)    {        t=s*10+ (bcs[i]-48);    Xinyu number        if (t/cs>0| | t==0)      //The remainder is 0 to modify the quotient        {            res[k++]=t/cs+48;            S=t%cs;            flag=true;        }        else         //Not enough to remove, modify remainder        {            s=t;            if (flag)   //quotient already has a valid bit, complement 0                res[k++]= ' 0 ';        }    }    for (i=0;i<k;i++)        cout<<res[i];    cout<<endl;    Cout<<s<<endl;} int main () {    char num[n],res[n];    int n;    scanf ("%s%d", num,&n);    Division (num,n,res);    return 0;}

　　

Large number division (divisor in int range)