Light OJ 1078:Integer Divisibility【数学】

最新推荐文章于 2019-02-13 23:23:43 发布

昨日明眸

最新推荐文章于 2019-02-13 23:23:43 发布

阅读量280

点赞数

分类专栏： ————数学问题————

本文链接：https://blog.csdn.net/qaz135135135/article/details/52074007

版权

————数学问题———— 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu

Submit Status Practice LightOJ 1078

uDebug

Description

If an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you should report the number of digits of such multiple.

For example you have to find a multiple of 3 which contains only 1's. Then the result is 3 because is 111 (3-digit) divisible by 3. Similarly if you are finding some multiple of 7 which contains only 3's then, the result is 6, because 333333 is divisible by 7.

Input

Input starts with an integer T (≤ 300), denoting the number of test cases.

Each case will contain two integers n (0 < n ≤ 10⁶ and n will not be divisible by 2 or 5) and the allowable digit (1 ≤ digit ≤ 9).

Output

For each case, print the case number and the number of digits of such multiple. If several solutions are there; report the minimum one.

Sample Input

3 1

7 3

9901 1

Sample Output

Case 1: 3

Case 2: 6

Case 3: 12

同余定理：

#include<stdio.h>
int main()
{
	int t,n,m,sum,a,k=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		a=m;
		for(int i=1;;i++)
		{
			if(m%n!=0)
			{m=m%n;
				m=m*10+a;
			}
			else
			{
				sum=i;
				break;
			}
		}
		printf("Case %d: %d\n",k++,sum);
	}
}