Pagini recente » Cod sursa (job #1545469) | Cod sursa (job #1648817) | Cod sursa (job #1633447) | Cod sursa (job #489451) | Cod sursa (job #158055)
Cod sursa(job #158055)
#include <stdio.h>
#include <string.h>
#define M 1230000
char S[M];
int N[M],K[M];
void add(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 mod(int A[], int B)
{
int i, t = 0;
for (i = A[0]; i > 0; i--)
t = (t * 10 + A[i]) % B;
return t;
}
int main()
{
int D,R,k;
int c,l,i;
freopen("next.in", "r",stdin);
freopen("next.out", "w",stdout);
scanf("%s", &S);
scanf("%d", &D);
l=strlen(S);
N[0]=l;
for(i=l;i>=1;--i)
N[i]=(S[l-i]-48);
R=mod(N,D);
k=(D-R)%D;
//printf("%d\n", k);
while(k>0)
{
i=1;
K[0]=i;
c=k%10;
k/=10;
K[i]=c;
//printf("c=%d ", c);
//printf("k=%d", k);
++i;
}
//printf("%d ", K[0]);
//for(i=K[0];i>=1;--i)
// printf("%d", K[i]);
add(N,K);
for(i=N[0];i>=1;--i)
printf("%d", N[i]);
return 0;
}