Find The Multiple
来源:互联网 发布:知乎app ipad 编辑:程序博客网 时间:2024/04/28 09:08
Description
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.
Input
The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.
Output
For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.
Sample Input
2
6
19
0
Sample Output
10
100100100100100100
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.
Input
The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.
Output
For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.
Sample Input
2
6
19
0
Sample Output
10
100100100100100100
111111111111111111
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;bool f;void dfs(__int64 x,int n,int k){ if(f||k==19) return; if(x%n==0) { f=true; printf("%I64d\n",x); return; } dfs(x*10,n,k+1); dfs(x*10+1,n,k+1);}int main(){ int n; while(cin >> n) { f=false; if(n==0) return 0; dfs(1,n,0); } return 0;}
2 0
- POJ1426 Find The Multiple
- poj1426 Find The Multiple
- G - Find The Multiple
- poj1426 - Find The Multiple
- POJ1426 Find The Multiple
- POJ1426-Find The Multiple
- Find The Multiple
- poj find the multiple
- poj1426 Find The Multiple
- poj1426-Find The Multiple
- POJ1426 Find the multiple
- POJ1426-Find The Multiple
- POJ1426 Find The Multiple
- zoj1530 Find The Multiple
- Find The Multiple
- Find The Multiple
- poj1426 Find The Multiple
- Find The Multiple poj1426
- 基于在线多示例学习的稳定目标跟踪方法
- IP地址和子网掩码的作用是什么
- OpenJudge百炼习题解答(C++)--题3858:和数
- codeforces #336 D. Zuma (区间dp)
- 程序员面试题精选100题(18)-用两个栈实现队列[数据结构]
- Find The Multiple
- C/C++ 图像处理(9)------图像の桶形畸变矫正
- 程序员面试题精选100题(19)-反转链表[数据结构]
- 《超级优化Linux远程SSH连接》
- Java c++通过des加解密
- 欢迎使用CSDN-markdown编辑器
- 这是我的第一篇博客
- JavaScript奇技淫巧45招
- 程序员面试题精选100题(20)-最长公共子串[算法]