UVA550 Multiplying by Rotation

最新推荐文章于 2019-04-29 13:34:38 发布

围巾的ACM

最新推荐文章于 2019-04-29 13:34:38 发布

阅读量426

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/51456951

模拟专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一种特殊的乘法运算——旋转乘法，并通过模拟的方式实现了这一算法。该算法的特点在于将乘法运算的结果通过旋转操作来表示，具体表现为将乘积的最低位移动到最高位。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

思路：简单的模拟乘法

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
	int n,m,k;
	while(scanf("%d%d%d",&m,&k,&n)!=EOF)
	{
		int count = 1,now=k,save=0,temp;
		while(now*n+save!=k)
		{
			temp=now;
			now = (temp*n+save)%m;
			save = (temp*n+save)/m;
			count++;
		}
		printf("%d\n",count);
	}
}

Warning: Not all numbers in this problem are decimal numbers!
Multiplication of natural numbers in general is a cumbersome operation. In some cases however the
product can be obtained by moving the last digit to the front.
Example: 179487 * 4 = 717948
Of course this property depends on the numbersystem you use, in the above example we used the
decimal representation. In base 9 we have a shorter example:
17 * 4 = 71 (base 9)
as (9 * 1 + 7) * 4 = 7 * 9 + 1
Input
The input for your program is a textfile. Each line consists of three numbers separated by a space: the
base of the number system, the least significant digit of the first factor, and the second factor. This
second factor is one digit only hence less than the base. The input file ends with the standard end-of-file
marker.
Output
Your program determines for each input line the number of digits of the smallest first factor with the
rotamultproperty. The output-file is also a textfile. Each line contains the answer for the corresponding
input line.
Sample Input
10 7 4
9 7 4
17 14 12
Sample Output
6
2
4