Pagini recente » Cod sursa (job #471194) | Cod sursa (job #2250285) | Cod sursa (job #1274783) | Cod sursa (job #1448646) | Cod sursa (job #212099)
Cod sursa(job #212099)
#include<stdio.h>
#include<string.h>
char x[1000005];
long a[1000005],lr1,n,i;
long long rez[1000010];
long long d;
void impart(long long x,long long lr)
{long long c=0;
long long i;
for(i=1;i<=lr;++i)
if(c<x)
{
c=c*10+a[i];
if(lr1)rez[++lr1]=0;
}
else
{
rez[++lr1]=c/x;
c%=x;
if(i<=lr)c=c*10+a[i];
}
if(c>=x)
{
rez[++lr1]=c/x;
c%=x;
}
}
void inmult(long long x)
{long long i,t=0;
for(i=1;i<=lr1;++i)
{
rez[i]=rez[i]*x+t;
t=rez[i]/10;
rez[i]%=10;
}
while(t){rez[++lr1]=t%10;t/=10;}
}
int main()
{
freopen("next.in","r",stdin);
freopen("next.out","w",stdout);
gets(x);
n=strlen(x);
for(i=1;i<=n;++i)
a[i]=x[i-1]-'0';
scanf("%lld",&d);
impart(d,n);
for(i=lr1;rez[i]==9;--i)rez[i]=0;
++rez[i];
inmult(d);
for(i=1;i<=lr1;++i)printf("%ld",rez[i]);
printf("\n");
return 0;
}