Pagini recente » Cod sursa (job #2928335) | Cod sursa (job #737268) | Cod sursa (job #1311434) | Cod sursa (job #2889251) | Cod sursa (job #1788865)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("next.in");
ofstream g("next.out");
char n[1000001];
long long int D;
int N[1000001];
long long int mod(int A[], long long int B)
{
int i;
long long t = 0;
for (i = A[0]; i > 0; i--)
t = (t * 10 + A[i]) % B;
return t;
}
void add(int A[], long long int B)
{
int i;
long long t = B;
for (i=1; i<=A[0] || t; i++, t/=10)
A[i] = (t += A[i]) % 10;
A[0] = i - 1;
}
void afisare(int N[]) {
int i;
for (i = N[0]; i >= 1; i--)
g << N[i];
}
int main()
{
f >> n;
f >> D;
int l = strlen(n);
for (int i = 1; i <= l; i++)
N[i] = n[l - i] - '0';
N[0] = l;
long long int R = mod(N, D);
if (R > 0) add(N, D - R);
afisare(N);
return 0;
}