Pagini recente » Cod sursa (job #430467) | Cod sursa (job #154838) | Cod sursa (job #1838346) | Cod sursa (job #377629) | Cod sursa (job #895461)
Cod sursa(job #895461)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream in ("next.in");
ofstream out("next.out");
int v[1000010],n,i,t,ok,c,j;
long long r,d;
char s[1000010];
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;
}
int main()
{
in>>s>>d;
n=strlen(s);
v[0]=n;
for(i=n;i>=1;i--)
v[i]=s[n-i]-48;
r=mod(v,d);
if(r==0)
out<<s<<'\n';
else
{
r=d-r;
i=1;
while(r)
{
c=r%10;
r=r/10;
v[i]+=c;
j=i;
while(v[j]>9)
{
if(j==n)
n++;
v[j+1]+=v[j]/10;
v[j]=v[j]%10;
j++;
}
i++;
}
for(i=n;i>=1;i--)
out<<v[i];
out<<'\n';
}
in.close();
out.close();
return 0;
}