uva 550 - Multiplying by Rotation

通过乘法把最低位搞到最高位。

#include <iostream>#include <cmath>#include <string>using namespace std;//#define TESTint main() {#ifdef TESTfreopen("input.txt", "r", stdin);#endifint base, n, m;while(cin >> base >> n >> m) {if(m == 1) {cout << 1 << endl;continue;}int carry = 0, cur = n, i = 1;for(; ; i++) {int tmp = cur * m + carry;carry = tmp / base;cur = tmp % base;if(carry == 0 && cur == n) {cout << i << endl;break;}}}return 0;}