Pagini recente » Cod sursa (job #2123177) | Cod sursa (job #2082852) | Cod sursa (job #2426424) | Cod sursa (job #2458847) | Cod sursa (job #83748)
Cod sursa(job #83748)
#include <fstream.h>
#include <string.h>
#define infile "next.in"
#define outfile "next.out"
#define nmax 1000001
int n[nmax];
long long d, d2, i, rest;
char aux[nmax];
void readdata();
void solve();
void writedata();
void add();
int main()
{
readdata();
solve();
writedata();
return 0;
}
void readdata()
{
int temp;
ifstream fin;
fin.open(infile);
fin.getline(aux, 1001);
n[0]=strlen(aux);
for (i=1; i<=n[0]; i++)
n[i]=aux[n[0]-i]-'0';
fin>>d;
fin.close();
}
void add()
{
long i, t = 0;
for (i=1; i<=n[0] || d2 || t; i++, t/=10, d2/=10)
n[i] = (t += n[i] + d2%10) % 10;
n[0] = i - 1;
}
int mod()
{
long i, t = 0;
for (i = n[0]; i > 0; i--)
t = (t * 10 + n[i]) % d;
return t;
}
void sub()
{
long i, t = 0;
for (i = 1; i <= n[0]; i++, rest/=10)
n[i] += (t = (n[i] -= rest%10 + t) < 0) * 10;
for (; n[0] > 1 && !n[n[0]]; n[0]--);
}
void solve()
{
d2=d;
add();
rest=mod();
sub();
}
void writedata()
{
ofstream fout;
fout.open(outfile);
for (i=n[0]; i>0; i--) fout<<n[i];
fout.close();
}