1151. Basic remains

单点时限: 2.0 sec

内存限制: 256 MB

Given a base b and two non-negative base b integers p and m, compute p mod m and print the result as a base b integer. p mod m is defined as the smallest non-negative integer k such that p = a*m + k for some integer a.

输入格式

Input consists of a number of cases. Each case is represented by a line containing three unsigned integers. The first, b, is a decimal number between 2 and 10. The second, p, contains up to 1000 digits between 0 and b-1. The third, m, contains up to 9 digits between 0 and b-1. The last case is followed by a line containing 0.

输出格式

For each test case, print a line giving p mod m as a base-b integer.

样例

Input
2 1100 101
10 123456789123456789123456789 1000
0
Output
10
789

14 人解决,20 人已尝试。

15 份提交通过,共有 42 份提交。

5.3 EMB 奖励。

创建: 15 年,7 月前.

修改: 5 年,3 月前.

最后提交: 1 月,1 周前.

来源: partychen

题目标签