Pagini recente » Cod sursa (job #1411224) | Istoria paginii runda/ag/clasament | Cod sursa (job #2363472) | Cod sursa (job #1656133) | Cod sursa (job #268204)
Cod sursa(job #268204)
#include<stdio.h>
#include<iostream.h>
#define IN "next.in","r",stdin
#define OUT "next.out","w",stdout
char ch[1000000];
long long d;
int j;
int B[1000000];
void citire()
{
int i;
freopen(IN);
cin.getline(ch,'\n');
scanf("%lld",&d);
}
int mod()
{
int i, t = 0;
for (i = ch[1]; i >= 0; i--)
{
t = (t * 10 + ch[i]) % d;
if(ch[i]>0 && j==0)
j=i;
}
return t;
}
void form()
{
char c;
for(int i=j;i>=0;--i)
{
c=ch[i];
B[i]=c;
}
}
void add(int r)
{
for(int i=j;i>=0 && r;--i)
{
B[i]+=r%10;
r/=10;
}
}
void solve()
{
freopen(OUT);
long long r=mod();
//printf("%lld",r);
form();
add(r);
for(int i=1;i<=j;++i)
printf("%d",ch[i]);
printf("\n");
}
int main()
{
citire();
solve();
return 0;
}