Pagini recente » Cod sursa (job #638192) | Cod sursa (job #2790766) | Cod sursa (job #3128944) | Cod sursa (job #1386569) | Cod sursa (job #2214947)
#include <fstream>
using namespace std;
ifstream f("next.in");
ofstream g("next.out");
int v[1000009],i,rez[1000005],j;
long long x,nr,t;
int main()
{
char c;
f.get(c);
while (c!='\n')
{
v[++v[0]]=c-'0';
f.get(c);
}
f>>x;
for (i=1;i<=v[0]/2;i++)
{
swap(v[i],v[v[0]-i+1]);
}
for (i=v[0];i>=1;i--)
{
nr=nr*10+v[i];
nr=nr%x;
}
if (nr==0)
{
for (j=v[0];j>=1;j--)
{
g<<v[j];
}
}
else
{
x=x-nr;
while (x)
{
rez[++rez[0]]=x%10;
x=x/10;
}
t=0;
for (j=1;j<=max(v[0],rez[0]);j++)
{
int kk=v[j];
v[j]=(v[j]+rez[j]+t)%10;
t=(kk+rez[j]+t)/10;
}
v[0]=max(v[0],rez[0]);
v[0]+=t;
v[v[0]]+=t;
for (j=v[0];j>=1;j--)
{
g<<v[j];
}
}
return 0;
}