LightOJ
来源:互联网 发布:广东韶关网络问政平台 编辑:程序博客网 时间:2024/06/10 15:51
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 starts with an integer T (≤ 300), denoting the number of test cases.
Each case will contain two integers n (0 < n ≤ 106 andn will not be divisible by 2 or 5) and the allowable digit(1 ≤ digit ≤ 9).
For each case, print the case number and the number of digits of such multiple. If several solutions are there; report the minimum one.
3
3 1
7 3
9901 1
Case 1: 3
Case 2: 6
Case 3: 12
#include<math.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
int r=1;
while(t--)
{
long long n,k;
scanf("%lld%lld",&n,&k);
int ans=1;
long long s=k;
while(s%n!=0)
{
s=(s*10+k)%n;
ans++;
}
printf("Case %d: %d\n",r++,ans);
}
}
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
int r=1;
while(t--)
{
long long n,k;
scanf("%lld%lld",&n,&k);
int ans=1;
long long s=k;
while(s%n!=0)
{
s=(s*10+k)%n;
ans++;
}
printf("Case %d: %d\n",r++,ans);
}
}
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- [LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- linux系统忘记密码怎么办
- 方法的重载
- 小型工厂怎么玩转生产管理系统(MES)?
- 常见对象-把int数组拼接字符串的案例
- JAVA调用ORACLE的存储过程、函数的返回结果集
- LightOJ
- underscore.js
- 【数据结构】C语言实现栈的进栈,出栈,遍历,清空等操作
- 自定义view图形的步骤
- UBUNTU 16.04 安装chrome浏览器
- NOIP2015年普级组试题 金币
- python 2环境配置
- jdbc链接mysql程序
- 《程序员的数学》看书笔记。