fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #pragma region Macros
  5. #define Faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  6. #define ll long long
  7. #define ld long double
  8. #define pii pair<int, int>
  9. #define pll pair<long long, long long>
  10. #define all(x) x.begin(), x.end()
  11. #define rall(x) x.rbegin(), x.rend()
  12. #define pb push_back
  13. #define ff first
  14. #define ss second
  15. #define endl '\n'
  16. #define yes cout << "YES" << endl
  17. #define no cout << "NO" << endl
  18. #define m1 cout << -1 << endl
  19. #pragma endregion
  20.  
  21. #pragma region Math
  22. const ll MOD = 1e9 + 7;
  23. ll gcd(ll a, ll b) { return __gcd(a, b); }
  24. ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
  25. #pragma endregion
  26.  
  27. vector<ll>v;
  28. void store(){
  29. ll val=1;
  30. for(int i=1;i<17;i++){
  31. val*=10;
  32. v.push_back(val+1);
  33. }
  34. }
  35. void solve() {
  36. ll n; cin>>n;
  37. vector<ll>ans;
  38. for(int i=0;i<v.size();i++){
  39. if(n%v[i]==0){
  40. ans.push_back(n/v[i]);
  41. }
  42. }
  43. sort(all(ans));
  44. cout<<ans.size()<<endl;
  45. if(ans.size()==0) return;
  46. for(auto x:ans)
  47. cout<<x<<" ";
  48. cout<<endl;
  49. }
  50.  
  51. int main() {
  52. Faster;
  53. int t = 1;
  54. cin >> t;
  55. store();
  56. while (t--) solve();
  57. return 0;
  58. }
Success #stdin #stdout 0s 5324KB
stdin
5
1111
12
55
999999999999999999
1000000000000000000
stdout
2
11 101 
0
1
5 
3
999999999 999000999000999 90909090909090909 
0