Pagini recente » Cod sursa (job #1387089) | Cod sursa (job #1783353) | Cod sursa (job #1799053) | Cod sursa (job #73584) | Cod sursa (job #1982382)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f ("next.in");
ofstream g ("next.out");
char t[1000005],s[1000005];
long long d,r;
int n;
int main()
{
f>>(t+1);
f>>d;
n=strlen(t+1);
for(int i=n;i>=1;--i) //calculam restul nr impartit la d
{
s[i]=t[n-i+1]-'0';
r=(r*10+s[i])%d;
}
r=(d-r)%d; //calculam ce trb adunat pana cand va fi multiplu de d
for(int i=1;i<=n||r;++i,r/=10) s[i]=(r+=s[i])%10;
while(s[n+1]) ++n;
for(int i=n;i>=1;--i) g<<int(s[i]);
return 0;
}