2017 ACM-ICPC 亚洲区（西安赛区）网络赛 C

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

Input Format

First line an integer TTT,
indicates the number of test cases (T≤100T \le 100T≤100).
Then Each line has a single integer x(1≤x≤1000000)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 exceed200020002000.
If there are more than one answer, output anyone is ok.

样例输入

1
1

样例输出

89999999999999999999999999

题目说的是输出任何一个答案都行

那就找一个不超2000位，然后每个数都符合条件的一个答案就行了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<cstdlib>
#include<string>
#include<set>
#include<stack>
#define mod 1000000007

using namespace std;

int main()
{
int T;
int x;
scanf("%d",&T);
while(T--){
scanf("%d",&x);
for(int i=0;i<233;i++){
printf("10000000");
}
printf("\n");
}
return 0;
}