Pagini recente » Cod sursa (job #3279106) | Borderou de evaluare (job #2510040) | Cod sursa (job #2627115) | Cod sursa (job #1142707) | Cod sursa (job #411022)
Cod sursa(job #411022)
#include <cstdio>
long long n,d;
void citire()
{
freopen("next.in","r",stdin);
freopen("next.out","w",stdout);
scanf("%lld%lld",&n,&d);
}
int mod(int A[],int B)
{
int i,t=0;
for (i=A[0];i>0;i--)
t=(t*10+A[i])%B;
return t;
}
/*void solve()
{
int r=mod(n,d);
n+=mod(d-r,d);
printf("%d",n);
}*/
int main()
{
citire();
long long r=n%d;
n=n+(d-r)%d;
printf("%lld",n);
//solve()
return 0;
}