Pagini recente » Cod sursa (job #2476294) | Cod sursa (job #309848) | Cod sursa (job #1815376) | Cod sursa (job #1806109) | Cod sursa (job #2387366)
#include <cstdio>
#define MAXN 1000005
int n;
long long d;
char v[MAXN];
long long mod(){
long long x = 0;
int i;
for(i = n - 1; i >= 0; i--){
x = x * 10 + v[i];
x %= d;
}
return x;
}
void adun(long long ad){
int i = 0;
while(ad > 0){
ad += v[i];
v[i] = ad % 10;
ad /= 10;
i++;
}
if(n < i)
n = i;
}
int main(){
freopen("next.in", "r", stdin);
freopen("next.out", "w", stdout);
char ch = fgetc(stdin);
while(ch >= '0' && ch <= '9'){
v[n] = ch - '0';
ch = fgetc(stdin);
n++;
}
int i, aux;
for(i = 0; i < n - i - 1; i++){
aux = v[i]; v[i] = v[n - i - 1]; v[n - i - 1] = aux;
}
scanf("%lld", &d);
long long ad = d - mod();
if(ad == d)
ad = 0;
adun(ad);
while(n > 0){
n--;
printf("%d", v[n]);
}
return 0;
}