Pagini recente » Cod sursa (job #289515) | Cod sursa (job #2917373) | Cod sursa (job #2921886) | Cod sursa (job #1447383) | Cod sursa (job #292399)
Cod sursa(job #292399)
#include<fstream>
#include<string.h>
#define N 1000001
using namespace std;
char sir[N];
int rst[N];
int ok, nr[N];
long long d, rest;
void add(int A[], int B[])
{
int i, t = 0;
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
A[i] = (t += A[i] + B[i]) % 10;
A[0] = i - 1;
}
int mod(int A[], long B)
{
int i, t = 0;
for (i = A[0]; i > 0; i--)
t = (t * 10 + A[i]) % B;
return t;
}
int main()
{
ifstream f("next.in");
ofstream g("next.out");
int lung, k = 1, i;
f.getline(sir, 1000000);
lung = strlen(sir);
for(i = 0; i < strlen(sir); i++)
nr[lung-i] = sir[i]-'0';
nr[0] = strlen(sir);
f>>d;
rest = d - mod(nr,d);
if(rest != d)
{
while(rest)
{
rst[k++] = rest%10;
rest/= 10;
}
rst[0] = k-1;
add(nr, rst);
}
for(i = nr[0]; i >= 1; i--)
g<<nr[i];
return 0;
}