首页 > 代码库 > poj1426
poj1426
Find The Multiple
| Time Limit: 1000MS | Memory Limit: 10000K | |||
| Total Submissions: 27177 | Accepted: 11309 | Special Judge | ||
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
Source
Dhaka 2002
题解：
题目的意思就是给你一个数n，让你找到一个它的倍数只由1和0组成。（任何一个都可以，Special Judge）
AC代码：（c++）
#include<cstdio>using namespace std;int n,flag;void go(long long p,int k){ if(flag||k==20) return ; if(p%n==0){ printf("%I64u\n",p); flag=1; } else{ go(p*10,k+1); go(p*10+1,k+1); }}int main(){ for(scanf("%d",&n);n;scanf("%d",&n)) flag=0,go(1,1); return 0;}
poj1426
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。