Pagini recente » Cod sursa (job #1592238) | Cod sursa (job #588090) | fmi-no-stress-2012/solutii/cercuri4 | Cod sursa (job #1381748) | Cod sursa (job #176780)
Cod sursa(job #176780)
// http://infoarena.ro/problema/next
#include <stdio.h>
#include <string.h>
FILE *fin = fopen("next.in","r"), *fout = fopen("next.out","w");
char N[1000005];
int REZ[1000005];
long long D, S;
// functia <mod> dupa debugging pare a fi buna :)
// sunt probleme la functia <suma>
long mod(char a[],long long b)
{
long i;
long long t = 0;
for(i = 0 ; i <= S - 2 ; i++)
{
t = (t * 10 + (a[i] - '0')) % b;
}
return t;
}
void suma(long long b)
{
int i, t = 0;
for (i = 0; b || t; i++, b /= 10, t /= 10)
REZ[i] = (t += ((N[S - i - 2] - '0') + b % 10)) % 10;
for (int j = i; j < S - 1; j++)
if (j == i) REZ[j] = (N[S - j - 2] - '0') + t;
else REZ[j] = (N[S - j - 2] - '0');
}
int main()
{
long long r1, r2;
fgets(N, 1000005, fin); // citire din fisier numar mare
S = strlen(N);
fscanf(fin, "%lld\n", &D);
r1 = mod(N, D);
r2 = (D - r1) % D;
suma(r2);
for (long i = S - 2; i >= 0; i--)
fprintf(fout, "%d", REZ[i]);
fcloseall();
return 0;
}