2017 ACM-ICPC 亚洲区(西安赛区)网络赛 C. Sum

来源:互联网 发布:加内特知乎 编辑:程序博客网 时间:2024/05/17 07:21

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
题目:https://nanti.jisuanke.com/t/17116
题意:
让求k*x的数位和mod 233等于0
思路:0开始可过?positive
代码:
1.

#include<cstdio>int main(){    int t,n;    scanf("%d",&t);    while(t--)    {        scanf("%d",&n);         printf("1");        for(int i = 2;i <= 233;i++)            printf("0000001");        printf("\n");    }}

2.

#include<cstdio>int main(){    int t,n;    scanf("%d",&t);    while(t--)    {        scanf("%d",&n);        for(int i = 1;i <= 233;i++)            printf("9");        printf("\n");    }}
阅读全文
0 0
原创粉丝点击