Sum-2017 ACM-ICPC 亚洲区（西安赛区）

最新推荐文章于 2021-08-21 20:43:07 发布

原创最新推荐文章于 2021-08-21 20:43:07 发布 · 674 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#模拟

模拟专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一种巧妙的方法来解决数学问题：对于任意正整数x，找到一个正整数k，使得S(k*x)除以233的余数为0。S(x)定义为x的十进制表达中所有数字的和。通过观察发现，当k为连续233个9组成的数字时，S(k*x)总是能被233整除。

Define the function $S (x)$ for $x$ is a positive integer. $S (x)$ equals to the sum of all digit of the decimal expression of $x$ . Please find a positive integer $k$ that $S(k*x)\%233=0$ .

Input Format

First line an integer $T$ , indicates the number of test cases ( $\le 100$ ). Then Each line has a single integer $\le x \le 1000000)$ indicates i-th test case.

Output Format

For each test case, print an integer in a single line indicates the answer. The length of the answer should not exceed $2000$ . If there are more than one answer, output anyone is ok.