Pagini recente » Cod sursa (job #3365320) | Cod sursa (job #3365248) | Cod sursa (job #3366645) | Cod sursa (job #3365898) | Cod sursa (job #3366397)
// #pragma GCC optimize("O3,unroll-loops,fast-math")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int Nmax=1e6+105,inf=1e9,MOD=1e9+7;
int a[Nmax],len;
void add(ll x) {
ll carry=x;
for (int i=0; i<len; ++i) {
carry+=a[i];
a[i]=carry%10;
carry/=10;
}
while (carry) {
a[len++]=carry%10;
carry/=10;
}
}
int main() {
ifstream cin("next.in");
ofstream cout("next.out");
string s;
ll d;
cin>>s>>d;
len=s.size();
reverse(s.begin(), s.end());
for (int i=0; i<len; ++i) a[i]=s[i]-'0';
ll r=0;
for (int i=len-1; i>=0; --i) r=(r*10+a[i])%d;
if (r) add(d-r);
for (int i=len-1; i>=0; --i) cout<<a[i];
return 0;
}