fork download
copy 
  1.  
  2. /////////////////////////////////////////////////////////////////////////
  3. // ------------------------------------------------------------------- //
  4. // | Author: Fananhkhoi | Luong Van Chanh High School for the gifted | //
  5. // ------------------------------------------------------------------- //
  6. /////////////////////////////////////////////////////////////////////////
  7.  
  8.  
  9.   /* -------------------[ TALK LESS & DO MORE ]------------------- */
  10.  
  11.  
  12. // #pragma GCC target("popcnt,lzcnt,bmi,bmi2,abm")
  13.  
  14. #include <bits/stdc++.h>
  15. #include<ext/pb_ds/assoc_container.hpp>
  16. #include<ext/pb_ds/tree_policy.hpp>
  17. using namespace std;
  18. using namespace __gnu_pbds;
  19.  
  20. #define getBit(x, k) (((x) >> (k)) & 1)
  21. #define MASK(i) (1LL << (i))
  22. #define int long long
  23. //#define ll long long
  24. #define MOD 1000000007
  25. #define el "\n"
  26. #define vi vector<int>
  27. #define pii pair<int,int>
  28. #define vii vector<pii>
  29. #define FOU(i, l, r) for (int i = l; i <= r; i ++)
  30. #define FOD(i, r, l) for (int i = r; i >= l; i --)
  31. #define trav(a, x) for (auto &a : x )
  32. #define rep(i, a, b) for (int i = a; i < (b); i ++)
  33. #define gcd __gcd
  34. #define fi first
  35. #define se second
  36. #define MP make_pair
  37. #define pb push_back
  38. #define pf push_front
  39. #define all(v) v.begin(), v.end()
  40. #define rev(v) reverse(all(v))
  41. #define srt(v) sort(all(v))
  42. #define grtsrt(v) sort(all(v), greater<int>())
  43. #define sz(x) (int) (x).size()
  44. #define maxHeap priority_queue<int>
  45. #define minHeap priority_queue<int, vi, greater<int>>
  46. #define Fix(a, b) cout << fixed << setprecision((b)) << (a)
  47.  
  48. int dx[] = {};
  49. int dy[] = {};
  50.  
  51. template<class __, class ___> bool maximize(__ &x, ___ y){
  52.     if(x < y){
  53.         x = y;
  54.         return true;
  55.     }
  56.     else return false;
  57. }
  58.  
  59. template<class __, class ___> bool minimize(__ &x, ___ y){
  60.     if(x > y){
  61.         x = y;
  62.         return true;
  63.     }
  64.     else return false;
  65. }
  66.  
  67. inline int max(int a, int b){
  68.     return (a > b) ? a : b;
  69. }
  70.  
  71. inline int min(int a, int b){
  72.     return (a < b) ? a : b;
  73. }
  74.  
  75. 	/* --------------------[ MAIN CODE ]--------------------- */
  76. const int MaxN = 1e6 + 50;
  77. const int oo = 2e18;
  78.  
  79.  
  80. //void inp(){
  81. //
  82. //}
  83. //
  84. //void sol(){
  85. //
  86. //}
  87.  
  88.  
  89. int32_t main()
  90. {
  91.     ios_base::sync_with_stdio(false);
  92.     cin.tie(NULL);
  93.  
  94.     // freopen("GHH.INP", "r", stdin);
  95.     // freopen("GHH.OUT", "w", stdout);
  96.  
  97.     int t = 1;
  98.     bool multitest = 1;
  99.     if (multitest){
  100.         cin >> t;
  101.     }
  102.     vector<int> tmp;
  103.     while(t--){
  104.         int res = 0;
  105.         int n; cin >> n;
  106.         for (int i = 2; i * i <= n; i ++){
  107.             if (n % i == 0){
  108.                 res += i;
  109.                 if (n / i != i){
  110.                     res += (n / i);
  111.                 }
  112.             }
  113.         }
  114.         res += (n + 1);
  115.         if (2 * n <= res){
  116.             tmp.pb(n);
  117.         }
  118.         if (t == 1 && sz(tmp) != 0){
  119.             cout << sz(tmp) << el;
  120.             for (int &x : tmp){
  121.                 cout << x << el;
  122.             }
  123.         }
  124.     }
  125.     return 0;
  126. }
  127.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/WhjlUh
language:
C++14 (gcc 8.3)
created:
9 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!