Pagini recente » Cod sursa (job #1984455) | Cod sursa (job #3190823) | Cod sursa (job #3253284) | Cod sursa (job #3134378) | Cod sursa (job #378326)
Cod sursa(job #378326)
#include <cstdio>
#include <cstring>
#define DIM 1000010
using namespace std;
int A[DIM] , G[DIM];
char a[DIM];
long long i, j, D, g, gg, n;
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;
}
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 main()
{
freopen ("next.in","r",stdin);
freopen ("next.out","w",stdout);
scanf ("%s\n%lld\n", a, &D);
n = strlen (a);
j = 0;
for (i = n-1; i >= 0; i--) A[++j] = a[i] - '0';
A[0] = n;
memcpy (G, A, n+2);
g = mod (G, D);
gg = (D - g) % D; // good game
add (A, A);
j = 0;
while ( gg ) { G [++j] = gg%10; gg/=10; }
G[0] = j;
add ( A, G );
for ( i = A[0]; i >= 1; i-- ) printf ("%d",A[i]);
return 0;
}