Pagini recente » Cod sursa (job #1775020) | Cod sursa (job #1852415) | Cod sursa (job #1039444) | Cod sursa (job #1506949) | Cod sursa (job #986669)
Cod sursa(job #986669)
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define NrCifMax 1000099
using namespace std;
int N[NrCifMax],D[18],M[NrCifMax];
int n,d;
void Get(int A[])
{
char V[NrCifMax];
fgets(V+1,NrCifMax,stdin);
A[0]=strlen(V+1)-1;
//reverse(V+1,V+1+A[0]);
for(int i=1;i<=A[0];i++)A[A[0]+1-i]=(V[i]-'0');
}
void Scad(int A[],int B[])
{
int i, t = 0;
for (i = 1; i <= A[0]; i++) {
A[i] -= ((i <= B[0]) ? B[i] : 0) + t;
A[i] += (t = A[i] < 0) * 10;
}
for (; A[0] > 1 && !A[A[0]]; A[0]--);
}
bool MaiMare(int A[], int B[])
{
if(A[0]>B[0])return true;
if(A[0]==B[0])
{
for(int i=A[0];i>0;i--)
if(A[i]>B[i])return true;
else if(A[i]<B[i])return false;
return true;
}
return false;
}
void Adun(int A[], int B[])
{
int i, t = 0;
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
A[i] = (t += A[i] + B[i]) % 10;
A[0] = i - 1;
}
int main()
{
freopen("next.in", "r", stdin);
freopen("next.out", "w", stdout);
Get(N);Get(D);
memcpy(M,N,sizeof(N));
while(MaiMare(N,D))Scad(N,D);
if(N[0])
{
Scad(D,N);
Adun(M,D);
}
for(int i=M[0];i>0;i--)printf("%d",M[i]);printf("\n");
return 0;
}