Pagini recente » Cod sursa (job #806734) | Cod sursa (job #2915710) | Cod sursa (job #2688760) | Cod sursa (job #707199) | Cod sursa (job #1336811)
#include<fstream>
#include<string>
using namespace std;
ifstream in("next.in");
ofstream out("next.out");
const int base = 10, nmax = 1000006;
int n[nmax];
string s;
long long rest, d;
void adunare(long long x)
{
int minte = 0;
for(int i = 1; x>0 || minte!=0; i++)
{
if(i>n[0])
n[0]++;
n[i] += x % 10 + minte;
minte = n[i] / base;
n[i] %= base;
x /= 10;
}
}
int main(){
int player_unu=0;
in>>s>>d;
for(int i = (int)s.size() - 1; i>=0; i--)
{
n[0]++;
n[n[0]] = s[i] - '0';
}
for(int i = n[0]; i>0; i--)
{
rest = (rest * 10 + n[i]) % d;
}
rest = (d - rest) % d;
adunare(rest);
for(int i = n[ 0 ]; i>0; i--)
{
out<<n[i];
}
out<<'\n';
return player_unu;
}