Pagini recente » Cod sursa (job #570839) | Cod sursa (job #2883796) | Cod sursa (job #1227589) | Cod sursa (job #977394) | Cod sursa (job #2178007)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll mod(int a[], ll b) {
ll t=0;
for (int i=a[0]; i>=1; i--) {
t=(t*10+a[i])%b;
}
return t;
}
void add(int a[], ll b) {
ll t=b,i;
for (i=1; t; i++, t/=10) {
a[i]=(t=t+a[i])%10;
}
a[0]=max(a[0],(int)i-1);
}
string s;
int a[1000100];
ll d,b;
int main() {
ifstream cin("next.in");
ofstream cout("next.out");
getline(cin,s);
for (int i=0; i<s.size();i++) {
a[i+1]=s[s.size()-1-i]-'0';
}
a[0]=s.size();
cin>>d;
b=mod(a,d);
if (b) add(a,d-b);
for (int i=a[0]; i>=1; i--) cout<<a[i];
return 0;
}