Pagini recente » Cod sursa (job #2064244) | Cod sursa (job #1188948) | Cod sursa (job #700077) | Cod sursa (job #2030649) | Cod sursa (job #1336307)
#include<fstream>
#include<string>
using namespace std;
ifstream fin( "next.in" );
ofstream fout( "next.out" );
const int base = 10;
int n[ 1000001 ];
string s;
void add( long long p ) {
int i, t = 0;
for( i = 1; p > 0 || t != 0; ++ i, p /= 10 ) {
n[ i ] += p % 10 + t;
t = n[ i ] / base;
n[ i ] %= base;
}
-- i;
if ( i > n[ 0 ] ) {
n[ 0 ] = i;
}
}
int main() {
long long r, d;
fin >> s >> d;
r = 0;
for( int i = ( int )s.size() - 1; i >= 0; -- i ) {
n[ ++ n[ 0 ] ] = s[ i ] - '0';
}
s.clear();
for( int i = n[ 0 ]; i > 0; -- i ) {
r = (r * 10 + n[ i ]) % d;
}
if ( r == 0 ) {
r = d;
}
r = d - r;
add( r );
for( int i = n[ 0 ]; i > 0; -- i ) {
fout << n[ i ];
}
fout << "\n";
fin.close();
fout.close();
return 0;
}