B. The Secret Number

time limit per test

2 seconds

memory limit per test

256 megabytes

Vadim has thought of a number x. To ensure that no one can guess it, he appended a positive number of zeros to the right of it, thus obtaining a new number y. However, as a precaution, Vadim decided to spread the number n=x+y. Find all suitable x that Vadim could have thought of for the given n.

Input

Each test consists of several test cases. The first line contains a single integer t (1≤t≤104) --- the number of test cases. The following lines describe the test cases.

In a single line of each test case, there is an integer n --- the number spread by Vadim (11≤n≤1018).

Output

For each number n, output 0 if there are no suitable x. Otherwise, output the number of suitable x, followed by all suitable x in ascending order.

Example

Input

Copy

复制代码

5

1111

12

55

999999999999999999

1000000000000000000

Output

Copy

复制代码
2
11 101
0
1
5
3
999999999 999000999000999 90909090909090909
0

Note

In the first sample, to 11 one can append two zeros to the right, then 11+1100=1111, and to 101 one can append one zero to the right, then 101+1010=1111.

In the second sample, it is impossible to obtain 12 through the described actions.

解题说明:此题是一道数学题,给出一个N,是否能找出一个X,使得X+Y=N,其中Y = X ∗ 10 ^K,求解X+X ∗ 10 ^K=N。 因为N范围小于10^18次方,因此K最多为18.直接求解即可。

cpp 复制代码
#include <stdio.h>
int main()
{
	long long t; 
	scanf("%lld", &t);
	while (t--) 
	{
		long long n; 
		scanf("%lld", &n);
		long long test = 1, testt[64];
		int cnt = 0;
		for (int k = 1; k <= 18; k++)
		{
			test *= 10;
			long long d = test + 1;
			if (n % d == 0)
			{
				testt[cnt++] = n / d;
			}
		}
		if (cnt == 0) 
		{
			printf("0\n");
			continue;
		}
		printf("%d\n", cnt);
		for (int i = cnt - 1; i >= 0; i--)
		{
			printf("%lld", testt[i]);
			if (i)
			{
				printf(" ");
			}
		}
		printf("\n");
	}
	return 0;
}
相关推荐
郝学胜-神的一滴2 小时前
Effective STL 条款03:容器中的对象复制要廉价且正确
开发语言·数据结构·c++·算法·rpc·stl
秋天的怀念_David2 小时前
算法一千零一夜 · 第三十三夜 · 跳表
java·程序人生·算法
Pniubi5 小时前
力扣21合并两个有序链表
算法·leetcode·职场和发展
AIgorithmGEEK5 小时前
std::unordered_map 与 std::unordered_set:接口、算法技巧与权衡 (速查)
c++·算法·哈希表·负载因子·桶·unordered_map·unordered_set
上海潭龙东海科技有限公司7 小时前
智慧堆场动态模型三维实时孪生重构智能管控
大数据·网络·数据库·算法·重构
阿庆_AI研发工程师9 小时前
Stanford CS336 Lecture 10:大语言模型推理与性能优化
算法
用户7341681035489 小时前
基于MindSpore的深度残差收缩网络程序
算法
Pniubi10 小时前
力扣239.滑动窗口最大值(优先队列)
算法·leetcode·职场和发展
青少儿编程课堂11 小时前
第十八届蓝桥杯青少组图形化真题 + 全国青少年信息素养大赛 + 电子学会图形化考级:校园泡泡堂大挑战解析
c++·python·算法·bfs·信息学竞赛
超低空12 小时前
一文说清LRU算法
后端·算法·架构