Light Oj 1078 Integer Divisibility(同余定理)
来源:互联网 发布:tomcat打不开8080端口 编辑:程序博客网 时间:2024/05/16 11:58
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
Case 2: 6
Case 3: 12
思路:中间对d累加的过程中,会超long long ,所以每次都先取余,再累加;这是同余定理的应用;
代码:
#include<stdio.h>int main(){int t,n,d,i,mm=1;scanf("%d",&t);while(t--){ scanf("%d%d",&n,&d);long long sum=d;for(i=1;;i++){sum=sum%n;if(sum==0)break;sum=sum*10+d;}printf("Case %d: %d\n",mm++,i);}return 0;}
- Light Oj 1078 Integer Divisibility(同余定理)
- light oj 1078 - Integer Divisibility【同余定理】
- 【Light-oj】-Integer Divisibility(同余定理)
- 【light oj1078】Integer Divisibility(同余定理)
- LightOJ 1078 - Integer Divisibility (同余定理)
- lightoj 1078 - Integer Divisibility 【同余定理】
- 【 LightOJ 1078 Integer Divisibility + 同余定理 】
- LightOJ 1078 Integer Divisibility (同余定理)
- LightOJ1078 Integer Divisibility(同余定理)
- LightOJ 1078 Integer Divisibility (同余定理)
- LightOJ 1078 Integer Divisibility (同余定理 )
- LightOJ1078 Integer Divisibility (同余定理)
- light--oj--1078 - Integer Divisibility
- Light OJ 1078:Integer Divisibility
- light oj 1078 - Integer Divisibility
- light oj 1078 - Integer Divisibility
- lightoj 1078 - Integer Divisibility 【同余】
- LightOJ 1078 - Integer Divisibility【同余】
- 【codevs2998】【HNOI2006】 鬼谷子的钱袋
- 简析穷举算法,及其简单应用
- Unity UGUI图文混排源码(四) -- 聊天气泡
- 相机去畸变,以及双目平行校正----极线校正(一)————之单目畸变校正详细过程
- BZOJ 2301: [HAOI2011]Problem b【莫比乌斯反演
- Light Oj 1078 Integer Divisibility(同余定理)
- 51nod 1102
- 大话数据结构读书笔记 1---线性表
- WebSocket
- Servlet 笔记
- 机器学习系列(15)_SVM碎碎念part3:如何找到最优分离超平面
- IOS10系统 app没有出现在系统设置-通知列表处理
- 小米笔试题
- OpenJudge - 6683 变幻的矩阵 模拟 重庆一中高2018级竞赛班第十一次测试 2016.9.24 Problem 1