即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

Find The Multiple

编程语言 baidu_32048673 20℃ 0评论
本文目录
[隐藏]

1.

Find The Multiple

2.


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

2.


#include
#include
#include
#include
#include
typedef long long ll;
const int maxn= 100006;
#define cle(n) memset(n,0,sizeof(n))
const long long inf=1000000009;
using namespace std;
const int N = 100001;


ll n;
bool found;

void dfs(ll t,ll n,int k)
{
   if(found)return;
   if(k>=19)
    return;
   if(t%n==0)
   {
       cout<



 

转载请注明:CodingBlog » Find The Multiple

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情