问题描述:
Define the function S(x)S(x) for xx is a positive integer. S(x)S(x) equals to the sum of all digit of the decimal expression of xx. Please find a positive integer kk that S(k*x)\%233=0S(k∗x)%233=0.
Input Format
First line an integer TT, indicates the number of test cases (T \le 100T≤100). Then Each line has a single integer x(1 \le x \le 1000000)x(1≤x≤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 20002000. If there are more than one answer, output anyone is ok.
样例输入
1
1
样例输出
89999999999999999999999999
Input Format
First line an integer TT, indicates the number of test cases (T \le 100T≤100). Then Each line has a single integer x(1 \le x \le 1000000)x(1≤x≤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 20002000. If there are more than one answer, output anyone is ok.
样例输入
1
1
样例输出
89999999999999999999999999
题目题意:题目给了一个函数S(x) 其中S(x)表示x的每个位数的和。题目给我们一个数x,让我们求S(k*x) % 233=0,输出任意k即可。
题目分析:这个题目脑洞了好久,一直在想怎么构造数X使得S(X) %233=0,终于有了眉目。
我们构造数 如下
100..00100..00100..001 (其中有233个1,中间的0的个数等于x的位数-1.
例如
1000100010001....10001 *6544=6544 6544 6544 6544 6544....6544 6544 有233个6544
一定满足题意.
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while (t--) {
int x;
scanf("%d",&x);
int len=0;
while (x) {
len++;
x=x/10;
}
len--;
for (int i=1;i<=232;i++) {
printf("1");
for (int j=1;j<=len;j++)
printf("0");
}
printf("1\n");
}
return 0;
}