Find The Multiple（技巧）

最新推荐文章于 2024-07-08 17:31:06 发布

riversuer

最新推荐文章于 2024-07-08 17:31:06 发布

阅读量263

点赞数

分类专栏：数论文章标签：技巧

数论专栏收录该内容

19 篇文章 1 订阅

订阅专栏

Find The Multiple

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

题意
给出一个数，让你求仅由0和1组成且能够整除这个数的数
思路
巧妙利用奇数偶数的性质，核心代码：mod[i] = mod[i/2]*10+i%2。进行一层for循环即可，当i为奇数时模2余1，为偶数时模2余0。本质上是循环代替搜索。

代码

#include <stdio.h>
#include <string.h>
using namespace std;
long long mod[1000000];
int main()
{
    int n,i;
    while(~scanf("%d",&n)&&n)
    {
        for(i=1;;i++)
        {
            mod[i]=mod[i/2]*10+i%2;
            if(mod[i]%n==0)
            {
                printf("%lld\n",mod[i]);
                break;
            }
        }
    }
    return 0;
}