Pagini recente » Cod sursa (job #2684706) | Cod sursa (job #3178720) | Cod sursa (job #2054112) | Cod sursa (job #2316029) | Cod sursa (job #2440139)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_DIGITS=1000002;
const int BASE=10;
class HugeN
{
private:
int x[MAX_DIGITS];
public:
HugeN()
{
memset(x,0,sizeof(x));
x[0]=1;
}
HugeN(int n)
{
memset(x,0,sizeof(x));
do{
++x[0];
x[x[0]]=n%10;
n=n/10;
}while(n>0);
}
HugeN(const HugeN & other)
{
memcpy(x,other.x,sizeof(other.x));
}
HugeN(char s[101])
{
int n,i;
memset(x,0,sizeof(x));
n=strlen(s);
x[0]=n;
for(i=n-1;i>=0;i--)
x[n-i]=s[i]-'0';
}
void print()
{
int i;
for(i=x[0];i>=1;i--)
{
cout<<x[i];
}
cout<<endl;
}
long long operator % (long long k);
HugeN operator /= (long long k);
HugeN operator += (long long k);
};
long long HugeN::operator % (long long k)
{
long long r;
int i;
r=0;
for(i=x[0];i>=1;i--)
{
r=r*10+x[i];
r=r%k;
}
return r;
}
HugeN HugeN::operator /= (long long k)
{
long long i,r;
r=0;
for(i=x[0];i>=1;i--)
{
r=r*10+x[i];
x[i]=r/k;
r=r%k;
}
while(x[0]>1 && x[x[0]]==0)
{
x[0]--;
}
return *this;
}
HugeN HugeN::operator += (long long k)
{
long long tr=k;
int i;
for(i=1;i<=x[0];i++)
{
tr=x[i]+tr;
x[i]=tr%10;
tr=tr/10;
}
while(tr)
{
x[0]++;
x[x[0]]=tr%10;
tr=tr/10;
}
return *this;
}
int main()
{
freopen("next.in","r",stdin);
freopen("next.out","w",stdout);
long long d,rest,p;
char s[MAX_DIGITS];
cin.getline(s,MAX_DIGITS);
HugeN a(s);
scanf("%lld",&d);
rest=a%d;
if(rest!=0)
{
p=d-rest;
a+=p;
a.print();
}
else
a.print();
return 0;
}