Find The Multiple
来源:互联网 发布:随着大数据时代的来临 编辑:程序博客网 时间:2024/06/05 03:24
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
26190
Sample Output
10100100100100100100111111111111111111
题意:找出任意一个由0和1组成的数,而且是n的倍数。unsigned __int64可以存下结果,循环深度<20;
两条搜索路径---t*10;t*10+1;
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;bool vis;int n;void dfs(unsigned __int64 x,int n,int k){if(vis) return;if(x%n==0){printf("%I64u\n",x);vis=true;return;}if(k==19) return;dfs(x*10,n,k+1);dfs(x*10+1,n,k+1);}int main(){while(scanf("%d",&n)){if(n==0) break;vis=false;dfs(1,n,0);}return 0;}
0 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
- mysql中触发器的应用
- java虚拟机的垃圾回收机制(转载)
- 7--函数
- 【Java】String类的方法介绍
- Noip2006普及组
- Find The Multiple
- 使用QImage进行高质量绘制(High-Quality Rendering with QImage)
- 单调递增最长子序列
- Vega Prime 新手 入门指引
- 关于MySQL数据库重装失败,出现问题,重装的时候出现错误1130的问题和解决办法。
- 第四次c++作业——输出星号图
- UFIDL稀疏自编码代码实现及解释
- HDU 3032Nim or not Nim Nim博弈 规律
- 【GDOI2016模拟4.23】轻重路径