Pagini recente » Cod sursa (job #1171488) | Cod sursa (job #2253498) | Cod sursa (job #2436733) | Cod sursa (job #2911892) | Cod sursa (job #56396)
Cod sursa(job #56396)
#include <fstream>
#include <cstring>
using namespace std;
short int N[1000001], R[16];
char X[1000001];
long long D;
int main()
{
ifstream fin("next.in");
ofstream fout("next.out");
long long rest = 0; int i, t = 0;
fin >> X >> D;
N[0] = strlen(X);
for (i = 0; i < N[0] && '0' <= X[i] && '9' >= X[i]; i++)
N[N[0] - i] = X[i] - '0';
for (i = N[0]; i > 0; i--)
rest = (rest * 10 + N[i]) % D;
rest = (D - rest) % D;
while (rest)
{
R[++R[0]] = rest % 10;
rest /= 10;
}
if (!R[0]) R[0] = 1;
for (i = 1; i <= N[0] || i <= R[0] || t; i++, t /= 10)
N[i] = (t += N[i] + R[i]) % 10;
N[0] = i - 1;
for (i = N[0]; i > 0; i--)
fout << N[i];
fout << "\n";
fin.close();
fout.close();
return 0;
}