LightOJ 1078 Integer Divisibility（数学取模运算）

Integer Divisibility

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 ≤ 106 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
3 1
7 3
9901 1

Sample Output

Case 1: 3
Case 2: 6
Case 3: 12

题意
如果一个整数不被2或5整除，则在十进制中它的某一个倍数是一个单独一个数字的序列，给出这个整数和这个单独的数字，找到最短的数字序列长度可以整除该整数

题解
一个一个数字往上加，重点在数字序列过长时会爆精度，所以加上取模运算

代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <math.h>
#include <ctime>
#include <unordered_map>
//#include <tr1/unordered_map>

using namespace std;
#define me(x,y) memset(x,y,sizeof x)
#define MIN(x,y) x < y ? x : y
#define MAX(x,y) x > y ? x : y

typedef long long ll;
typedef unsigned long long ull;

const long double INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const double eps = 1e-06;
const long double PI = std::acos(-1);
const int M=32768;
const int maxn = 1010;


int main() {
    int t,ca=1;
	cin>>t;
	while(t--){
		ll m,n,ans,sum=1;
		cin>>n>>m;
		ans = m;
		while(ans%n!=0){
			sum++;
			ans = (ans*10+m)%n;
		}
		printf("Case %d: %d\n",ca++,sum);
	}
    return 0;
}

/*

*/