Pagini recente » Cod sursa (job #238182) | Cod sursa (job #1779014) | Cod sursa (job #1727266) | Cod sursa (job #296202) | Cod sursa (job #743810)
Cod sursa(job #743810)
#include <cstdio>
#include <cstring>
#define DIM 1000010
#define DIMM 1000
using namespace std;
int A[DIM] ;
char a[DIM];
int BB[DIMM];
long long i, j, D, g, gg, n, aa;
long long mod(int A[], long long B)
{
long long i, t = 0;
for (i = A[0]; i > 0; i--)
t = (t * 10 + A[i] ) % B;
return t;
}
void add(int A[], int B[])
{
long long i, t = 0;
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
if ( i <= B[0] ) A[i] = (t += A[i] + B[i]) % 10;
else A[i] = ( t += A[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 ;
g = mod (A, D);
aa = (D - g) % D; // good game
j = 0;
while (aa) { BB[++j] = aa%10; aa/=10; }
BB[0] = j;
add ( A, BB );
for ( i = A[0]; i >= 1; i-- ) printf ("%d",A[i]);
return 0;
}