Pagini recente » Cod sursa (job #2199690) | Cod sursa (job #1358885) | Cod sursa (job #2782863) | Cod sursa (job #3155059) | Cod sursa (job #41038)
Cod sursa(job #41038)
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
typedef int lnum[1000002];
char s[1000003];
long long d;
lnum n;
long long aux;
int main()
{
int i,j;
freopen("next.in","r",stdin);
freopen("next.out","w",stdout);
scanf("%s\n", &s );
n[0] = strlen( s );
for ( i = 1, j = n[0]-1; i <= n[0]; i++, j-- )
n[i] = s[j]-'0';
scanf("%ld\n", &d );
i = n[0]+1;
aux = 0;
while ( i > 1 )
{
if ( aux < d ) {
aux *= 10;
aux += n[--i];
if ( aux > d )
aux = aux % d;
}
}
d -= aux;
if ( aux == 0 ) d = 0;
n[1] += d;
for ( i = 1; i <= n[0]; i++ )
{
n[i+1] += n[i] / 10;
n[i] = n[i] % 10;
if ( i == n[0] && n[i+1] ) n[0]++;
}
for ( i = n[0]; i >= 1; i-- )
printf("%d", n[i] );
fclose(stdin);
fclose(stdout);
return 0;
}