light oj 1078 - Integer Divisibility
来源:互联网 发布:python控制树莓派gpio 编辑:程序博客网 时间:2024/05/17 05:04
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 ≤ 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 111能被3整除.
Case 2: 6 333333能被7整除
Case 3: 12 111111111111能被9901整除
此题用同余定理
(a*b)%c=(a%c*b%c)%c;
(a+b)%c=(a%c+b%c)%c;代码如下:
#include<stdio.h>#include<algorithm>#include<stdlib.h>#include<math.h>using namespace std;int main(){int t,k=0;scanf("%d",&t);while(t--){__int64 n,m,flag;scanf("%I64d%I64d",&n,&m);flag=m%n;int ans=1;while(flag){flag=(flag*10+m)%n;//其实这跟我们平常手算除法的思想差不多一样ans++;}k++;printf("Case %d: ",k);printf("%d\n",ans);}}
- light--oj--1078 - Integer Divisibility
- Light OJ 1078:Integer Divisibility
- light oj 1078 - Integer Divisibility
- light oj 1078 - Integer Divisibility
- Light OJ 1078:Integer Divisibility【数学】
- Light OJ 1078:Integer Divisibility【数学】
- 【Light】[1078]Integer Divisibility
- light oj 1078 - Integer Divisibility【同余定理】
- light oj 1078 - Integer Divisibility (取模运算)
- Light Oj 1078 Integer Divisibility(同余定理)
- Light OJ Integer Divisibility 【取模】
- Light 1078 Integer Divisibility (取模运算)
- Light 1078 Integer Divisibility (取模运算)
- 【Light-oj】-Integer Divisibility(同余定理)
- LIGHTOJ-1078 - Integer Divisibility
- LightOJ-1078 Integer Divisibility
- 1078 - Integer Divisibility
- 【light oj1078】Integer Divisibility(同余定理)
- 数组元素替换
- 华为ME60常用维护命令
- 关闭_CRT_SECURE_NO_WARNINGS警告
- 关于android textview 中英文混合分行错误问题
- ajax实现异步任务
- light oj 1078 - Integer Divisibility
- AudioFlinger,AudioPolicyService and Audio track分析
- 单链表
- 瑞萨单片机教程(2013) -R8C系列 输入输出端口配置
- jase总结--10(数组)
- 在使用oracle中遇到的一些问题
- SDP Profile-level-id解析
- view 构造函数
- 用循环求解