poj3696 The Luckiest number 数论好题

最新推荐文章于 2020-07-16 23:10:33 发布

qiqijianglu

最新推荐文章于 2020-07-16 23:10:33 发布

阅读量2.4k

点赞数

分类专栏：数论文章标签： integer input each

本文链接：https://blog.csdn.net/qiqijianglu/article/details/7926478

版权

给定一个数L，目标找到最小的只包含8的正整数且能被L整除。若存在，输出该数的位数；若不存在，输出0。题目涉及数论知识，通过分析10的幂次模运算解决问题。

摘要由CSDN通过智能技术生成

The Luckiest number

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3536		Accepted: 917

Description

Chinese people think of '8' as the lucky digit. Bob also likes digit '8'. Moreover, Bob has his own lucky number L. Now he wants to construct his luckiest number which is the minimum among all positive integers that are a multiple of L and consist of only digit '8'.

Input

The input consists of multiple test cases. Each test case contains exactly one line containing L(1 ≤ L ≤ 2,000,000,000).