Pagini recente » Cod sursa (job #766533) | Cod sursa (job #2469387) | Cod sursa (job #1696798) | Cod sursa (job #379249) | Cod sursa (job #179545)
Cod sursa(job #179545)
#include<stdio.h>
#include<iostream.h>
#include<string.h>
#define MAX 1200000
int v[MAX],div[18];
long long i,d,rest;
void add(int A[], int B[])
{
long long 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;
}
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;
}
main()
{
freopen("next.in","r",stdin);
freopen("next.out","w",stdout);
char *s; s=new char[MAX];
scanf("%s",s);
for(i=strlen(s)-1; i>=0; i--) v[ ++v[0] ] = s[i] - '0';
scanf("%lld",&d); delete s;
rest = mod(v,d); d-=rest;
while(d)
{ div[++div[0]]=d%10; d/=10; }
add(v,div);
for(i=v[0]; i>0; i--) printf("%d",v[i]);
printf("\n"); return 0;
}